Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
PROTEIN: A PROver with a Theory Extension INterface
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Living Book -- Deduction, Slicing, and Interaction
Journal of Automated Reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
Optimized Reasoning in Description Logics Using Hypertableaux
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
System Description: E- KRHyper
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
LogAnswer - A Deduction-Based Question Answering System (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
An application of automated reasoning in natural language question answering
AI Communications - Practical Aspects of Automated Reasoning
Anaphora resolution involving interactive knowledge acquisition
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Sine Qua non for large theory reasoning
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automated reasoning support for first-order ontologies
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Hi-index | 0.00 |
Formal ontologies may go beyond first-order logic (FOL) in their expressivity, hindering the usage of common automated theorem provers (ATP) for ontology reasoning. The Unique Name Assumption (UNA) is an extension to FOL that is valuable for ontology specification, allowing the definition of distinct objects. Likewise, the Description Logic $\mathcal{SHIQ}$ is a popular language for knowledge representation (KR). This system description provides details on the extension of the prover E-KRHyper by the ability to handle both the UNA and $\mathcal{SHIQ}$. This ATP was developed for embedding in KR applications and hence already equipped with special features and extensions to FOL, making it natural to add the new capabilities in E-KRHyper version 1.4. We report on the theory, the implementation and also the evaluation results of the new features.