A Sequent Calculus for Reasoning in Four-Valued Description Logics

Description Logics (DLs, for short) provide a logical reconstruction of the so-called frame-based knowledge representation languages. Originally, four-valued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, four-valued DLs have been proposed as a model for (multimedia) document retrieval. In this context, the main reasoning task is instance checking. Unfortunately, the known subsumption algorithms for four-valued DLs, based on “structural” subsumption, do not work with respect to the semantics proposed in the DL-based approach to document retrieval. Moreover, they are unsuitable for solving the instance checking problem, as this latter problem is more general than the subsumption problem. We present an alternative decision procedure for four-valued DLs with the aim to solve these problems. The decision procedure is a sequent calculus for instance checking. Since in general the four-valued subsumption problem can be reduced to the four-valued instance checking problem, we obtain a decision procedure for the subsumption problem. Some related complexity results will be presented.

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

[2]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[3]  J. M. Dunn,et al.  Modern Uses of Multiple-Valued Logic , 1977 .

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

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

[6]  Peter F. Patel-Schneider,et al.  A Four-Valued Semantics for Terminological Logics , 1989, Artif. Intell..

[7]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[8]  Werner Nutt,et al.  Subsumption between queries to object-oriented databases , 1994, Inf. Syst..

[9]  Hector J. Levesque,et al.  Expressiveness and tractability in knowledge representation and reasoning 1 , 1987, Comput. Intell..

[10]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[11]  Andrea Schaerf.  Reasoning with Individuals in Concept Languages , 1993, AI*IA.

[12]  Umberto Straccia,et al.  A Computationally Tractable Terminological Logic , 1991, SCAI.

[13]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[14]  Peter F. Patel-Schneider,et al.  A Four-Valued Semantics for Frame-Based Description Languages , 1986, AAAI.

[15]  Maurizio Lenzerini,et al.  Concept Languages as Query Languages , 1991, AAAI.

[16]  Alexander Borgida.  Structural Subsumption: What Is It and Why Is It Important? , 1992, Description Logics.

[17]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[18]  Umberto Straccia,et al.  A relevance terminological logic for information retrieval , 1996, SIGIR '96.

[19]  Umberto Straccia,et al.  Extending a Description Logic to Cope with the Completeness of Multimedia Documents , 1996 .

[20]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Bernhard Hollunder,et al.  Subsumption Algorithms for Concept Description Languages , 1990, ECAI.

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

[24]  Hector J. Levesque,et al.  A Logic of Implicit and Explicit Belief , 1984, AAAI.

[25]  Carole A. Goble,et al.  Describing and classifying multimedia using the description logic GRAIL , 1996, Electronic Imaging.

[26]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[27]  Gerd Wagner.  Ex contradictione nihil sequitur , 1991, IJCAI.

[28]  Fabrizio Sebastiani,et al.  A probabilistic terminological logic for modelling information retrieval , 1994, SIGIR '94.

[29]  PETER F. PATEL-SCHNEIDER,et al.  A hybrid, decidable, logic‐based knowledge representation system 1 , 1987, Comput. Intell..