Sciweavers

3974 search results - page 327 / 795
» Metric Functional Dependencies
Sort
View
KR
2004
Springer
16 years 29 days ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
TPHOL
2003
IEEE
16 years 26 days ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
ICDT
2003
ACM
127views Database» more  ICDT 2003»
16 years 24 days ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell
HASE
2002
IEEE
16 years 16 days ago
Extending WSDL to Facilitate Web Services Testing
Web services might be the most popular and powerful software development technology in today’s software world. Yet it brings software developers and tester a lot of challenges a...
Wei-Tek Tsai, Raymond A. Paul, Yamin Wang, Chun Fa...
PADO
2001
Springer
16 years 21 hour ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall