Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
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
Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas
CL '00 Proceedings of the First International Conference on Computational Logic
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Invited Talk: Rewrite-based Deduction and Symbolic Constraints
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Deciding the guarded fragments by resolution
Journal of Symbolic Computation
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Resolution decision procedures
Handbook of automated reasoning
Paramodulation with Built-In Abelian Groups
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Constructing decision procedures in equational clausal logic
Fundamenta Informaticae
Hyperresolution for guarded formulae
Journal of Symbolic Computation - Special issue: First order theorem proving
Journal of Symbolic Computation
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
ACM Transactions on Computational Logic (TOCL)
The axiomatic translation principle for modal logic
ACM Transactions on Computational Logic (TOCL)
Automated theorem proving by resolution in non-classical logics
Annals of Mathematics and Artificial Intelligence
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
Deciding expressive description logics in the framework of resolution
Information and Computation
Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Instantiation-Based Automated Reasoning: From Theory to Practice
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
AI Communications - Practical Aspects of Automated Reasoning
OWL rules: A proposal and prototype implementation
Web Semantics: Science, Services and Agents on the World Wide Web
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Deciding the inductive validity of ∀∃* queries
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Describing and deriving certain answers over partial databases
Journal of Intelligent Information Systems
Resolution with Order and Selection for Hybrid Logics
Journal of Automated Reasoning
Statically safe program generation with SafeGen
Science of Computer Programming
A tableaux based decision procedure for a broad class of hybrid formulae with binders
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A resolution-based decision procedure for SHOIQ
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Deciding monodic fragments by temporal resolution
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Statically safe program generation with safegen
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Constructing Decision Procedures in Equational Clausal Logic
Fundamenta Informaticae
Journal of Automated Reasoning
Hi-index | 0.00 |
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in practice than methods based on the enumeration of certain finite structures. It is surprising to see that one does not need any sophisticated simplification and redundancy elimination method to make superposition terminate on the class of clauses that is obtained from the clausification of guarded formulas. Yet the decision procedure obtained is optimal with regard to time complexity. We also show that the method can be extended to the loosely guarded fragment with equality.