{\cal A}{\cal L}-log: Integrating Datalog and Description Logics

  • Authors:

  • Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Andrea Schaerf

  • Affiliations:

  • Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” Via Salaria 113, I-00198, Roma, Italy. E-mail: donini@dis.uniroma1.it, lenzerini@dis.uniroma1.it, ...;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” Via Salaria 113, I-00198, Roma, Italy. E-mail: donini@dis.uniroma1.it, lenzerini@dis.uniroma1.it, ...;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” Via Salaria 113, I-00198, Roma, Italy. E-mail: donini@dis.uniroma1.it, lenzerini@dis.uniroma1.it, ...;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” Via Salaria 113, I-00198, Roma, Italy. E-mail: donini@dis.uniroma1.it, lenzerini@dis.uniroma1.it, ...

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an integrated system for knowledge representation, called{\cal A}{\cal L}-log, based on description logics and thedeductive database language Datalog. {\cal A}{\cal L}-logembodies two subsystems, called structural and relational. The former allowsfor the definition of structural knowledge about classes of interest(concepts) and membership relation between objects and classes. The latterallows for the definition of relational knowledge about objects described inthe structural component. The interaction between the two components isobtained by allowing constraints within Datalog clauses, thus requiring thevariables in the clauses to range over the set of instances of a specifiedconcept. We propose a method for query answering in {\cal A}{\calL}-log based on constrained resolution, where the usual deductionprocedure defined for Datalog is integrated with a method for reasoning onthe structural knowledge.