Add to ORKGWe show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obtain a decision procedure for the guarded fragment with transitive guards. Another contribution of the paper is a special scheme notation, that allows to describe saturation strategies and show their correctness in a concise for
AbstractIn this paper we derive a generic form of structural decomposition for the constraint satisf...
ABSTRACT. The resolution principle, an automatic inference technique, is studied as a possible decis...
The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic mo...
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 ...
We present resolution-based decision procedures for the guarded, two-variable and monadic fragments ...
We give a decision procedure for the guarded fragment with equality. The procedure is based on resol...
AbstractThe guarded fragment (GF) is a fragment of first-order logic that has been introduced for tw...
We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to derive a r...
AbstractWe investigate the complexity of the satisfiability problem for the two-variable guarded fra...
The two-variable fragment of first-order logic is the set of formulas that do not contain function s...
We consider the restriction of the guarded fragment to the two-variable case where, in addition, bi...
AbstractThis paper investigates the use of hyperresolution as a decision procedure and model builder...
In this paper we derive a generic form of structural decomposition for the constraint satisfaction p...
AbstractIn this paper we derive a generic form of structural decomposition for the constraint satisf...
ABSTRACT. The resolution principle, an automatic inference technique, is studied as a possible decis...
The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic mo...
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 ...
We present resolution-based decision procedures for the guarded, two-variable and monadic fragments ...
We give a decision procedure for the guarded fragment with equality. The procedure is based on resol...
AbstractThe guarded fragment (GF) is a fragment of first-order logic that has been introduced for tw...
We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to derive a r...
AbstractWe investigate the complexity of the satisfiability problem for the two-variable guarded fra...
The two-variable fragment of first-order logic is the set of formulas that do not contain function s...
We consider the restriction of the guarded fragment to the two-variable case where, in addition, bi...
AbstractThis paper investigates the use of hyperresolution as a decision procedure and model builder...
In this paper we derive a generic form of structural decomposition for the constraint satisfaction p...
AbstractIn this paper we derive a generic form of structural decomposition for the constraint satisf...
ABSTRACT. The resolution principle, an automatic inference technique, is studied as a possible decis...
The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic mo...