45 search results - page 3 / 9 » Elimination of Self-Resolving Clauses |
99
Voted
IJCAI
1989
15 years 25 days ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
107
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
89
Voted
TABLEAUX
1992
Springer
15 years 3 months ago
1992
Springer
CORR
2010
Springer
14 years 11 months ago
2010
Springer
traction for Size-Change Termination
93
Voted
CADE
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...