294 search results - page 32 / 59 » Relation between Semantic Completeness and Syntax Completene... |
CADE
1998
Springer
13 years 12 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
SDB
1995
13 years 11 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
DOCENG
2003
ACM
14 years 29 days ago
2003
ACM
A number of applications that process XML documents interpret them as objects of application specific classes in a given domain. Generic interfaces such as SAX and DOM leave this ...
POPL
2002
ACM
14 years 8 months ago
2002
ACM
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
ASSETS
2005
ACM
13 years 9 months ago
2005
ACM
While strings and syntax trees are used by the Natural Language Processing community to represent the structure of spoken languages, these encodings are difficult to adapt to a si...