Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Resolution Methods for the Decision Problem
Resolution Methods for the Decision Problem
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Two-Variable Fragment of English
Journal of Logic, Language and Information
Splitting Through New Proposition Symbols
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
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
The Two-Variable Situation Calculus
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Using tableau to decide expressive description logics with role negation
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
Economical discourse representation theory
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Using tableau to decide description logics with full role negation and identity
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The two-variable-fragment L驴 2 of first order logic is the set of formulas that do not contain function symbols, that possibly contain equality, and that contain at most two variables. This paper shows how resolution theorem-proving techniques can be used to provide an algorithm for deciding whether any given formula in L驴 2 is satisfiable. Previous resolution-based techniques could deal only with the equality-free subset L2 of the two-variable fragment.