2585 search results - page 421 / 517 » Automating Coherent Logic |
237
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
251
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
145
Voted
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
166
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
154
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...