✦ LIBER ✦

A declarative semantics for depth-first logic programs

✍ Scribed by Birgit Elbl

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 438 KB
Volume: 41
Category: Article
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(98)10040-7

No coin nor oath required. For personal study only.

✦ Synopsis

Depth-®rst evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs. The paper presents a new semantics for logic programs closing that gap. Although not classical, this semantics, called biquantale semantics, is declarative, since it is based on a notion of validity in a certain class of models. Depth-®rst evaluation is sound and complete with respect to biquantale semantics. Thus, the computational result is exactly re¯ected. Complementing the model theoretic semantics by a proof theoretic one, a substructural calculus is presented which is sound and complete with respect to biquantale semantics. Although the main interest is in de®nite programs, we consider adding a form of negation. Both the model theoretic and the proof theoretic semantics can be generalised to programs with negation.

📜 SIMILAR VOLUMES

A kripke-kleene semantics for logic prog

A kripke-kleene semantics for logic programs*

✍ Melvin Fitting 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 895 KB

We use a language L in which we have the propositional connectives A (and), V (or), and -i (not) as primitive. Alternatively we could take some as primitive and define others via the usual definitions, which work even in Kleene's three-valued logic. We also allow quantifiers V and 3, taking both as

Probabilistic Semantics for First-Order

Probabilistic Semantics for First-Order Logic

✍ Hugues Leblanc 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 925 KB

A note on the stable model semantics for

A note on the stable model semantics for logic programs

✍ Michael Kaminski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

The stable model semantics for logic programs is extended from ground literals onto open literals by augmenting the program language with an infinite set of new constants. This, in turn, leads to a natural translation of logic programs into open default theories. @

Parametrized semantics of logic programs

Parametrized semantics of logic programs—a unifying framework

✍ Yann Loyer; Nicolas Spyratos; Daniel Stamate 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 288 KB

On the equivalence of semantics for norm

On the equivalence of semantics for normal logic programs

✍ Jia-Huai You; Li Yan Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 699 KB

Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by

A residualizing semantics for the partia

A residualizing semantics for the partial evaluation of functional logic programs

✍ Elvira Albert; Michael Hanus; Germán Vidal 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we intr