liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
2011 (English)In: Journal of Applied Non-Classical Logics, ISSN 1166-3081, Vol. 21, no 2, 211-232 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Cachan, France: Lavoisier , 2011. Vol. 21, no 2, 211-232 p.
Keyword [en]
query language, data complexity, paraconsistent semantics, DATALOG
National Category
Computer Science
URN: urn:nbn:se:liu:diva-72692DOI: 10.3166/JANCL.21.211-232OAI: diva2:461544
Available from: 2011-12-05 Created: 2011-12-05 Last updated: 2014-10-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Maluszynski, JanSzalas, Andrzej
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of TechnologyKPLAB - Knowledge Processing Lab
In the same journal
Journal of Applied Non-Classical Logics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 108 hits
ReferencesLink to record
Permanent link

Direct link