189 search results - page 27 / 38 » Similarity-Guided Clause Generalization |
COLT
1992
Springer
15 years 3 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
ICLP
1990
Springer
15 years 3 months ago
1990
Springer
Although Warren's method for the evaluation in Prolog of expressions with higherorder functions appears to have been neglected, it is of great value. Warren's paper need...
CADE
1998
Springer
15 years 4 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...
PSSS
2003
15 years 1 months ago
2003
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
AAAI
1992
15 years 26 days ago
1992
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...