4513 search results - page 96 / 903 » Logic programming with satisfiability |
159
click to vote
ACL2
2006
ACM
15 years 7 months ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
120
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
106
Voted
INAP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This article merges two approaches: one dealing with persistence for logic programs, as provided by a relational database back-end and another which addresses the issues ...
106
click to vote
ASP
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
112
click to vote
KR
1994
Springer
15 years 7 months ago
1994
Springer
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...