✦ LIBER ✦

The IFF proof procedure for abductive logic programming

✍ Scribed by Tze Ho Fung; Robert Kowalski

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 766 KB
Volume: 33
Category: Article
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)00026-5

No coin nor oath required. For personal study only.

✦ Synopsis

72E H0 FUN6 AND R08ER7 K0WAL5K1

1n th15 pape~ We 0Ut11ne a pr00f pr0cedUre Wh~h C0m61ne5 rea50n1n9 W1th def1ned pred1Cate5 t09ether W1th rea50n1n9 W1th Undef1ned, a6dUC161e,

📜 SIMILAR VOLUMES

Abduction in logic programming: A new de

Abduction in logic programming: A new definition and an abductive procedure based on rewriting

✍ Fangzhen Lin; Jia-Huai You 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 255 KB

A long outstanding problem for abduction in logic programming has been on how minimality might be defined. Without minimality, an abductive procedure is often required to generate exponentially many subsumed explanations for a given observation. In this paper, we propose a new definition of abductio

Completeness Proofs for Some Logics of P

Completeness Proofs for Some Logics of Programs

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

Proof method of partial correctness and

Proof method of partial correctness and weak completeness for normal logic programs

✍ Gérard Ferrand; Pierre Deransart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 951 KB

Unified logic programming approach to th

Unified logic programming approach to the abduction of plans and intentions in information-seeking dialogues

✍ Paulo Quaresma; JoséGabriel Lopes 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 820 KB

## ~> We propose a framework that supports the recognition of plans and intentions behind speech acts through abductive inferences over discourse sentences. These inferences allow each agent to have an active and intelligent participation in dialogues, namely, in cooperative information-seeking di

THE JUDGEMENT CALCULUS FOR INTUITIONISTI

THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS

✍ Silvio Valentini 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 958 KB

## Abstract In this paper we propose a new set of rules for a judgement calculus, i.e. a typed lambda calculus, based on Intuitionistic Linear Logic; these rules ease the problem of defining a suitable mathematical semantics. A proof of the canonical form theorem for this new system is given: it as

On the Floyd–Warshall algorithm for logi

On the Floyd–Warshall algorithm for logic programs

✍ Christos Papadimitriou; Martha Sideri 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 114 KB

We explore the possibility of evaluating single-rule Datalog programs eciently and with logarithmic work space by a natural extension of the Floyd±Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated ± they are rather modest gener