✦ LIBER ✦

Hypothetical reasoning in logic programming: a semantic approach

✍ Scribed by Antonio Brogi; Evelina Lamma; Paula Mello

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 517 KB
Volume: 36
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90040-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conditional reasoning in logic programmi

Conditional reasoning in logic programming

✍ D. Gabbay; L. Giordano; A. Martelli; N. Olivetti; M.L. Sapino 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 286 KB

We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge

Efficient hypothetical reasoning system

Efficient hypothetical reasoning system for predicate-logic knowledge base

✍ A. Kondo; T. Makino; M. Ishizuka 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 820 KB

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

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

A declarative semantics for depth-first

A declarative semantics for depth-first logic programs

✍ Birgit Elbl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 438 KB

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

A proposal to reduce cumulative reasonin

A proposal to reduce cumulative reasoning time in hypothetical reasoning

✍ Hideaki Nobata; Haruhiko Kimura; Sadaki Hirose 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Considered in this paper is a method to reduce cumulative execution time in hypothetical reasoning using inference-path network. Logic-based hypothetical reasoning provides an efficient framework that can be applied to such areas as diagnostics and design, but in so doing, the reasoning speed may pr