Optimizing Description Logic Subsumption

Effective optimization techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. With currently-available desktop computers, systems that incorporate these techniques can effectively reason in description logics with intractable inference. Because of the correspondence between description logics and propositional modal logic, difficult problems in propositional modal logic can be effectively solved using the same techniques.

[1]  Peter Balsiger,et al.  Comparison of Theorem Provers for Modal Logics - Introduction and Summary , 1998, TABLEAUX.

[2]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[3]  Ulrike Sattler,et al.  A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.

[4]  Franz Baader.  Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.

[5]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[6]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[7]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[8]  Jon W. Freeman.  Hard Random 3-SAT Problems and the Davis-Putnam Procedure , 1996, Artif. Intell..

[9]  Peter F. Patel-Schneider,et al.  Living wiht Classic: When and How to Use a KL-ONE-Like Language , 1991, Principles of Semantic Networks.

[10]  Ian Horrocks,et al.  The GRAIL concept modelling language for medical terminology , 1997, Artif. Intell. Medicine.

[11]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

[12]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[13]  Francesco M. Donini,et al.  Decidable Reasoning in Terminological Knowledge Representation Systems , 1993, IJCAI.

[14]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[15]  Projektgruppe WINOPostfa.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991 .

[16]  Franz Baader,et al.  KRIS: Knowledge Representation and Inference System , 1991, SGAR.

[17]  Deborah L. McGuinness,et al.  Integrated Support for Data Archeology , 1993, Int. J. Cooperative Inf. Syst..

[18]  Sergio Tessaris,et al.  Implementing and Testing Expressive Description Logics: a Preliminary Report , 1995 .

[19]  P. Dangerfield.  Logic , 1996, Aristotle and the Stoics.

[20]  W. Nutt,et al.  Subsumption algorithms for concept languages , 1990 .

[21]  Jon Doyle,et al.  Principles of knowledge representation and reasoning : proceedings of the fifth international conference (KR'96), Cambridge, Massachusetts, November 5-8, 1996 , 1996 .

[22]  P. E. van der Vet,et al.  Runtime and memory usage performance of description logics , 1995 .

[23]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[24]  Francesco M. Donini,et al.  Decidable reasoning in terminological knowledge representation systems , 1993 .

[25]  Vaughan R. Pratt.  A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[26]  Bernhard Nebel,et al.  An Empirical Analysis of Terminological Representation Systems , 1992, Artif. Intell..

[27]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[28]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[29]  A. B. Baker.  Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results , 1995 .

[30]  Ian R. Horrocks,et al.  A C OMPARISON OF TWO TERMINOLOGICAL KNOWLEDGE REPRESENTATION SYSTEMS , 1995 .

[31]  Peter F. Patel-Schneider,et al.  FaCT and DLP , 1998, TABLEAUX.

[32]  A L Rector,et al.  Goals for concept representation in the GALEN project. , 1993, Proceedings. Symposium on Computer Applications in Medical Care.

[33]  Fausto Giunchiglia,et al.  A SAT-based Decision Procedure for ALC , 1996, KR.

[34]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[35]  Harrie de Swart,et al.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[36]  Werner Nutt,et al.  Terminological Knowledge Representation: A Proposal for a Terminological Logic , 1991, Description Logics.

[37]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logics , 1997 .

[38]  Giuseppe De Giacomo,et al.  Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL , 2000, Inf. Comput..

[39]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

[40]  I. Horrocks,et al.  DL Systems Comparison , 1998 .

[41]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[42]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[43]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[44]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[45]  Guy W. Mineau,et al.  Knowledge Retrieval, Use and Storage for Efficiency , 1999, Comput. Intell..