Computing updates in description logics

Acknowledgements I am deeply indebted to Franz Baader and Carsten Lutz, my thesis advisors, for their valuable guidance of my researching work and constant support of all technical problems. Without either of them, this thesis would not exist. I am grateful to Maja Miliči´c and Frank Wolter who have also helped me a lot in the last four years. I would like to thank Conrad Drescher, Boontawee Suntisrivaraporn, and Rafael Peñaloza for proofreading the preliminary version of my thesis. I would also like to thank all members of the chair for automata theory. It is a pleasure to work with you. Many thanks go to our secretary, Kerstin Achtruth, for her support in countless matters. I am also thankful to Anni-Yasmin Turhan for her encouragement. I would like to express my gratitude to my mother for her endless love and unconditional support. No one is prouder of this thesis than she is. This thesis is dedicated to her.

[1]  Manfred Schmidt-Schauß,et al.  Subsumption in KL-ONE is Undecidable , 1989, KR.

[2]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[3]  F. Baader,et al.  Integrate Action Formalisms into Linear Temporal Description Logics , 2009 .

[4]  Carsten Lutz,et al.  Reasoning About Actions Using Description Logics with General TBoxes , 2006, JELIA.

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

[6]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[7]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[8]  Patrick Doherty,et al.  The PMA and relativizing change for action update , 1998 .

[9]  E. Emerson,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.

[10]  Michael Thielscher,et al.  Reasoning robots - the art and science of programming robotic agents , 2005, Applied logic series.

[11]  Gert Smolka,et al.  Spartacus: A Tableau Prover for Hybrid Logic , 2010, Electron. Notes Theor. Comput. Sci..

[12]  F. Wolter,et al.  Temporalizing Description Logics , 1998, FroCoS.

[13]  Alex Borgiday.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996 .

[14]  Ulrike Sattler,et al.  Modal Logic and the Two-Variable Fragment , 2001, CSL.

[15]  Albert Oliveras,et al.  Challenges in Satisfiability Modulo Theories , 2007, RTA.

[16]  Rafael Peñaloza,et al.  Automata-Based Axiom Pinpointing , 2010, Journal of Automated Reasoning.

[17]  P. Bonatti.  The Complexity of Circumscription in Description Logic , 2009 .

[18]  Carsten Lutz,et al.  Updating Description Logic ABoxes , 2006, KR.

[19]  Giovanna DAgostino.  Modal Logic and non-well-founded Set Theory: translation, bisimulation, interpolation , 1998 .

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

[21]  Fangzhen Lin,et al.  How to Progress a Database , 1997, Artif. Intell..

[22]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[23]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[24]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[25]  William Craig,et al.  Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.

[26]  Gerhard Lakemeyer,et al.  Point-based value iteration: an anytime algorithm for POMDPs , 2003, IJCAI 2003.

[27]  Grigoris Antoniou,et al.  On Applying the AGM Theory to DLs and OWL , 2005, SEMWEB.

[28]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[29]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[30]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[31]  李幼升,et al.  Ph , 1989 .

[32]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indeterminate Effects of Actions , 1996, AAAI/IAAI, Vol. 1.

[33]  Renate A. Schmidt,et al.  Using Tableau to Decide Expressive Description Logics with Role Negation , 2007, ISWC/ASWC.

[34]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[35]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[36]  Ian Horrocks,et al.  14 OWL : a Description Logic Based Ontology Language for the Semantic Web , 2006 .

[37]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[38]  E. A Emerson,et al.  Model Checking Under Generalized Fairness Constraints , 1984 .

[39]  Maurizio Lenzerini,et al.  On the Approximation of Instance Level Update and Erasure in Description Logics , 2007, AAAI.

[40]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[41]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[42]  Michael Thielscher,et al.  Putting ABox Updates into Action , 2009, FroCoS.

[43]  Francesco M. Donini,et al.  The size of a revised knowledge base , 1995, PODS '95.

[44]  Huajun Chen,et al.  The Semantic Web , 2011, Lecture Notes in Computer Science.

[45]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[46]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[47]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[48]  John A. Barnden,et al.  Semantic Networks , 1998, Encyclopedia of Social Network Analysis and Mining.

[49]  Alexander Borgida,et al.  Language features for flexible handling of exceptions in information systems , 1985, TODS.

[50]  Alfred Tarski,et al.  Logic, Semantics, Metamathematics: Papers from 1923 to 1938 , 1958 .

[51]  Maja Milicic Brandt.  Action, time and space in description logics , 2008 .

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

[53]  R. Smullyan.  First-Order Logic , 1968 .

[54]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[55]  Carsten Lutz,et al.  The Projection Problem for EL Actions , 2008, Description Logics.

[56]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[57]  Ian Horrocks,et al.  Description Logics as Ontology Languages for the Semantic Web , 2005, Mechanizing Mathematical Reasoning.

[58]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[59]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[60]  Leszek Pacholski,et al.  Complexity Results for First-Order Two-Variable Logic with Counting , 2000, SIAM J. Comput..

[61]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[62]  Stephan Tobies,et al.  The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics , 2011, ArXiv.

[63]  Boontawee Suntisrivaraporn,et al.  Polynomial time reasoning support for design and maintenance of large-scale biomedical ontologies , 2008 .

[64]  Andreas Weber,et al.  Updating Propositional Formulas , 1986, Expert Database Conf..

[65]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[66]  Ulrike Sattler,et al.  The Complexity of Reasoning with Boolean Modal Logics , 2000, Advances in Modal Logic.

[67]  Carsten Lutz,et al.  Chair for Automata Theory LTCS – Report Description Logic Actions with general TBoxes : a Pragmatic Approach , 2006 .

[68]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[69]  Hirofumi Katsuno,et al.  A Unified View of Propositional Knowledge Base Updates , 1989, IJCAI.

[70]  Ronald Fagin,et al.  On the semantics of updates in databases , 1983, PODS.

[71]  G. Flouris,et al.  On belief change and ontology evolution , 2006 .

[72]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[73]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[74]  M R Quillian,et al.  Word concepts: a theory and simulation of some basic semantic capabilities. , 1967, Behavioral science.

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

[76]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[77]  Yarden Katz,et al.  Belief Base Revision for Expressive Description Logics , 2006, OWLED.

[78]  Michael Thielscher,et al.  Integrating Action Calculi and Description Logics , 2007, KI.

[79]  Martín Abadi,et al.  Security analysis of cryptographically controlled access to XML documents , 2005, PODS '05.

[80]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[81]  Grigoris Antoniou,et al.  Evolving Ontology Evolution , 2006, SOFSEM.

[82]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[83]  Bill Swartout,et al.  Description-Logic Knowledge Representation System Specification from the KRSS Group of the ARPA Know , 1993 .

[84]  Peter F. Patel-Schneider,et al.  Reducing OWL entailment to description logic satisfiability , 2004, Journal of Web Semantics.

[85]  M. de Rijke,et al.  From Description to Hybrid Logics, and Back , 2000, Advances in Modal Logic.

[86]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[87]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[88]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[89]  W. Salmon,et al.  Knowledge in Flux , 1991 .

[90]  Maarten Marx,et al.  Handling Boolean ABoxes , 2003 .

[91]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[92]  Maja Milicic.  Action, Time and Space in Description Logics , 2008 .

[93]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[94]  Peter Gärdenfors,et al.  Knowledge in Flux , 1988 .

[95]  Christel Baier,et al.  Principles of model checking , 2008 .

[96]  Maja Milicic Brandt,et al.  Complexity of Planning in Action Formalisms Based on Description Logics , 2007, LPAR.

[97]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

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

[99]  Maurizio Lenzerini,et al.  On the Update of Description Logic Ontologies at the Instance Level , 2006, AAAI.

[100]  Michael Thielscher,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Flux: a Logic Programming Method for Reasoning Agents , 2003 .

[101]  Franz Baader,et al.  Integrating Description Logics and Action Formalisms: First Results , 2005, Description Logics.

[102]  Andreas Herzig,et al.  The PMA Revisited , 1996, KR.

[103]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[104]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.