Fatima Danash
ABSTRACT
Logical languages provide rigid formalisms for theories with varying expressive and scalable powers. In ontology engineering, it is popular to to provide a two-folded formalization of a theory; an expressive FOL formalization, and a decidable SROIQ fragment. Such a task requires a systematic and principled translation of the set of FOL formulas to achieve a maximally expressive decidable fragment. While no principled work exists for providing guidelines for the translation of FOL theories into SROIQ knowledge bases, this paper contributes with such a translation procedure.
- 2012. OWL 2 Web Ontology Language Document Overview (Second Edition). W3C Recommendation. W3C. https://www.w3.org/TR/2012/REC-owl2-overview-20121211/.Google Scholar
- Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Kybernetes 32 (2003).Google ScholarDigital Library
- Alessander Benevides, Jean-Rémi Bourguet, Giancarlo Guizzardi, Rafael Peñaloza, and João Almeida. 2019. Representing a reference foundational ontology of events in SROIQ. Applied Ontology 14 (07 2019), 1--42. Google ScholarDigital Library
- Francis Gasse, Uli Sattler, and Volker Haarslev. 2008. Rewriting Rules into SROIQ Axioms.Google Scholar
- Giancarlo Guizzardi. 2006. On Ontology, ontologies, Conceptualizations, Modeling Languages, and (Meta)Models. 18--39.Google Scholar
- Ian Horrocks, Oliver Kutz, and Uli Sattler. 2006. The even more irresistible SROIQ. The even More Irresistible SROIQ, 57--67.Google Scholar
- Ian Horrocks and Peter F Patel-Schneider. 2004. A proposal for an OWL rules language. In Proceedings of the 13th international conference on World Wide Web. 723--731.Google ScholarDigital Library
- Ian Horrocks, Ulrike Sattler, and Stephan Tobies. 1999. Practical reasoning for expressive description logics. In International Conference on Logic for Programming Artificial Intelligence and Reasoning. Springer, 161--180.Google ScholarCross Ref
- Markus Krötzsch, Frantisek Simancik, and Ian Horrocks. 2012. A Description Logic Primer. CoRR abs/1201.4089 (2012). arXiv:1201.4089 http://arxiv.org/abs/1201.4089Google Scholar
- Riccardo Rosati. 2005. On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3, 1 (2005), 61--73.Google ScholarDigital Library
- Guus Schreiber and Mike Dean. 2004. OWL Web Ontology Language Reference. W3C Recommendation. W3C. https://www.w3.org/TR/2004/REC-owl-ref-20040210/.Google Scholar
- N. Shadbolt, T. Berners-Lee, and W. Hall. 2006. The Semantic Web Revisited. IEEE Intelligent Systems 21, 3 (2006), 96--101. Google ScholarDigital Library
- Raymond M Smullyan. 1995. First-order logic. Courier Corporation.Google Scholar
- Sergio Tessaris. 2001. Questions and answers: reasoning and querying in Description Logic. The University of Manchester (United Kingdom).Google Scholar
Index Terms
- Translating FOL-theories into SROIQ-Tboxes
Recommendations
An Isabelle/HOL Formalization of the SCL(FOL) Calculus
Automated Deduction – CADE 29AbstractWe present an Isabelle/HOL formalization of Simple Clause Learning for first-order logic without equality: SCL(FOL). The main results are formal proofs of soundness, non-redundancy of learned clauses, termination, and refutational completeness. ...
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. To integrate interactive provers with automatic ones, one must translate higher-order formulas to first-order form. The translation should ...
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice
AbstractWe discuss the practical results obtained by the first generation of automated theorem provers based on Deduction modulo theory. In particular, we demonstrate the concrete improvements such a framework can bring to first-order theorem provers with ...
Comments