Bilattices and the semantics of logic programming
From MaRDI portal
Publication:3983121
DOI10.1016/0743-1066(91)90014-GzbMath0757.68028MaRDI QIDQ3983121
Publication date: 27 June 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Logical aspects of lattices and related structures (03G10) Semantics in the theory of computing (68Q55) Logic programming (68N17) Many-valued logic (03B50)
Related Items
On the provable contradictions of the connexive logics \(\mathbf{C}\) and \(\mathbf{C3}\) ⋮ On correctness of normal logic programs ⋮ A family of strict/tolerant logics ⋮ A BILATTICE-BASED FRAMEWORK FOR HANDLING GRADED TRUTH AND IMPRECISION ⋮ Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ On all strong Kleene generalizations of classical logic ⋮ Beyond multi-adjoint logic programming ⋮ First-order theories for pure Prolog programs with negation ⋮ Measuring inaccuracy of uncertain doxastic states in many-valued logical systems ⋮ Preferences in artificial intelligence ⋮ A new approach to hybrid probabilistic logic programs ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Reasoning about ignorance and contradiction: many-valued logics versus epistemic logic ⋮ Note on a six-valued extension of three-valued logic ⋮ Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation ⋮ Truth versus information in logic programming ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Fuzzy logic programming via multilattices ⋮ Bilattices and the theory of truth ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ Four-valued paradefinite logics ⋮ Interpolation methods for Dunn logics and their extensions ⋮ Annotated revision specification programs ⋮ Weakly idempotent lattices and bilattices, non-idempotent Plonka functions. ⋮ The normal and self-extensional extension of Dunn-Belnap logic ⋮ A note on the structure of bilattices ⋮ On the relationship between annotated logic programs and nonmonotonic formalisms ⋮ \(q\)-bilattices ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Completeness and cut-elimination theorems for trilattice logics ⋮ A core language for fuzzy answer set programming ⋮ Ideal paraconsistent logics ⋮ Bipolarity in bilattice logics ⋮ Borderline vs. unknown: comparing three-valued representations of imperfect information ⋮ Partial and paraconsistent three-valued logics ⋮ Unnamed Item ⋮ Reducing fuzzy answer set programming to model finding in fuzzy logics ⋮ Belief functions on distributive lattices ⋮ Paraconsistent disjunctive deductive databases ⋮ Logical Foundations of Evidential Reasoning with Contradictory Information ⋮ Bilattice Logics and Demi-Negation ⋮ Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Multi-valued logic programming semantics An algebraic approach ⋮ Answering queries from context-sensitive probabilistic knowledge bases ⋮ A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices ⋮ Stone-type representations and dualities for varieties of bisemilattices ⋮ Bitopology and four-valued logic ⋮ Bilattice logic of epistemic actions and knowledge ⋮ A theory of nonmonotonic inheritance based on annotated logic ⋮ A logic for reasoning with inconsistency ⋮ Unnamed Item ⋮ A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information ⋮ Facts, arguments, annotations and reasoning ⋮ Probabilistic logic programming ⋮ On partial and paraconsistent logics ⋮ Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness ⋮ Fixpoints for general correctness ⋮ What Is in a Step: New Perspectives on a Classical Question ⋮ Ordering default theories and nonmonotonic logic programs ⋮ An encompassing framework for paraconsistent logic programs ⋮ \(\mho\)-resolution and hybrid knowledge bases ⋮ Fuzzy logic programming and fuzzy control ⋮ Valuations: bi, tri, and tetra ⋮ Bilattices and hyperidentities ⋮ Galois connections for bilattices ⋮ Quantitative Logic Programming Revisited ⋮ Negation on the Australian plan ⋮ Why Paraconsistent Logics? ⋮ Programming with Annotated Logics ⋮ An Epistemic Interpretation of Paraconsistent Weak Kleene Logic ⋮ Identity and aboutness ⋮ The structure of interlaced bilattices ⋮ The value of the four values ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Autoreferential semantics for many-valued modal logics ⋮ Aggregated fuzzy answer set programming ⋮ A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) ⋮ Gradual trust and distrust in recommender systems ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Elements of intuitionistic fuzzy logic. I ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Any-world assumptions in logic programming ⋮ Learning any memory-less discrete semantics for dynamical systems represented by logic programs ⋮ Possibilistic nested logic programs and strong equivalence ⋮ A semantical framework for supporting subjective and conditional probabilities in deductive databases ⋮ A Hofmann-Mislove theorem for Bitopological Spaces ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ The Strict/Tolerant Idea and Bilattices ⋮ An abstract algebraic logic approach to tetravalent modal logics ⋮ The logic of generalized truth values and the logic of bilattices ⋮ Fixpoint semantics for logic programming a survey ⋮ A non-deterministic view on non-classical negations ⋮ Gentzen-type methods for bilattice negation ⋮ Nelson's negation on the base of weaker versions of intuitionistic negation ⋮ Bilattices for deductions in multi-valued logic ⋮ Policy-based inconsistency management in relational databases ⋮ Some useful 16-valued logics: How a computer network should think ⋮ A new kind of implication to reason with unknown information
This page was built for publication: Bilattices and the semantics of logic programming
