Theory of linear and integer programming
Theory of linear and integer programming
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Attributive concept descriptions with complements
Artificial Intelligence
Making object-oriented schemas more expressive
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Description logics for conceptual data modeling
Logics for databases and information systems
On the complexity of integer programming
Journal of the ACM (JACM)
Complexity Results for First-Order Two-Variable Logic with Counting
SIAM Journal on Computing
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamentals of Cardinality Constraints
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Reviewing the design of DAML+OIL: an ontology language for the semantic web
Eighteenth national conference on Artificial intelligence
Complexity of Two-Variable Logic with Counting
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic with counting is decidable
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The Description Logic Handbook
The Description Logic Handbook
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
How to decide query containment under constraints using a description logic
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Query Answering in Description Logics: The Knots Approach
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Finite model reasoning in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Finite satisfiability of UML class diagrams with constrained class hierarchy
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
Hi-index | 0.02 |
We analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.