Maluszynski, Jan Szalas, Andrzej 2011 (English)In: Datalog Reloaded / [ed] O. de Moor, G. Gottlob, T. Furche, A. Sellers, Springer Berlin/Heidelberg, 2011, 334-398Conference paper (Refereed)
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.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6702
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-72702 (URN)10.1007/978-3-642-24206-9_22 (DOI)978-3-642-24205-2 (ISBN)oai:DiVA.org:liu-72702 (OAI)diva2:461581 (DiVA)