Paraconsistent declarative semantics for extended logic programs
From MaRDI portal
Recommendations
Cited in
(22)- Quasi-classical reasoning in paraconsistent databases
- An encompassing framework for paraconsistent logic programs
- A logic programming system for nonmonotonic reasoning
- Galois connections for bilattices
- A paraconsistent logic programming approach for querying inconsistent databases
- Any-world assumptions in logic programming
- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- Truth versus information in logic programming
- Dependency semantics for sequences of extended logic programs
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
- Reasoning with different levels of uncertainty
- Extended semantics and inference for the Independent Choice Logic
- scientific article; zbMATH DE number 4026795 (Why is no real title available?)
- scientific article; zbMATH DE number 4128792 (Why is no real title available?)
- scientific article; zbMATH DE number 1269580 (Why is no real title available?)
- scientific article; zbMATH DE number 517010 (Why is no real title available?)
- scientific article; zbMATH DE number 554480 (Why is no real title available?)
- Paraconsistent logic programs
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Reliable Semantics for Extended Logic Programs with Rule Prioritization
- scientific article; zbMATH DE number 970716 (Why is no real title available?)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
This page was built for publication: Paraconsistent declarative semantics for extended logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610490)