Paraconsistent declarative semantics for extended logic programs

DOI10.1023/A:1016358201013zbMath1015.68121MaRDI QIDQ1610490

Ofer Arieli

Publication date: 20 August 2002

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

paraconsistencylogic programmingfixpoint semanticsmulti-valuedlogics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (10)

Logical foundations and complexity of 4QL, a query language with unrestricted negation ⋮ Quasi-classical reasoning in paraconsistent databases ⋮ Truth versus information in logic programming ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ A paraconsistent logic programming approach for querying inconsistent databases ⋮ An encompassing framework for paraconsistent logic programs ⋮ Galois connections for bilattices ⋮ Reasoning with different levels of uncertainty ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Any-world assumptions in logic programming

This page was built for publication: Paraconsistent declarative semantics for extended logic programs