Sciweavers

142 search results - page 7 / 29
» On the Existence of Answer Sets in Normal Extended Logic Pro...
Sort
View
ASP
2003
Springer
15 years 9 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
SLP
1994
89views more  SLP 1994»
15 years 5 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
JELIA
2010
Springer
15 years 2 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar
RTA
2010
Springer
15 years 8 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
ECSQARU
2005
Springer
15 years 10 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
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...
Pascal Nicolas, Laurent Garcia, Igor Stépha...