Untitled

Baumgartner, Peter; Brüning, Stefan

doi:10.1023/a:1005812703468

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1999

2005

Publication Types

Select...

Article3

Book2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Controlled Use of Clausal Lemmas in Connection Tableau Calculi

Fuchs

2000

Journal of Symbolic Computation

View full text Add to dashboard Cite

Proof procedures based on model elimination or the connection tableau calculus have become more and more successful. But these procedures still suffer from long proof lengths as well as from a rather high degree of redundant search effort in comparison with resolution-style search procedures. In order to overcome these problems we investigate the use of clausal lemmas. We develop a method to augment a given set of clauses by a lemma set in a preprocessing phase and discuss the ability of this technique to reduce proof lengths and depths and to provide an appropriate reordering of the search space. We deal with the basic connection tableau calculus as well as with several calculus refinements and extensions. In order to control the use of lemmas we develop techniques for selecting relevant lemmas based on partial evaluation techniques. Experiments with the prover Setheo performed in several domains demonstrate the high potential of our approach.

show abstract