Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Conclusions
References
All Topics
Computer Science
Computational Theory and Mathematics

A Description Logics Tableau Reasoner in Prolog

Profile image of Riccardo ZeseRiccardo Zese

2013

visibility

…

description

15 pages

link

1 file

Abstract

Description Logics (DLs) are gaining a widespread adoption as the popularity of the Semantic Web increases. Traditionally, reasoning algorithms for DLs have been implemented in procedural languages such as Java or C++. In this paper, we present the system TRILL for “Tableau Reasoner for descrIption Logics in proLog”. TRILL answers queries to SHOIN (D) knowledge bases using a tableau algorithm. Prolog nondeterminism is used for easily handling non-deterministic expansion rules that produce more than one tableau. Moreover, given a query, TRILL is able to return instantiated explanations for the query, i.e., instantiated minimal sets of axioms that allow the entailment of the query. The Thea2 library is exploited by TRILL for parsing ontologies and for the internal Prolog representation of DL axioms.

Related papers

An Overview of Tableau Algorithms for Description Logics
Uli Sattler

Studia Logica

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system KL-ONE. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which tableau procedures have been quite successful. Nevertheless, due to different underlying intuitions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms.

View PDFchevron_right
Model driven engineering of a tableau algorithm for description logics
Dragan Gasevic

Computer Science and Information Systems, 2009

ABSTRACT This paper presents a method for implementing tableau algorithm for description logics (DLs). The architectures of the present DL reasoners such as RACER or FaCT were developed using programming languages as Java or LISP. The implementations are not based on original definition of the abstract syntax, but they require transformation of abstract syntax into concrete syntax implementation languages use. In order to address these issues, we propose the use of model-driven engineering principles for the development of a DL reasoner where a definition of a DL abstract syntax is provided by means of metamodels. The presented approach is based on the use of a MOF-based model repository and QVT-like transformations, which transform models compliant to the DL metamodel taken from the OMG's Ontology Definition Metamodel specification into models compliant to the Tableau metamodel defined in this paper.

View PDFchevron_right
The DR-Prolog Tool Suite for Defeasible Reasoning and Proof Explanation In the Semantic Web
Antonis Bikakis

Artificial Intelligence: Theories, …, 2008

In this work we present the design and general architecture of DR-Prolog, a system for defeasible reasoning and proof explanation in the Semantic Web, and the implementation of three different tools that constitute the DR-Prolog Tool Suite: (a) the DR-Prolog API; (b) the DR-Prolog Web application; and (c) the DR-Prolog desktop application. DR-Prolog supports reasoning with Defeasible Logic theories and ontological knowledge in RDF(S) and OWL, is compatible with RuleML, and enables extracting meaningful proof explanations for the answers it computes.

View PDFchevron_right
Hypertableau reasoning for description logics
Ian Horrocks

2009

Abstract We present a novel reasoning calculus for the description logic SHOIQ+—a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nondeterminism and the construction of large models are two primary sources of inefficiency in the tableau-based reasoning calculi used in state-of-the-art reasoners. In order to reduce nondeterminism, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination.

View PDFchevron_right
First Order Logic in Semantic Tableau and VAMPIRE
Ijesrt Journal

Semantic tableau is a proof system used to prove the validity of a formula using Prolog, it can also be used to prove if a formula is a logic consequence of a set of formulas. Semantic tableau is used in both propositional and predicate logic. Tableau is a disjunction normal form. VAMPIRE is a high-performance theorem prover for first-order logic with or without equality. In this paper, a modified version of semantic tableau is presented, experimental results proved the validity of modified tableau. Also, it is shown how Tableau proof system and VAMPIRE can be used in predicate logic.

View PDFchevron_right
A Set-Based Reasoner for the Description Logic DL4, xD
Daniele Santamaria

