Sciweavers

460 search results - page 28 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
AMAI
2006
Springer
13 years 8 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
CL
2000
Springer
13 years 7 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
ICLP
1992
Springer
13 years 12 months ago
A Declarative View of Inheritance in Logic Programming
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
Michele Bugliesi
ICLP
2009
Springer
14 years 8 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
POPL
2009
ACM
14 years 8 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri