Logic Engineering. The Case of Description and Hybrid Logics

xiii

[1]  Dov M. Gabbay,et al.  Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[2]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[3]  Valentin Goranko,et al.  Hierarchies of modal and temporal logics with reference pointers , 1996, J. Log. Lang. Inf..

[4]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[5]  J. Seligman.  The Logic of Correct Description , 1997 .

[6]  M. de Rijke,et al.  Encoding Two-Valued Nonclassical Logics in Classical Logic , 2001, Handbook of Automated Reasoning.

[7]  Patrick Blackburn,et al.  Hybrid Languages and Temporal Logic (Full Version) , 1998 .

[8]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

[9]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[10]  Ullrich Hustadt,et al.  Resolution-Based Methods for Modal Logics , 2000, Log. J. IGPL.

[11]  Maarten de Rijke,et al.  Prefixed Resolution: A Resolution Method for Modal and Description Logics , 1999, CADE.

[12]  Carsten Lutz,et al.  Complexity of Terminological Reasoning Revisited , 1999, LPAR.

[13]  Stephan Tobies.  PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[14]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[15]  Jon R. Wright,et al.  A Knowledge-Based Configurator that Supports Sales, Engineering, and Manufacturing at AT&T Network Systems , 1993, AI Mag..

[16]  Alan Robinson,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[17]  A. Prior.  Papers On Time And Tense , 1968 .

[18]  L. L. Maksimova,et al.  An analog of Beth's theorem in normal extensions of the modal logic K4 , 1992 .

[19]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

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

[21]  Stephan Tobies.  A PSpace Algorithm for Graded Modal Logic , 1999, CADE.

[22]  Y. Gurevich.  The decision problem for the logic of predicates and of operations , 1969 .

[23]  Diego Calvanese,et al.  Conjunctive Query Containment in Description Logics with n-ary Relations , 1997, Description Logics.

[24]  Patrick Blackburn,et al.  Tense, Temporal Reference, and Tense Logic , 1994, J. Semant..

[25]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

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

[27]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[28]  A. Nakamura,et al.  On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

[29]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[30]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[31]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[32]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[33]  Patrick Blackburn.  Nominal tense logic and other sorted intensional frameworks , 1990 .

[34]  M. Fitting.  Proof Methods for Modal and Intuitionistic Logics , 1983 .

[35]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[36]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[37]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

[38]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

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

[40]  Larisa Maksimova,et al.  Amalgamation and interpolation in normal modal logics , 1991, Stud Logica.

[41]  M. P. A. Sellink,et al.  Verifying Modal Formulas over I/O-Automata by means of Type Theory , 1995 .

[42]  M. de Rijke,et al.  Spatial Reasoning for Image Retrieval , 1999, Description Logics.

[43]  William A. Woods,et al.  What's in a Link: Foundations for Semantic Networks , 1975 .

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

[45]  Beata Konikowska,et al.  A Logic for Reasoning about Relative Similarity , 1997, Stud Logica.

[46]  W. W. Wadge,et al.  A Complete Natural Deduction System for the Relational Calculus , 1975 .

[47]  Leon Henkin.  Logical systems containing only a finite number of symbols , 1966 .

[48]  Werner Nutt,et al.  The Complexity of Existential Quantification in Concept Languages , 1992, Artif. Intell..

[49]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[50]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

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

[52]  Volker Haarslev,et al.  RACE System Description , 1999, Description Logics.

[53]  Johan van Benthem,et al.  Exploring logical dynamics , 1996, Studies in logic, language and information.

[54]  Frank Wolter,et al.  Satis ability problem in description logics with modal operators , 1998 .

[55]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[56]  Yde Venema.  A Modal Logic for Quantification and Substitution , 1994, Log. J. IGPL.

[57]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[58]  M. de Rijke,et al.  Expressiveness Revisited , 1998, Description Logics.

[59]  Patrick Blackburn,et al.  Hybrid languages , 1995, J. Log. Lang. Inf..

[60]  Yuri Gurevich.  The Decision Problem for Standard Classes , 1976, J. Symb. Log..

[61]  Frank Wolter,et al.  Multi-Dimensional Description Logics , 1999, IJCAI.

[62]  P. Blackburn.  Modal Logic and Attribute Value Structures , 1993 .

