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

DOI10.3166/jancl.21.211-232zbMath1242.68091arXiv1011.5105OpenAlexW1872397016MaRDI QIDQ2901212

Andrzej Szałas, Jan Małuszyński

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

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

Related Items (4)

Rule-Based Reasoning with Belief Structures ⋮ Multi-valued Verification of Strategic Ability ⋮ On recent applications of paraconsistent logic: an exploratory literature review ⋮ A paraconsistent approach to actions in informationally complex environments

Cites Work

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

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