2018

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic DL〈4LQSR,×〉(D) (DL D , for short). Our application solves the main TBox and ABox reasoning problems for DL D . In particular, it solves the consistency problem for DL D -knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and optimizes a previous prototype for the consistency checking of DL D -knowledge bases (see [7]), is implemented in C++. It supports DL D -knowledge bases serialized in the OWL/XML format, and it admits also rules expressed in SWRL (Semantic Web Rule Language).

View PDFchevron_right
Prolog Execution Engines for Description Logic
Péter Szeredi

2009

Introduction. The goal of this poster is to present some Prolog-based [3] alternatives for Description Logic ABox-reasoning. We believe that Prolog can be used well for extending DL formalisms with rules. The top-down executional mechanism of Prolog suits the ABox-reasoning task by ignoring irrelevant data, and it is also worth to mention that the Prolog community has been developping

View PDFchevron_right
MDA-Based Architecture of a Description Logics Reasoner
Vladan Devedzic

IFIP International Federation for Information Processing, 2006

The paper presents the architecture and design of a description logics (DLs) reasoner based on the Model Driven Architecture (MDA) methodology. The architecture relies on OMG's description logics metamodel, tableau metamodel, and model transformations using a language for model transformation. We show an example of DLs knowledge base using UML notation in context of MDA. The idea can be easily applied to implementation of a first-order logic theorem prover. The paper does not discuss implementation details of reasoning algorithms and the reasoner performance.

View PDFchevron_right
jCel: A modular rule-based reasoner
Julian Alfredo Mendez

2012

jcel is a reasoner for the description logic EL + that uses a rule-based completion algorithm. These algorithms are used to get subsumptions in the lightweight description logic EL and its extensions. One of these extensions is EL + , a description logic with restricted expressivity, but used in formal representation of biomedical ontologies. These ontologies can be encoded using the Web Ontology Language (OWL), and through the OWL API, edited using the popular ontology editor Protégé. jcel implements a subset of the OWL 2 EL profile, and can be used as a Java library or as a Protégé plug-in. This system description presents the architecture and main features of jcel, and reports some of the challenges and limitations faced in its development.

View PDFchevron_right
Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
Riccardo Zese

Theory and Practice of Logic Programming, 2019

When modeling real-world domains, we have to deal with information that is incomplete or that comes from sources with different trust levels. This motivates the need for managing uncertainty in the Semantic Web. To this purpose, we introduced a probabilistic semantics, named DISPONTE, in order to combine description logics (DLs) with probability theory. The probability of a query can be then computed from the set of its explanations by building a Binary Decision Diagram (BDD). The set of explanations can be found using the tableau algorithm, which has to handle non-determinism. Prolog, with its efficient handling of non-determinism, is suitable for implementing the tableau algorithm. TRILL and TRILL P are systems offering a Prolog implementation of the tableau algorithm. TRILL P builds a pinpointing formula that compactly represents the set of explanations and can be directly translated into a BDD. Both reasoners were shown to outperform state-of-the-art DL reasoners. In this paper,...

View PDFchevron_right