[63]  Clare Dixon,et al.  Clausal temporal resolution , 1999, TOCL.

[64]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[65]  M. A. Seaton,et al.  The Wordsworth concise English dictionary , 1994 .

[66]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

[67]  Bernhard Nebel,et al.  Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.

[68]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

[69]  Gerard R. Renardel de Lavalette.  Modularisation, Parametrisation, Interpolation , 1989, J. Inf. Process. Cybern..

[70]  William C. Rounds,et al.  Feature Logics , 1997, Handbook of Logic and Language.

[71]  Maarten de Rijke,et al.  Feature interaction as a satisfiability problem , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[72]  Maurizio Lenzerini,et al.  Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.

[73]  M. J. Marx.  Interpolation in (fibered) modal logic. , 1999 .

[74]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[75]  J. Donald Monk,et al.  Nonfinitizability of Classes of Representable Cylindric Algebras , 1969, J. Symb. Log..

[76]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..

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

[78]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[79]  Stéphane Demri,et al.  Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? , 1999, TABLEAUX.

[80]  Erich Grädel,et al.  Undecidability results on two-variable logics , 1997, Arch. Math. Log..

[81]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[82]  L. Maksimova.  Definability and interpolation in classical modal logics , 1992 .

[83]  Franz Baader,et al.  A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages , 1996, J. Log. Comput..

[84]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[85]  J.M.G.G. de Nivelle.  Ordering Refinements of Resolution , 1995 .

[86]  Werner Nutt,et al.  Tractable Concept Languages , 1991, IJCAI.

[87]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[88]  Umberto Straccia,et al.  A model of information retrieval based on a terminological logic , 1993, SIGIR.

[89]  Maarten de Rijke,et al.  Tree-based Heuristics in Modal Theorem Proving , 2000, ECAI.

[90]  Franz Baader,et al.  Terminological Cycles in KL-ONE-based Knowledge Representation Languages , 1990, AAAI.

[91]  Solomon Feferman,et al.  Persistent and invariant formulas for outer extensions , 1968 .

[92]  Ian Horrocks,et al.  An Analysis of Empirical Testing for Modal Decision Procedures , 2000, Log. J. IGPL.

[93]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[94]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[95]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[96]  Frank Wolter,et al.  Dynamic Description Logics , 1998, Advances in Modal Logic.

[97]  Valentin Goranko.  Temporal Logics with Reference Pointers and Computation Tree Logics , 2000, J. Appl. Non Class. Logics.

[98]  Luis Fariñas del Cerro.  A Simple Deduction Method for Modal Logic , 1982, Inf. Process. Lett..

[99]  Johan van Benthem,et al.  Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[100]  Jon Oberlander,et al.  Temporal representation and inference , 1989 .

[101]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[102]  L. L. Maksimova,et al.  Modal logics and varieties of modal algebras: The beth properties, interpolation, and amalgamation , 1992 .

[103]  Ullrich Hustadt.  Resolution based decision procedures for subclasses of first-order logic , 1999 .

[104]  Evert W. Beth,et al.  On Padoa’s Method in the Theory of Definition , 1953 .

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

[106]  J. Donald Monk.  Lectures on cylindric set algebras , 1993 .

[107]  Tinko Tinchev,et al.  Modal Environment for Boolean Speculations , 1987 .

[108]  Dov M. Gabbay,et al.  Extensions of Classical Logic , 1989 .

[109]  Alexander Borgida,et al.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..

[110]  Carsten Kindermann,et al.  Implementation of the BACK-System Version 4 , 1990 .

[111]  Yde Venema,et al.  Many-dimensional Modal Logic , 1991 .

[112]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

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

[114]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[115]  Ian Horrocks,et al.  Optimizing Description Logic Subsumption , 1999, J. Log. Comput..

[116]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[117]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[118]  Hector J. Levesque,et al.  An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of KRYPTON , 1985, IJCAI.

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

[120]  M. de Rijke,et al.  Expressiveness of Concept Expressions in First-Order Description Logics , 1999, Artif. Intell..

[121]  Frank J. Oles,et al.  A Non-Well-Founded Approach to Terminological Cycles , 1992, AAAI.

[122]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

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

[124]  Maarten Marx,et al.  Beth Definability for the Guarded Fragment , 1999, LPAR.

