Paraconsistent logic programming
From MaRDI portal
Publication:1262746
DOI10.1016/0304-3975(89)90126-6zbMATH Open0686.68009OpenAlexW1980589711MaRDI QIDQ1262746FDOQ1262746
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
General topics in the theory of software (68N01) Artificial intelligence (68T99) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Four valued semantics and the Liar
- On the theory of inconsistent formal systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- A kripke-kleene semantics for logic programs*
- A semantical analysis of the calculi \(C_n\)
- Quantitative deduction and its fixpoint theory
- Title not available (Why is that?)
- Closures and fairness in the semantics of programming logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Canonical logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (44)
- Semi-equilibrium models for paracoherent answer set programs
- A theory of nonmonotonic inheritance based on annotated logic
- Legality concepts for three-valued logic programs
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- A paraconsistent relational data model
- Title not available (Why is that?)
- Automatic theorem proving in paraconsistent logics: Theory and implementation
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
- A theory of nonmonotonic rule systems I
- A non-ground realization of the stable and well-founded semantics
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
- Autoreferential semantics for many-valued modal logics
- Binary resolution over Boolean lattices
- Inconsistency-tolerant temporal reasoning with hierarchical information
- Finding explanations of inconsistency in multi-context systems
- A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency
- Quasi-classical reasoning in paraconsistent databases
- Completeness issues in RUE-NRF deduction: The undecidability of viability
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- Why Paraconsistent Logics?
- Relational Methods in Computer Science
- Title not available (Why is that?)
- A Survey of Annotated Logics
- Title not available (Why is that?)
- On logics and semantics for general logic programs
- Well-founded semantics and stratification for ordered logic programs
- An overview of transaction logic
- Any-world assumptions in logic programming
- Tabulation proof procedures for fuzzy linguistic logic programming
- Parma—bridging the performance gap between imperative and logic programming
- Modular Paracoherent Answer Sets
- Annotated fuzzy logic programs
- Facts, arguments, annotations and reasoning
- Paraconsistent disjunctive deductive databases
- Paraconsistent intelligent systems of computer logics
- On Theorem Proving in Annotated Logics
- A logic for reasoning with inconsistency
- Abduction over 3-valued extended logic programs
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- Jair Minoro Abe on Paraconsistent Engineering
- Programming with Annotated Logics
- Paraconsistency and word puzzles
- Policy-based inconsistency management in relational databases
- Iterative belief revision in extended logic programming
This page was built for publication: Paraconsistent logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262746)
