834 search results - page 14 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
130
click to vote
NMR
2004
Springer
15 years 5 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
2010
15 years 1 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
116
click to vote
LPNMR
2005
Springer
15 years 5 months ago
2005
Springer
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
108
click to vote
IJAR
2010
14 years 10 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
AAAI
2004
15 years 1 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...