308 search results - page 7 / 62 » Answer Set Programming Based on Propositional Satisfiability |
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
FOIKS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
NMR
2004
Springer
14 years 29 days 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
EPIA
2005
Springer
14 years 1 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...