426 search results - page 11 / 86 » Combining Answer Sets of Nonmonotonic Logic Programs |
ECSQARU
2005
Springer
14 years 1 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
EUSFLAT
2009
13 years 5 months ago
2009
NMR
2004
Springer
14 years 27 days 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...
KR
1998
Springer
13 years 11 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
ASP
2003
Springer
14 years 24 days ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...