ALCPu: an integration of description logic and general rules

  • Authors:
  • Jing Mei;Zuoquan Lin;Harold Boley

  • Affiliations:
  • Department of Information Science, Peking University, Beijing, China;Department of Information Science, Peking University, Beijing, China;Institute for Information Technology - e-Business, National Research Council of Canada, Fredericton, NB, Canada

  • Venue:
  • RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A unifying logic is built on top of ontologies and rules for the revised Semantic Web Architecture. This paper proposes ALCpu, which integrates a description logic (DL) that makes a unique names assumption with general rules that have the form of Datalog Programs permitting default negation in the body. An ALCpu knowledge base (KB) consists of a TBox T of subsumptions, an ABox A of assertions, and a novel PBox P of general rules that share predicates with DL concepts and DL roles. To model open answer set semantics, extended Herbrand structures are used for interpreting DL concepts and DL roles, while open answer sets hold for general rules. To retain decidability, a well-known weak safeness condition is employed. We develop DL tableaux-based algorithms for decision procedures of the KB satisfiability and the query entailment problems.