[125]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[126]  Valentin Goranko,et al.  Modal logic with names , 1993, J. Philos. Log..

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

[128]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[129]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[130]  Ronald J. Brachman,et al.  ON THE EPISTEMOLOGICAL STATUS OF SEMANTIC NETWORKS , 1979 .

[131]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[132]  J. Czelakowski.  Logical matrices and the amalgamation property , 1982 .

[133]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[134]  Patrice Enjalbert,et al.  Modal Resolution in Clausal Form , 1989, Theor. Comput. Sci..

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

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

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

[138]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[139]  M. de Rijke,et al.  The Modal Logic of Inequality , 1992, J. Symb. Log..

[140]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[141]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[142]  Maarten Marx,et al.  Failure of Interpolation in Combined Modal Logics , 1997, Notre Dame J. Formal Log..

[143]  Ronald J. Brachman,et al.  What's in a Concept: Structural Foundations for Semantic Networks , 1977, Int. J. Man Mach. Stud..

[144]  Premkumar Devanbu,et al.  The use of description logics in KBSE systems , 1994, Proceedings of 16th International Conference on Software Engineering.

[145]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

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

[147]  Frank Wolter,et al.  Modal Description Logics: Modalizing Roles , 1999, Fundam. Informaticae.

[148]  Rajeev Goré,et al.  Tableau Methods for Modal and Temporal Logics , 1999 .

[149]  Robert M. MacGregor,et al.  The Loom Knowledge Representation Language. , 1987 .

[150]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[151]  Tinko Tinchev,et al.  Quantifiers in combinatory PDL: completeness, definability, incompleteness , 1985, FCT.

[152]  Francesco M. Donini,et al.  Deduction in Concept Languages: From Subsumption to Instance Checking , 1994, J. Log. Comput..

[153]  Ian Horrocks,et al.  FaCT and iFaCT , 1999, Description Logics.

[154]  Grigori Mints.  Resolution calculi for modal logics , 1989 .

[155]  M. Kracht.  Tools and Techniques in Modal Logic , 1999 .

[156]  Miroslava Tzakova,et al.  Tableau Calculi for Hybrid Logics , 1999, TABLEAUX.

[157]  Deborah L. McGuinness,et al.  CLASSIC: a structural data model for objects , 1989, SIGMOD '89.

[158]  Carsten Lutz.  On the Complexity of Terminological Reasoning , 1999 .

[159]  Patrick Blackburn,et al.  Internalizing labelled deduction , 2000, J. Log. Comput..

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

[161]  Melvin Fitting,et al.  Destructive Modal Resolution , 1990, J. Log. Comput..

[162]  Valentin Goranko,et al.  Temporal Logic with Reference Pointers , 1994, ICTL.

[163]  George Gargov,et al.  Determinism and Looping in Combinatory PDL , 1988, Theor. Comput. Sci..

[164]  Yde Venema,et al.  Derivation rules as anti-axioms in modal logic , 1993, Journal of Symbolic Logic.

[165]  L F Goble,et al.  Grades of modality , 1970 .

[166]  Andrea Schaerf.  Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Seman , 1994 .

[167]  Martín Abadi,et al.  Nonclausal Temporal Deduction , 1985, Logic of Programs.

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

[169]  Ian Horrocks,et al.  Description Logics with Transitive Roles , 1997, Description Logics.

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

[171]  M. de Rijke,et al.  A Note on Graded Modal Logic , 1996, Stud Logica.

[172]  Maarten Marx,et al.  The Computational Complexity of Hybrid Temporal Logics , 2000, Log. J. IGPL.

[173]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..

[174]  Patrick Blackburn,et al.  Hybrid Languages and Temporal Logic , 1999, Log. J. IGPL.

[175]  M. de Rijke,et al.  Global definability in basic modal logic , 2001 .

[176]  J. Seligman.  A Cut-free Sequent Calculus for Elementary Situated Reasoning , 1991 .

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

[178]  M. H. van den Berg,et al.  Some aspects of the internal structure of discourse. The dynamics of nominal anaphora , 1996 .

[179]  L. Kalmár.  Zurückführung des Entscheidungsproblems auf den Fall von Formeln mit einer einzigen, binären, Funktionsvariablen , 1937 .

[180]  Wolfgang Rautenberg,et al.  Modal tableau calculi and interpolation , 1983, J. Philos. Log..