References (29)

  1. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applica- tions. Cambridge University Press (2003)
  2. Baader, F., Horrocks, I., Sattler, U.: Description logics. In: Handbook of knowledge representation, chap. 3, pp. 135-179. Elsevier (2008)
  3. Beckert, B., Posegga, J.: leantap: Lean tableau-based deduction. J. Autom. Rea- soning 15(3), 339-358 (1995)
  4. Bellodi, E., Riguzzi, F.: Learning the structure of probabilistic logic programs. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS, vol. 7207, pp. 61-75. Springer (2012)
  5. Bellodi, E., Riguzzi, F.: Expectation Maximization over binary decision diagrams for probabilistic logic programs. Intel. Data Anal. 17(2), 343-363 (2013)
  6. Faizi, I.: A Description Logic Prover in Prolog, Bachelor's thesis, Informatics Math- ematical Modelling, Technical University of Denmark (2011)
  7. Halaschek-Wiener, C., Kalyanpur, A., Parsia, B.: Extending tableau tracing for ABox updates. Tech. rep., University of Maryland (2006)
  8. Herchenröder, T.: Lightweight Semantic Web Oriented Reasoning in Prolog: Tableaux Inference for Description Logics. Master's thesis, School of Informatics, University of Edinburgh (2006)
  9. Hitzler, P., Krötzsch, M., Rudolph, S.: Foundations of Semantic Web Technologies. CRCPress (2009)
  10. Hustadt, U., Motik, B., Sattler, U.: Deciding expressive description logics in the framework of resolution. Inf. Comput. 206(5), 579-601 (2008)
  11. Kalyanpur, A.: Debugging and Repair of OWL Ontologies. Ph.D. thesis, The Grad- uate School of the University of Maryland (2006)
  12. Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding all justifications of OWL DL entailments. In: Aberer, K., et al. (eds.) ISWC/ASWC 2007. LNCS, vol. 4825, pp. 267-280. Springer (2007)
  13. Kalyanpur, A., Parsia, B., Sirin, E., Hendler, J.A.: Debugging unsatisfiable classes in OWL ontologies. J. Web Sem. 3(4), 268-293 (2005)
  14. Lukácsy, G., Szeredi, P.: Efficient description logic reasoning in prolog: The dlog system. TPLP 9(3), 343-414 (2009)
  15. Meissner, A.: An automated deduction system for description logic with alcn lan- guage. Studia z Automatyki i Informatyki 28-29, 91-110 (2004)
  16. Patel-Schneider, P, F., Horrocks, I., Bechhofer, S.: Tutorial on OWL (2003)
  17. Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57-95 (1987)
  18. Riguzzi, F., Bellodi, E., Lamma, E., , Zese, R.: Probabilistic description logics under the distribution semantics. Tech. Rep. ML-01, University of Ferrara (2013), http://sites.unife.it/ml/bundle
  19. Riguzzi, F., Bellodi, E., Lamma, E.: Probabilistic Datalog+/-under the distribu- tion semantics. In: Kazakov, Y., Lembo, D., Wolter, F. (eds.) DL 2012. CEUR Workshop Proceedings, vol. 846. Sun SITE Central Europe (2012)
  20. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Epistemic and statistical probabilistic ontologies. In: Bobillo, F., et al. (eds.) URSW 2012. CEUR Workshop Proceedings, vol. 900, pp. 3-14. Sun SITE Central Europe (2012)
  21. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: BUNDLE: A reasoner for proba- bilistic ontologies. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 183-197. Springer (2013), http://www.ing.unife.it/docenti/FabrizioRiguzzi/ Papers/RigBelLam-RR13b.pdf
  22. Riguzzi, F., Bellodi, E., Lamma, E., Zese, R.: Parameter learning for probabilistic ontologies. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 265-270.
  23. Springer (2013), http://www.ing.unife.it/docenti/FabrizioRiguzzi/Papers/ RigBelLam-RR13a.pdf
  24. Sato, T.: A statistical learning method for logic programs with distribution seman- tics. In: ICLP 1995. pp. 715-729. MIT Press (1995)
  25. Sattler, U., Calvanese, D., Molitor, R.: Relationships with other formalisms. In: Description Logic Handbook, chap. 4, pp. 137-177. Cambridge University Press (2003)
  26. Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003. pp. 355-362. Morgan Kaufmann (2003)
  27. Sirin, E., Parsia, B., Cuenca-Grau, B., Kalyanpur, A., Katz, Y.: Pellet: A practical OWL-DL reasoner. J. Web Sem. 5(2), 51-53 (2007)
  28. Vassiliadis, V., Wielemaker, J., Mungall, C.: Processing owl2 ontologies using thea: An application of logic programming. In: International Workshop on OWL: Ex- periences and Directions. CEUR Workshop Proceedings, vol. 529. CEUR-WS.org (2009)
  29. Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory and Practice of Logic Programming 12(1-2), 67-96 (2012)

Related papers

Tableau Reasoners for Probabilistic Ontologies Exploiting Logic Programming Techniques
Riccardo Zese

