460 search results - page 28 / 92 » Revised Stable Models - A Semantics for Logic Programs |
148
click to vote
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
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...
129
Voted
CL
2000
Springer
15 years 3 months ago
2000
Springer
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...
158
Voted
ICLP
1992
Springer
15 years 7 months ago
1992
Springer
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...
224
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
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...
259
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
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...