2000•Unpublished venueRequires access

Hyperresolution for Guarded Formulae.

Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt

Open publisher page 3 citations

Abstract

. Recently we have been investigating the use of hyperresolution as a decision procedure and model builder for guarded formulae. In general hyperresolution is not a decision procedure for the entire guarded fragment. However we show that there are natural fragments which can be decided by hyperresolution [9]. As hyperresolution is closely related to various tableaux methods the work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clause classes solvable by hyperresolution. The guarded fragment of rst-order logic was introduced in Andreka, van Benthem and Nemeti [1, 2]. It extends the modal fragment which corresponds to basic modal logic (via the relational translation) and is an important decidable class which contains many extended modal logics and description logics. Among the most notable properties of the guarded fragment in addition to decidability are Craig interpolation, bisimulation invariance, Bet...

About this research paper

What this paper is about

. Recently we have been investigating the use of hyperresolution as a decision procedure and model builder for guarded formulae. In general hyperresolution is not a decision procedure for the entire guarded fragment. However we show that there are natural fragments which can be decided by hyperresolution [9]. As hyperresolution is closely related to various tableaux methods the work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clause classes solvable by hyperresolution. The guarded fragment of rst-order logic was introduced in Andreka, van Benthem and Nemeti [1, 2]. It extends the modal fragment which corresponds to basic modal logic (via the relational translation) and is an important decidable class which contains many extended modal logics and description logics. Among the most notable properties of the guarded fragment in addition to decidability are Craig interpolation, bisimulation invariance, Bet...

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

. Recently we have been investigating the use of hyperresolution as a decision procedure and model builder for guarded formulae. In general hyperresolution is not a decision procedure for the entire guarded fragment. However we show that there are natural fragments which can be decided by hyperresolution [9]. As hyperresolution is closely related to various tableaux methods the work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clause classes solvable by hyperresolution. The guarded fragment of rst-order logic was introduced in Andreka, van Benthem and Nemeti [1, 2]. It extends the modal fragment which corresponds to basic modal logic (via the relational translation) and is an important decidable class which contains many extended modal logics and description logics. Among the most notable properties of the guarded fragment in addition to decidability are Craig interpolation, bisimulation invariance, Bet...

Key concepts: Decidability, Fragment (logic), Mathematics, Point (geometry), Atomic formula, Computer science, Discrete mathematics, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Hyperresolution for Guarded Formulae. — Research Paper | ScholarLens