1020 search results - page 56 / 204 » Tight Semantics for Logic Programs |
123
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
PPDP
2004
Springer
15 years 5 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
103
click to vote
TCS
2011
14 years 6 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
103
click to vote
SLP
1994
15 years 1 months ago
1994
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...
143
click to vote
IBERAMIA
2010
Springer
14 years 9 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...