The adoption of Description Logics for modeling real world domains within the Semantic Web is exponentially increased in the last years, also due to the availability of a large number of reasoning algorithms. Most of them exploit the tableau algorithm which has to manage non-determinism, a feature that is not easy to handle using procedural languages such as Java or C++. Reasoning on real world domains also requires the capability of managing probabilistic and uncertain information. We thus present TRILL, for "Tableau Reasoner for descrIption Logics in proLog" and TRILL P , for "TRILL powered by Pinpointing formulas", which implement the tableau algorithm and return the probability of queries. TRILL P , instead of the set of explanations for a query, computes a Boolean formula representing them, speeding up the computation.

View PDFchevron_right
Tableau reasoning for description logics and its extension to probabilities
Riccardo Zese

Annals of Mathematics and Artificial Intelligence, 2016

The increasing popularity of the Semantic Web drove to a widespread adoption of Description Logics (DLs) for modeling real world domains. To help the diffusion of DLs, a large number of reasoning algorithms have been developed. Usually these algorithms are implemented in procedural languages such as Java or C++. Most of the reasoners exploit the tableau algorithm which features non-determinism, that is not easily handled by those languages. Prolog directly manages non-determinism, thus is a good candidate for dealing with the tableau's non-deterministic expansion rules. We present TRILL, for "Tableau Reasoner for descrIption Logics in pro-Log", that implements a tableau algorithm and is able to return explanations for queries and their corresponding probability, and TRILL P , for "TRILL powered by Pinpointing formulas", which is able to compute a Boolean formula representing the set of explanations for a query. Reasoning on real world domains also requires the capability of managing probabilistic and uncertain information. We show how TRILL and TRILL P can be used to compute the probability of queries to knowledge bases following DISPONTE semantics. Experiments comparing these with other systems show the feasibility of the approach.

View PDFchevron_right
An optimized KE-tableau-based system for reasoning in the description logic DL 4 , × D ( Extended Version )
Daniele Santamaria

2018

We present a KE-tableau-based procedure for the main TBox and ABox reasoning tasks for the description logic DL〈4LQSR,×〉(D), in short DL D . The logic DL 4,× D , representable in the decidable multi-sorted quantified set-theoretic fragment 4LQS, combines the high scalability and efficiency of rule languages such as the Semantic Web Rule Language (SWRL) with the expressivity of description logics. Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KE-tableau, turns out to be an improvement of the system introduced in [3] and of standard first-order KE-tableaux [8]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KE-tableaubased reasoner are up to about 400% better than the ones of the other

View PDFchevron_right
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners
Jan Maluszynski

2007

The paper presents a prototype system HD-Rules (Hybrid integration of Description Logic and Rules)that integrates normal clauses under the well- founded semantics with ontologies specified in Description Logics. The system is hybrid: it re-uses XSB Prolog for rule reasoning and existing OWL reason- ers for ontology reasoning. This makes it possible to use some Prolog built-ins (like arithmetic) in the rules. The system itself is written in XSB Prolog; its inter- face to OWL employs Java. The paper outlines the principles of the integration, illustrates the use of the system on examples, and discusses in detail the main implementation techniques.

View PDFchevron_right
Translating OWL and semantic web rules into prolog: Moving toward description logic programs
Deborah Nichols

Theory and Practice of Logic Programming, 2008

We are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL and its rule extension SWRL to develop an integrated ontology/rule language, and 2) layering rules on top of an ontology with RuleML and OWL. Toward this end, we are developing the SWORIER system, which enables efficient automated reasoning on ontologies and rules, by translating all of them into Prolog and adding a set of general rules that properly capture the semantics of OWL. We have also enabled the user to make dynamic changes on the fly, at run time. This work addresses several of the concerns expressed in previous work, such as negation, complementary classes, disjunctive heads, and cardinality, and it discusses alternative approaches for dealing with inconsistencies in the knowledge base. In addition, for efficiency, we implemented techniques called extensionalization, avoiding reanalysis, and code minimization.

View PDFchevron_right

Related topics

  • Computer Science
  • Description logics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved