Implementation and Optimisation Techniques

This chapter will discuss the implementation of the reasoning services which form the core of Description Logic based Knowledge Representation Systems. To be useful in realistic applications, such systems need both expressive logics and fast reasoners. As expressive logics inevitably have high worst-case complexities, this can only be achieved by employing highly optimised implementations of suitable reasoning algorithms. Systems based on such implementations have demonstrated that they can perform well with problems that occur in realistic applications, including problems where unoptimised reasoning is hopelessly intractable.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

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

[3]  Edward A. Feigenbaum,et al.  Artificial intelligence research , 1963, IEEE Trans. Inf. Theory.

[4]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[5]  G. Miller,et al.  Cognitive science. , 1981, Science.

[6]  Hector J. Levesque,et al.  Krypton: A Functional Approach to Knowledge Representation , 1983, Computer.

[7]  Peter F. Patel-Schneider,et al.  The CLASSIC knowledge representation system: guiding principles and implementation rationale , 1991, SGAR.

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

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

[10]  Jon Doyle,et al.  Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and the Utility of Representation Services , 1991, Artif. Intell..

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

[12]  Robert M. MacGregor,et al.  Inside the LOOM description classifier , 1991, SGAR.

[13]  Gerard Ellis,et al.  Compiled hierarchical retrieval , 1992 .

[14]  Alexander Borgida.  Description Logics are not just for the Flightless-Birds: A New Look at the Utility and Foundations , 1992 .

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

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

[17]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

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

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

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

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

[22]  Gerhard Jäger,et al.  A Logics Workbench , 1996, AI Commun..

[23]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

[24]  Franz Baader,et al.  Number Restrictions on Complex Roles in Description Logics: A Preliminary Report , 1996, KR.

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

[26]  Giuseppe De Giacomo,et al.  Tableaux and Algorithms for Propositional Dynamic Logic with Converse , 1996, CADE.

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

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

[29]  Nancy E. Reed,et al.  Practical Reasoning , 1996, Lecture Notes in Computer Science.

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

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

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

[33]  Ullrich Hustadt,et al.  Issues of Decidability for Description Logics in the Framework of Resolution , 1998, FTP.

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

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

[36]  Fabio Massacci,et al.  TANCS non classical system comparison , 1999 .

[37]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[38]  Francesco M. Donini,et al.  Design and results of TANCS-00 , 2000 .

[39]  Ian Horrocks,et al.  Knowledge Representation on the Web , 2000, Description Logics.

[40]  Ian Horrocks,et al.  OilEd: a Reason-able Ontology Editor for the Semantic Web , 2001, Description Logics.

[41]  Ulf Assarsson,et al.  A Benchmark for , 2001 .

[42]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[43]  David A. Plaisted,et al.  Automated Deduction Techniques for Classification in Description Logic Systems , 1998, Journal of Automated Reasoning.