CARIN: A Representation Language Combining Horn Rules and Description Logics

We describe CARIN, a novel family of representation languages, which integrate the expressive power of Horn rules and of description logics. We address the key issue in designing such a language, namely, providing a sound and complete inference procedure. We identify existential entailment as a core problem in reasoning in CARIN, and describe an existential entailment algorithm for CARIN languages whose description logic component is ALCNR. This algorithm entails several important results for reasoning in CARIN, most notably: (1) a sound and complete inference procedure for non recursive CARIN-ALCNR, and (2) an algorithm for determining rule subsumption overALCNR.

[1]  Andreas Podelski,et al.  Towards a Meaning of LIFE , 1991, PLILP.

[2]  Maurizio Lenzerini,et al.  Datalog and Description Logics: Expressive Power , 1997, APPIA-GULP-PRODE.

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

[4]  Christof Peltason The BACK system—an overview , 1991, SGAR.

[5]  Margarida Mamede,et al.  A Contraint Logic Programming Scheme for Taxonomic Reasoning , 1992, JICSLP.

[6]  Wolfgang Wahlster,et al.  Plan-Based Integration of Natural Language and Graphics Generation , 1993, Artif. Intell..

[7]  Andreas Abecker,et al.  A Layer Architecture for the Integration of Rules, Inheritance, and Constraints , 1994, ICLP Workshop: Integration of Declarative Paradigms.

[8]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

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

[10]  Robert M. MacGregor,et al.  A Deductive Pattern Matcher , 1988, AAAI.

[11]  Yehoshua Sagiv,et al.  Semantic query optimization in Datalog programs (extended abstract) , 1995, ILPS Workshop: Constraints and Databases.

[12]  Gert Smolka,et al.  Feature-Constraint Logics for Unification Grammars , 1989, J. Log. Program..

[13]  Alon Y. Halevy,et al.  The Limits on Combining Recursive Horn Rules with Description Logics , 1996, AAAI/IAAI, Vol. 1.

[14]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

[15]  Hans-Jürgen Bürckert,et al.  A Resolution Principle for Constrained Logics , 1994, Artif. Intell..

[16]  Catriel Beeri,et al.  Rewriting queries using views in description logics , 1997, PODS '97.

[17]  Knut Hinkelmann,et al.  Combining Terminological and Rule-based Reasoning for Abstraction Processes , 1992, GWAI.

[18]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

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

[20]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

[21]  Maurizio Lenzerini,et al.  Representing and Using Interschema Knowledge in Cooperative Information Systems , 1993, Int. J. Cooperative Inf. Syst..

[22]  Franz Baader,et al.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991, PDK.

[23]  Alexander Borgida,et al.  On the relationship between description logic and predicate logic queries , 1994, CIKM '94.

[24]  John Yen,et al.  A Principled Approach to Reasoning About the Specificity ofRules , 1990, AAAI.

[25]  Yuri Gurevich,et al.  The inference problem for template dependencies , 1982, Inf. Control..

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

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

[28]  Francesco M. Donini,et al.  A Hybrid System with Datalog and Concept Languages , 1991, AI*IA.

[29]  Robert M. MacGregor,et al.  A Description Classifier for the Predicate Calculus , 1994, AAAI.

[30]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

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

[32]  Moshe Y. Vardi The implication and finite implication problems for typed template dependencies , 1982, PODS '82.

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

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

[35]  Brian Falkenhainer,et al.  Compositional Modeling: Finding the Right Model for the Job , 1991, Artif. Intell..

[36]  Joann J. Ordille,et al.  Query-Answering Algorithms for Information Agents , 1996, AAAI/IAAI, Vol. 1.

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