106 search results - page 2 / 22 » From Answer Set Logic Programming to Circumscription via Log... |
JELIA
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
RR
2010
Springer
13 years 2 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
LPNMR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...