Logical foundations and complexity of 4QL, a query language with unrestricted negation

DOI10.3166/JANCL.21.211-232MaRDI QIDQ2901212zbMATH OpenOpenAlexFDO

Authors Jan Maluszyński, Andrzej Szałas

Publication date 17 July 2012

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.5105

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53) Database theory (68P15)

Abstract: The paper discusses properties of a DATALOG${}^{egeg}$-like query language 4QL, originally outlined in [MS10]. Negated literals in heads of rules 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 [MSV08, VMS09] with truth values: 'true', 'false', 'inconsistent' and 'unknown'. 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. In addition, 4QL is tractable as regards its data complexity and captures PTIME queries. Even if DATALOG${}^{egeg}$ 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.

Recommendations

• How an agent might think
• Query languages for data exchange: beyond unions of conjunctive queries
• Why not negation by fixpoint?
• Complexity of the Stable Model Semantics for Queries on Incomplete Databases
• Functional queries in datalog

Cites work

• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• A kripke-kleene semantics for logic programs*
• A paraconsistent logic programming approach for querying inconsistent databases
• An encompassing framework for paraconsistent logic programs
• Approximate databases: a support tool for approximate reasoning
• Fixpoint semantics for logic programming a survey
• Formal inconsistency and evolutionary databases
• Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
• Knowledge representation techniques. A rough set approach.
• On Ignorance and Contradiction Considered as Truth-Values
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Paraconsistent declarative semantics for extended logic programs

Cited in

(6)

• On recent applications of paraconsistent logic: an exploratory literature review
• A paraconsistent approach to actions in informationally complex environments
• How an agent might think
• Query languages for data exchange: beyond unions of conjunctive queries
• Multi-valued verification of strategic ability
• Rule-based reasoning with belief structures

This page was built for publication: Logical foundations and complexity of 4QL, a query language with unrestricted negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901212)