443 search results - page 55 / 89 » SAT-Based Answer Set Programming |
ASP
2005
Springer
14 years 1 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
AAAI
2008
13 years 10 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...