1020 search results - page 16 / 204 » Tight Semantics for Logic Programs |
ENTCS
2006
13 years 7 months ago
2006
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
ENTCS
2007
13 years 7 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
NMR
2004
Springer
14 years 27 days ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...