40 search results - page 3 / 8 » On Generalization and Subsumption for Ordered Clauses |
CADE
2009
Springer
16 years 6 days ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
82
Voted
ISMVL
1999
IEEE
15 years 3 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
112
click to vote
IJCAI
2001
15 years 1 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
IJCAI
2003
15 years 29 days ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
WWW
2003
ACM
16 years 8 days ago
2003
ACM
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...