NMR
2004
Springer
14 years 4 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...
MATES
2004
Springer
14 years 4 months ago
2004
Springer
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
ECSQARU
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
FUZZIEEE
2007
IEEE
14 years 5 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...