AbstractThis paper investigates 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 of the guarded fragment which can be decided by hyperresolution. In particular, we prove decidability of hyperresolution with or without splitting for the fragment GF1− and point out several ways of extending this fragment without losing decidability. As hyperresolution is closely related to various tableaux methods the present work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clausal classes which are decidable...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We give resolution based decision procedures for both the strictly guarded fragment and the loosely ...
AbstractThe guarded fragment (GF) is a fragment of first-order logic that has been introduced for tw...
We give a decision procedure for the guarded fragment with equality. The procedure is based on resol...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
Desirable properties of a logic include decidability, and a model theory that inherits properties of...
We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to derive a r...
Aus der Einleitung: „The Guarded Fragment of first-order logic, introduced by Andréka, van Benthem, ...
In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadi...
Hyper tableau calculi are well-known as attempts to combine hyper-res- olution and tableaux. Beside...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
The notion of Deduction Chain (DC) was suggested by K.Schütte to prove the completeness of first or...
We investigate the decidability and computational complexity of (deductive) conservative extensions ...
Abstract OCC 1 N [11] is a decidable subclass of first-order clausal lo...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We give resolution based decision procedures for both the strictly guarded fragment and the loosely ...
AbstractThe guarded fragment (GF) is a fragment of first-order logic that has been introduced for tw...
We give a decision procedure for the guarded fragment with equality. The procedure is based on resol...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
Desirable properties of a logic include decidability, and a model theory that inherits properties of...
We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to derive a r...
Aus der Einleitung: „The Guarded Fragment of first-order logic, introduced by Andréka, van Benthem, ...
In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadi...
Hyper tableau calculi are well-known as attempts to combine hyper-res- olution and tableaux. Beside...
. This paper extends a calculus for first-order logic that combines the inference mechanism of hyper...
The notion of Deduction Chain (DC) was suggested by K.Schütte to prove the completeness of first or...
We investigate the decidability and computational complexity of (deductive) conservative extensions ...
Abstract OCC 1 N [11] is a decidable subclass of first-order clausal lo...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We show how well-known refinements of ordered resolution, in particular redundancy elimination and o...
We give resolution based decision procedures for both the strictly guarded fragment and the loosely ...