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...
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...
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...
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ö...
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...