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:
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
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:
Article in journal (Refereed)
Language:
English
Place of publ.: Cachan, France Publisher: Lavoisier
Status:
Published
In:
Journal of Applied Non-Classical Logics(ISSN 1166-3081)
Volume:
21
Issue:
2
Pages:
211-232
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-72692
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72692
Subject category:
Computer Science
Keywords(en) :
query language, data complexity, paraconsistent semantics, DATALOG
Abstract(en) :

The paper discusses properties of 4QL, a DATALOG¬¬-like query language, originally outlined by Małuszy´nski and Szałas (Małuszy´nski & Szałas, 2011). 4QL allows one to use rules with negation in heads and bodies of rules. It is based on a simple and intuitive semantics and provides uniform tools for “lightweight” versions of known forms of nonmonotonic reasoning. Negated literals in heads of rules may naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to some literals. Therefore 4QL is founded on a four-valued semantics, employing the logic introduced in (Małuszy´nski et al., 2008; Vitória et al., 2009) with truth values: ‘true’, ‘false’, ‘inconsistent’ and ‘unknown’. In addition, 4QL is tractable w.r.t. data complexity and captures PTIME queries. Even though DATALOG¬¬ is known as a concept for the last 30 years, to our best knowledge no existing approach enjoys these properties. In the current paper we:

  • investigate properties of well-supported models of 4QL
  • prove the correctness of the algorithm for computing well-supported models
  • show that 4QL has PTIME data complexity and captures PTIME.
Available from:
2011-12-05
Created:
2011-12-05
Last updated:
2011-12-12
Statistics:
16 hits