✦ LIBER ✦

Partial deduction in disjunctive logic programming

✍ Scribed by Chiaki Sakama; Hirohisa Seki

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 917 KB
Volume: 32
Category: Article
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00120-3

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunctive programs and the stable model semantics of normal disjunctive programs. From the procedural side, disjunctive partial deduction is combined with a bottom-up proof procedure of disjunctive logic programs, and top-down partial deduction is introduced for query optimization. Disjunctive partial deduction is also applied to optimizing abductive logic programs and compiling propositional disjunctive programs.

📜 SIMILAR VOLUMES

Argumentation-based abduction in disjunc

Argumentation-based abduction in disjunctive logic programming

✍ Kewen Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 274 KB

In this paper, we propose an argumentation-based semantic framework, called DAS, for disjunctive logic programming. The basic idea is to translate a disjunctive logic program into an argumentation-theoretic framework. One unique feature of our proposed framework is to consider the disjunctions of ne

Abductive logic programming and disjunct

Abductive logic programming and disjunctive logic programming: their relationship and transferability

✍ Chiaki Sakama; Katsumi Inoue 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 207 KB

An abductive approach to disjunctive log

An abductive approach to disjunctive logic programming

✍ Jia-Huai You; Li Yan Yuan; Randy Goebel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Nonmonotonic reasoning has been explored as a form of abductive reasoning where default assumptions are treated as abductive hypotheses. While the semantics and proof theories under this approach have been studied extensively, the question of how disjunctive programs may be used to reason abductivel

Enhancing disjunctive logic programming

Enhancing disjunctive logic programming systems by SAT checkers

✍ Christoph Koch; Nicola Leone; Gerald Pfeifer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Semantics of Horn and disjunctive logic

Semantics of Horn and disjunctive logic programs

✍ Jorge Lobo; Arcot Rajasekar; Jack Minker 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Unfold/fold transformations for disjunct

Unfold/fold transformations for disjunctive logic programs

✍ Manolis Gergatsoulis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Unfold/fold transformation rules for disjunctive logic programs are proposed in this paper. Our transformation rules preserve the meaning of the programs. @ 1997 Elsevier Science B.V.