The Constraint Logic Programming (CLP) Scheme was introduced by Jaar and Lassez. The scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the ®rst time the semantic foundations
Parametrized semantics of logic programs—a unifying framework
✍ Scribed by Yann Loyer; Nicolas Spyratos; Daniel Stamate
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 288 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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 i
## Intell Syst 1997, 12 , 57᎐81 a collection of epistemic logics were reviewed and critiqued. This sequel paper provides evidence for the claim that a unifying framework for various existing epistemic logics can be defined. Of particular interest is the logic of implicit and explicit belief, the l