Access the full text.
Sign up today, get DeepDyve free for 14 days.
If one takes the union of the labels of the edges in any path from the root of HST to a leaf node marked with OK , then a hitting set for All-MinAs ( Q, K ) w.r.t. K
R. Reiter (1986)
A Theory of Diagnosis from First PrinciplesArtif. Intell., 32
(2006)
Extending Tableau Tracing for ABox Updates
G. Gottlob, Thomas Lukasiewicz, Gerardo Simari (2011)
Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies
F. Bacchus (1991)
Representing and reasoning with probabilistic knowledge - a logical approach to probabilities
Aditya Kalyanpur (2006)
Debugging and Repair of OWL Ontologies
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese (2013)
BUNDLE: A Reasoner for Probabilistic Ontologies
I. Faizi (2011)
A Description Logic Prover in Prolog
Vangelis Vassiliadis, J. Wielemaker, C. Mungall (2009)
Processing OWL2 Ontologies using Thea: An Application of Logic Programming
Rommel Carvalho, Kathryn Laskey, P. Costa (2010)
PR-OWL 2.0 - Bridging the gap to OWL semantics
Jochen Heinsohn (1994)
Probabilistic Description LogicsArXiv, abs/1302.6817
Aditya Kalyanpur, B. Parsia, M. Horridge, E. Sirin (2007)
Finding All Justifications of OWL DL Entailments
N. Nilsson, Donald Loveland
Probabilistic Logic *
Gergely Lukácsy, P. Szeredi (2009)
Efficient description logic reasoning in Prolog: The DLog systemTheory and Practice of Logic Programming, 9
Joseph Halpern (1989)
An Analysis of First-Order Logics of ProbabilityArtif. Intell., 46
Thomas Herchenr (2006)
Lightweight Semantic Web Oriented Reasoning in Prolog: Tableaux Inference for Description Logics
I. Ceylan, R. Peñaloza (2015)
Probabilistic Query Answering in the Bayesian Description Logic BEL
P. Hitzler, M. Krötzsch, S. Rudolph (2009)
Foundations of Semantic Web Technologies
Claudia d’Amato, N. Fanizzi, Thomas Lukasiewicz (2008)
Tractable Reasoning with Bayesian Description Logics
M Jaeger (1994)
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR’94)
Thomas Lukasiewicz (2000)
Probabilistic Default Reasoning with Conditional ConstraintsAnnals of Mathematics and Artificial Intelligence, 34
N. Eén, Niklas Sörensson (2003)
An Extensible SAT-solver
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese (2015)
Probabilistic Description Logics under the distribution semanticsSemantic Web, 6
F. Baader, R. Peñaloza (2007)
Axiom Pinpointing in General Tableaux
If a node is not a leaf of HST, then its label is an element of the set All-MinAs ( Q, K )
Thomas Lukasiewicz (2008)
Expressive probabilistic description logicsArtif. Intell., 172
E. Demir, Michael Cary, S. Paley, Ken Fukuda, C. Lemer, Imre Vastrik, Guanming Wu, P. D’Eustachio, C. Schaefer, Joanne Luciano, F. Schacherer, Irma Martínez-Flores, Zhenjun Hu, V. Jiménez-Jacinto, G. Joshi-Tope, K. Kandasamy, Alejandra López-Fuentes, H. Mi, E. Pichler, I. Rodchenkov, A. Splendiani, S. Tkachev, Jeremy Zucker, Gopal Gopinath, H. Rajasimha, R. Ramakrishnan, I. Shah, M. Syed, Nadia Anwar, O. Babur, M. Blinov, Erik Brauner, D. Corwin, S. Donaldson, F. Gibbons, Robert Goldberg, P. Hornbeck, Augustin Luna, Peter Murray-Rust, Eric Neumann, Oliver Reubenacker, M. Samwald, Martijn Iersel, S. Wimalaratne, Keith Allen, Burk Braun, M. Whirl‐Carrillo, K. Dahlquist, A. Finney, M. Gillespie, E. Glass, L. Gong, R. Haw, Michael Honig, Olivier Hubaut, D. Kane, Shiva Krupa, M. Kutmon, Julie Leonard, D. Marks, D. Merberg, V. Petri, A. Pico, Dean Ravenscroft, Liya Ren, N. Shah, M. Sunshine, Rebecca Tang, R. Whaley, Stan Letovksy, K. Buetow, A. Rzhetsky, V. Schachter, B. Sobral, U. Dogrusoz, S. McWeeney, M. Aladjem, E. Birney, J. Collado-Vides, S. Goto, M. Hucka, N. Novère, N. Maltsev, A. Pandey, P. Thomas, E. Wingender, P. Karp, C. Sander, Gary Bader (2010)
BioPAX – A community standard for pathway data sharingNature biotechnology, 28
(2003)
Tutorial on OWL
José Luna, K. Revoredo, Fabio Cozman (2011)
Learning Probabilistic Description Logics: A Framework and Algorithms
F. Ricca, L. Gallucci, R. Schindlauer, Tina Dell'Armi, G. Grasso, N. Leone (2009)
OntoDLV: An ASP-based System for Enterprise OntologiesJ. Log. Comput., 19
C. Lutz, Lutz Schröder (2010)
Probabilistic Description Logics for Subjective UncertaintyJ. Artif. Intell. Res., 58
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese (2013)
Parameter Learning for Probabilistic Ontologies
I. Ceylan, R. Peñaloza (2014)
Bayesian Description Logics
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese (2015)
Reasoning with Probabilistic Ontologies
D. Poole (2000)
Abducing through negation as failure: stable models within the independent choice logicJ. Log. Program., 44
Z Ding, Y Peng (2004)
A probabilistic extension to ontology language OWL. In: 37th Hawaii International Conference on System Sciences (HICSS-37 2004), CD-ROM / Abstracts Proceedings, 5-8 January 2004
Elena Bellodi, E. Lamma, Fabrizio Riguzzi, Simone Albani (2011)
A Distribution Semantics for Probabilistic Ontologies
D. Nardi, W. Nutt, F. Donini (2003)
The Description Logic Handbook: Theory, Implementation, and Applications
M. Gavanelli, E. Lamma, Fabrizio Riguzzi, Elena Bellodi, Riccardo Zese, Giuseppe Cota (2015)
Abductive logic programming for Datalog +/- ontologies
C Lutz, L Schröder (2010)
Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010
Taisuke Sato (1995)
A Statistical Learning Method for Logic Programs with Distribution Semantics
P. Klinov, B. Parsia (2008)
Optimization and Evaluation of Reasoning in Probabilistic Description Logic: Towards a Systematic Approach
J. Jung, C. Lutz (2012)
Ontology-Based Access to Probabilistic Data with OWL QL
Elena Bellodi, Fabrizio Riguzzi (2011)
Learning the Structure of Probabilistic Logic Programs
M. Jaeger (1994)
Probabilistic Reasoning in Terminological Logics
F. Baader, R. Peñaloza (2008)
Automata-Based Axiom PinpointingJournal of Automated Reasoning, 45
D. Koller, A. Halevy, A. Pfeffer (1997)
P-CLASSIC: A Tractable Probablistic Description Logic
S. Schlobach, R. Cornet (2003)
Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies
M. Gavanelli, E. Lamma, Fabrizio Riguzzi, Elena Bellodi, Riccardo Zese, Giuseppe Cota (2015)
An Abductive Framework for Datalog± Ontologies
Elena Bellodi, Fabrizio Riguzzi (2013)
Expectation maximization over binary decision diagrams for probabilistic logic programsIntell. Data Anal., 17
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese, Giuseppe Cota (2013)
Learning Probabilistic Description Logics
E. Sirin, B. Parsia, B. Grau, Aditya Kalyanpur, Yarden Katz (2007)
Pellet: A practical OWL-DL reasonerJ. Web Semant., 5
M. Codish, Vitaly Lagoon, Peter Stuckey (2007)
Logic programming with satisfiabilityTheory and Practice of Logic Programming, 8
Kathryn Laskey, P. Costa (2005)
Of Starships and Klingons: Bayesian Logic for the 23rd CenturyArXiv, abs/1207.1354
R. Giugno, Thomas Lukasiewicz (2002)
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
D. Poole (1997)
The Independent Choice Logic for Modelling Multiple Agents Under UncertaintyArtif. Intell., 94
JC Jung, C Lutz (2012)
The Semantic Web - ISWC 2012 - 11th International Semantic Web Conference, Boston, MA, USA, November 11-15, 2012, Proceedings, Part I, Lecture Notes in Computer Science (LNCS), vol. 7649
JEO Luna, K Revoredo, FG Cozman (2011)
Advances in Artificial Intelligence - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Puebla, Mexico, November 26 - December 4, 2011, Proceedings, Part I, Lecture Notes in Computer Science, vol. 7094
F. Baader, Ian Horrocks, U. Sattler (2004)
Description Logics
T. Lager, J. Wielemaker (2014)
Pengines: Web Logic Programming Made EasyTheory and Practice of Logic Programming, 14
M. Bruynooghe, Theofrastos Mantadelis, Angelika Kimmig, Bernd Gutmann, Joost Vennekens, Gerda Janssens, L. Raedt (2010)
ProbLog Technology for Inference in a Probabilistic First Order Logic
(2004)
An automated deduction system for description logic with alcn language
Description Logics 3.1 Introduction
A. Calí, Thomas Lukasiewicz, L. Predoiu, H. Stuckenschmidt (2009)
Tightly Coupled Probabilistic Description Logic Programs for the Semantic WebJ. Data Semant., 12
U. Hustadt, B. Motik, U. Sattler (2008)
Deciding expressive description logics in the framework of resolutionInf. Comput., 206
Bernhard Beckert, J. Posegga (1995)
leanTAP: Lean tableau-based deductionJournal of Automated Reasoning, 15
Zhongli Ding, Yun Peng (2004)
A probabilistic extension to ontology language OWL37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the
Tableau Reasoning for Description Logics and its Extension to Probabilities
P. Costa, Kathryn Laskey, K. Laskey (2005)
PR-OWL: A Bayesian Ontology Language for the Semantic Web
Fabrizio Riguzzi, Elena Bellodi, E. Lamma, Riccardo Zese (2012)
Epistemic and Statistical Probabilistic Ontologies
I. Ceylan, Julian Mendez, R. Peñaloza (2015)
The Bayesian Ontology Reasoner is BORN!
P. Klinov (2008)
Pronto: A Non-monotonic Probabilistic Description Logic Reasoner
Gábor Nagypál, R. Deswarte, J. Oosthoek (2005)
Applying the Semantic Web: The VICODI Experience in Creating Visual Contextualization for HistoryLit. Linguistic Comput., 20
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 proLog”, 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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.