Paraconsistent logic programming

From MaRDI portal
Publication:1262746

DOI10.1016/0304-3975(89)90126-6zbMath0686.68009OpenAlexW1980589711MaRDI QIDQ1262746

Howard A. Blair, V. S. Subrahmanian

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90126-6



Related Items

An overview of transaction logic, A theory of nonmonotonic rule systems I, Binary resolution over Boolean lattices, Quasi-classical reasoning in paraconsistent databases, A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency, Modular Paracoherent Answer Sets, A paraconsistent relational data model, Abduction over 3-valued extended logic programs, Paraconsistency and word puzzles, Tabulation proof procedures for fuzzy linguistic logic programming, Unnamed Item, Finding explanations of inconsistency in multi-context systems, Paraconsistent disjunctive deductive databases, A non-ground realization of the stable and well-founded semantics, Iterative belief revision in extended logic programming, Inconsistency-tolerant temporal reasoning with hierarchical information, A theory of nonmonotonic inheritance based on annotated logic, A logic for reasoning with inconsistency, Legality concepts for three-valued logic programs, Facts, arguments, annotations and reasoning, \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\), \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\), On Theorem Proving in Annotated Logics, Why Paraconsistent Logics?, A Survey of Annotated Logics, Programming with Annotated Logics, Jair Minoro Abe on Paraconsistent Engineering, Proof theory of Nelson's paraconsistent logic: a uniform perspective, Autoreferential semantics for many-valued modal logics, Annotated fuzzy logic programs, Any-world assumptions in logic programming, Learning any memory-less discrete semantics for dynamical systems represented by logic programs, Interpreting disjunctive logic programs based on a strong sense of disjunction, Completeness issues in RUE-NRF deduction: The undecidability of viability, Well-founded semantics and stratification for ordered logic programs, Semi-equilibrium models for paracoherent answer set programs, Policy-based inconsistency management in relational databases



Cites Work