LiU Electronic Press
Full-text not available in DiVA
Author:
Maluszynski, Jan (Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory) (Linköping University, The Institute of Technology)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Living with Inconsistency and Taming Nonmonotonicity
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Datalog Reloaded
Editor:
O. de Moor, G. Gottlob, T. Furche, A. Sellers
Conference:
Datalog 2.0
Publisher: Springer Berlin/Heidelberg
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 6702
Pages:
334-398
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-72702
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72702
ISBN:
978-3-642-24205-2
Subject category:
Computer Science
Abstract(en) :

In this paper we consider rule-based query languages with negation inbodies and heads of rules, traditionally denoted by DATALOG--. Tractable andat the same time intuitive semantics for DATALOG-- has not been provided evenif the area of deductive databases is over 30 years old. In this paper we identifysources of the problem and propose a query language, which we call 4QL.The 4QL language supports a modular and layered architecture and providesa tractable framework for many forms of rule-based reasoning both monotonicand nonmonotonic. As the underpinning principle we assume openness of theworld, which may lead to the lack of knowledge. Negation in rule heads may leadto inconsistencies. To reduce the unknown/inconsistent zones we introduce simpleconstructs which provide means for application-specific disambiguation ofinconsistent information, the use of Local Closed World Assumption (thus alsoClosed World Assumption, if needed), as well as various forms of default anddefeasible reasoning.

Available from:
2011-12-05
Created:
2011-12-05
Last updated:
2012-02-13
Statistics:
31 hits