By Topic

Enhancing Disjunctive Datalog by constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Buccafurri, F. ; DIMET Dept., Calabria Univ., Italy ; Leone, N. ; Rullo, P.

This paper presents an extension of Disjunctive Datalog (DATALOG V,~) by integrity constraints. These are of two types: strong, that is, classical integrity constraints and weak, that is, constraints that are satisfied if possible. While strong constraints must be satisfied, weak constraints express desiderata, that is, they may be violated-actually, their semantics tends to minimize the number of violated instances of weak constraints. Weak constraints may be ordered according to their importance to express different priority levels. As a result, the proposed language (call it, DATALOGV,~,c ) is well-suited to represent common sense reasoning and knowledge-based problems arising in different areas of computer science such as planning, graph theory optimizations, and abductive reasoning. The formal definition of the language is first given. The declarative semantics of DATALOGV,~,c is defined in a general way that allows us to put constraints on top of any existing (model-theoretic) semantics for DATALOGV,~ programs. Knowledge representation issues are then addressed and the complexity of reasoning on DATALOGV,~,c programs is carefully determined. An in-depth discussion on complexity and expressiveness of DATALOGV,~,c is finally reported. The discussion contrasts DATALOGV,~,c to DATALOGV,~ and highlights the significant increase in knowledge modeling ability carried out by constraints

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:12 ,  Issue: 5 )