Simplification and Backjumping in Modal Tableau

Authors:
Ullrich Hustadt;Renate A. Schmidt
Affiliations:
-;-
Venue:
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
1998

Citing 2
Cited 9

Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
On evaluating decision procedures for modal logic

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

KtSeqC: System Description

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A General Theorem Prover for Quantified Modal Logics

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The Taming of the (X)OR

CL '00 Proceedings of the First International Conference on Computational Logic
KK: a theorem prover for K

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Hyperresolution for guarded formulae

Journal of Symbolic Computation - Special issue: First order theorem proving
On the relation of resolution and tableaux proof systems for description logics

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Logic-based knowledge representation

Artificial intelligence today
FCUBE: an efficient prover for intuitionistic propositional logic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Simplification Rules for Intuitionistic Propositional Tableaux

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism in tableau calculi, as well as simplification and backjumping. Benchmark results obtained with randomly generated modal formulae show the effect of combinations of different schemes.