36 search results - page 1 / 8 » ASSAT: computing answer sets of a logic program by SAT solve... |
AI
2004
Springer
13 years 4 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
AAAI
2006
13 years 6 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
AAAI
2004
13 years 6 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...