Modal resolution in clausal form
Theoretical Computer Science
Definability with bounded number of bound variables
Information and Computation
The resolution program, able to decide some solvable classes
COLOG-88 Proceedings of the international conference on Computer logic
The resolution calculus
Expressiveness of concept expressions in first-order description logics
Artificial Intelligence
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
Generic Resolution in Propositional Modal Systems
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Resolution Games and Non-Liftable Resolution Orderings
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A Resolution Decision Procedure for the Guarded Fragment
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Splitting Through New Proposition Symbols
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Hyperresolution for guarded formulae
Journal of Symbolic Computation - Special issue: First order theorem proving
On the complexity of division and set joins in the relational algebra
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
On the complexity of division and set joins in the relational algebra
Journal of Computer and System Sciences
The axiomatic translation principle for modal logic
ACM Transactions on Computational Logic (TOCL)
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
Resolution with Order and Selection for Hybrid Logics
Journal of Automated Reasoning
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
The guarded fragment (GF) is a fragment of first-order logic that has been introduced for two main reasons: first, to explain the good computational and logical behaviour of propositional modal logics. Second, to serve as a breeding ground for well-behaved process logics. In this paper we give resolution-based decision procedures for the GF and for the loosely guarded fragment (LGF) (sometimes also called the pairwise guarded fragment). By constructing an implementable decision procedure for the GF and for the LGF, we obtain an effective procedure for deciding modal logics that can be embedded into these fragments. The procedures have been implemented in the theorem prover Bliksem.