DAML+OIL: A Reason-able Web Ontology Language
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
On Expressive Description Logics with Composition of Roles in Number Restrictions
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A NExpTime-Complete Description Logic Strictly Contained in C2
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Reviewing the design of DAML+OIL: an ontology language for the semantic web
Eighteenth national conference on Artificial intelligence
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Reasoning in expressive description logics
Handbook of automated reasoning
The description logic handbook
Complexity of the Two-Variable Fragment with Counting Quantifiers
Journal of Logic, Language and Information
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Deciding expressive description logics in the framework of resolution
Information and Computation
CTL Model-Checking with Graded Quantifiers
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
An Ontology-Based Approach to Validation of E-Services under Static and Dynamic Constraints
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Validation and Discovery of Non-deterministic Semantic e-Services
Web Services and Formal Methods
The Two-Variable Situation Calculus
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Journal of Artificial Intelligence Research
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Decision Procedures for Set-Valued Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
OWL rules: A proposal and prototype implementation
Web Semantics: Science, Services and Agents on the World Wide Web
Non-standard inferences in description logics
Non-standard inferences in description logics
Logic-based knowledge representation
Artificial intelligence today
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
The two-variable fragment with counting revisited
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
On the complexity of the Bernays-Schönfinkel class with datalog
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Graded alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Counting in the two variable guarded logic with transitivity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Bounded model checking of pointer programs
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Journal of Automated Reasoning
Two-Variable First-Order Logic with Equivalence Closure
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Two-Variable Logic with Counting and Trees
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We prove that the satisfiability and the finite satisfiability problems for C^2 are decidable. C^2 is first-order logic with only two variables in the presence of arbitrary counting quantifiers, "there exist at least m elements x", for m a natural number. It considerably extends L^2, plain first-order with only two variables, which is known to be decidable by a result of Mortimer's. Unlike L^2, C^2 does not have the finite model property.