✦ LIBER ✦

Acyclic logic programs and the completeness of SLDNF-resolution

✍ Scribed by Lawrence Cavedon

Book ID: 107948656
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 796 KB
Volume: 86
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90005-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completeness of hyper-resolution via the

Completeness of hyper-resolution via the semantics of disjunctive logic programs

✍ Linh Anh Nguyen; Rajeev Goré 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 106 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

The Completeness of Free Logic

✍ B. C. van Fraassen 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

The completeness of gp-resolution for an

The completeness of gp-resolution for annotated logics

✍ James J. Lu; Lawrence J. Henschen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Expressiveness and the completeness of H

Expressiveness and the completeness of Hoare's logic

✍ J.A. Bergstra; J.V. Tucker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 984 KB

The Semantic Completeness of a Global In

The Semantic Completeness of a Global Intuitionistic Logic

✍ Hiroshi Aoyama 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar system