45 search results - page 8 / 9 » Elimination of Self-Resolving Clauses |
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
119
click to vote
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
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...
120
click to vote
UAI
1997
15 years 1 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
EACL
1989
ACL Anthology
15 years 26 days ago
1989
ACL Anthology
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...