✦ LIBER ✦

A semantic backward chaining proof system

✍ Scribed by Xumin Nie; David A. Plaisted

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 967 KB
Volume: 55
Category: Article
ISSN: 0004-3702
DOI: 10.1016/0004-3702(92)90044-x

No coin nor oath required. For personal study only.

✦ Synopsis

Nie, X. and D.A. Plaisted, A semantic backward chaining proof system, Artificial Intelligence 55 (1992) 109-128. We discuss a refutationally complete sequent style clause-based proof system that supports several important strategies in automatic theorem proving. The system has a goal-subgnal structure and supports backward chaining with caching. It permits semantic deletion, sometimes using multiple interpretations. It is also a genuine support strategy. We also show how to use multiple interpretations to control the case analysis rule, also called the splitting rule, how to design interpretations and how to select input clauses for a theorem.

📜 SIMILAR VOLUMES

Forward and Backward Chaining in Linear

Forward and Backward Chaining in Linear Logic (Extended Abstract)

✍ James A. Harland; David J. Pym; Michael Winikoff 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A decision logic schema of process plann

A decision logic schema of process planning using backward chaining reasoning

✍ Huan-Min Xu; Liang-Chuan Mi; Dong-Bo Li 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 326 KB

A Semantic Proof of Polytime Soundness o

A Semantic Proof of Polytime Soundness of

✍ Ugo Dal Lago; Martin Hofmann 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 478 KB

Notes Towards a Semantics for Proof-sear

Notes Towards a Semantics for Proof-search

✍ David J. Pym 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Algorithmic proof-search is an essential enabling technology throughout informatics. Proof-search is the proof-theoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a well-developed semantics of proo

Experimental results from parallel backw

Experimental results from parallel backward-chained expert systems

✍ Lawrence O. Hall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

There are many applications which may be done by an expert system in real time, if the system is capable of real time response. The first Lisp-and Prolog-based expert systems have typically been too slow for real time response. This has lead to an effort to use other languages, the development of fa

The Hauptsatz for Stratified Comprehensi

The Hauptsatz for Stratified Comprehension: A Semantic Proof

✍ Marcel Crabbé 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB

## Abstract We prove the cut‐elimination theorem, Gentzen's Hauptsatz, for the system for stratified comprehension, i. e. Quine's NF minus extensionality. Mathematics Subject Classification: 03B15, 03F05.