Upside-down transformation in SOL/connection tableaux and its application

Authors:
Koji Iwanuma;Katsumi Inoue;Hidetomo Nabeshima
Affiliations:
University of Yamanashi, Yamanashi, Japan;National Institute of Informatics, Tokyo, Japan;University of Yamanashi, Yamanashi, Japan
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 7
Cited 0

Linear resolution for consequence finding

Artificial Intelligence
Computing answers with model elimination

Artificial Intelligence
Automated Abduction

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Using Matings for Pruning Connection Tableaux

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A completeness theorem and a computer program for finding theorems derivable from given axioms

A completeness theorem and a computer program for finding theorems derivable from given axioms
Speculative Computation Through Consequence-Finding in Multi-Agent Environments

Annals of Mathematics and Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study an upside-down transformation of a branch in SOL/Connection tableaux and show that SOL/Connection tableaux using the folding-up operation can always accomplish a size-preserving transformation for any branch in any tableau. This fact solves the exponentially-growing size problem caused both by the order- preserving reduction and by an incremental answer computation problem.