193 search results - page 26 / 39 » On the Progression Semantics and Boundedness of Answer Set P... |
AGP
2003
IEEE
15 years 1 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
106
Voted
ASP
2005
Springer
15 years 3 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 ...
84
Voted
ESWS
2005
Springer
15 years 3 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
14 years 9 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
15 years 2 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...