Bilattices and the semantics of logic programming
From MaRDI portal
Publication:3983121
DOI10.1016/0743-1066(91)90014-GzbMATH Open0757.68028MaRDI QIDQ3983121FDOQ3983121
Authors: Melvin Fitting
Publication date: 27 June 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4057054
- A logical foundation for logic programming II: Semantics of general logic programs
- Truth versus information in logic programming
- A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
- scientific article; zbMATH DE number 4180779
- The value of the four values
- Effective semantics for the modal logics K and KT via non-deterministic matrices
- Belnap's Four-Valued Logic and De Morgan Lattices
- scientific article; zbMATH DE number 590999
- scientific article; zbMATH DE number 26616
Many-valued logic (03B50) Logic programming (68N17) Semantics in the theory of computing (68Q55) Logical aspects of lattices and related structures (03G10)
Cited In (only showing first 100 items - show all)
- Bilattices for deductions in multi-valued logic
- A theory of nonmonotonic inheritance based on annotated logic
- Bi-inductive structural semantics
- A family of strict/tolerant logics
- Multi-valued logic programming semantics An algebraic approach
- A BILATTICE-BASED FRAMEWORK FOR HANDLING GRADED TRUTH AND IMPRECISION
- On partial and paraconsistent logics
- Fixpoints for general correctness
- Some useful 16-valued logics: How a computer network should think
- Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond
- Title not available (Why is that?)
- \(\mho\)-resolution and hybrid knowledge bases
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Fuzzy logic programming and fuzzy control
- Four-valued paradefinite logics
- Note on a six-valued extension of three-valued logic
- Ordering default theories and nonmonotonic logic programs
- Annotated revision specification programs
- An abstract algebraic logic approach to tetravalent modal logics
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation
- On all strong Kleene generalizations of classical logic
- A non-deterministic view on non-classical negations
- Identity and aboutness
- Gradual trust and distrust in recommender systems
- Bipolarity in bilattice logics
- Combining explicit negation and negation by failure via Belnap's logic
- A core language for fuzzy answer set programming
- Nelson's negation on the base of weaker versions of intuitionistic negation
- Preferences in artificial intelligence
- Aggregated fuzzy answer set programming
- The logic of generalized truth values and the logic of bilattices
- A new approach to hybrid probabilistic logic programs
- Ideal paraconsistent logics
- Bilattices and hyperidentities
- The value of the four values
- Borderline vs. unknown: comparing three-valued representations of imperfect information
- Any-world assumptions in logic programming
- Partial and paraconsistent three-valued logics
- The strict/tolerant idea and bilattices
- Probabilistic logic programming
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- Title not available (Why is that?)
- A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\)
- Completeness and cut-elimination theorems for trilattice logics
- Reasoning with logical bilattices
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- The structure of interlaced bilattices
- Fuzzy logic programming via multilattices
- Gentzen-type methods for bilattice negation
- A note on the structure of bilattices
- Belief functions on distributive lattices
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- A logic for reasoning with inconsistency
- A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
- Parametrized semantics of logic programs -- a unifying framework
- Title not available (Why is that?)
- Weakly idempotent lattices and bilattices, non-idempotent Plonka functions.
- Fixpoint semantics for logic programming a survey
- A Hofmann-Mislove theorem for bitopological spaces
- Bilattices and the theory of truth
- Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness
- Answering queries from context-sensitive probabilistic knowledge bases
- Policy-based inconsistency management in relational databases
- Elements of intuitionistic fuzzy logic. I
- Quantitative Logic Programming Revisited
- Reasoning about ignorance and contradiction: many-valued logics versus epistemic logic
- Bilattice logic of epistemic actions and knowledge
- Logical foundations of evidential reasoning with contradictory information
- Title not available (Why is that?)
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- What is in a step: new perspectives on a classical question
- Possibilistic nested logic programs and strong equivalence
- A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information
- A new kind of implication to reason with unknown information
- Autoreferential semantics for many-valued modal logics
- Title not available (Why is that?)
- An epistemic interpretation of paraconsistent weak Kleene logic
- Title not available (Why is that?)
- Programming with annotated logics
- Stone-type representations and dualities for varieties of bisemilattices
- On correctness of normal logic programs
- First-order theories for pure Prolog programs with negation
- Truth versus information in logic programming
- Measuring inaccuracy of uncertain doxastic states in many-valued logical systems
- On the provable contradictions of the connexive logics \(\mathbf{C}\) and \(\mathbf{C3}\)
- Galois connections for bilattices
- Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
- An encompassing framework for paraconsistent logic programs
- Beyond multi-adjoint logic programming
- Negation on the Australian plan
- Valuations: bi, tri, and tetra
- Sound and complete SLD-resolution for bilattice-based annotated logic programs
- Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic
- From fuzzy to annotated semantic web languages
- Facts, arguments, annotations and reasoning
- Paraconsistent disjunctive deductive databases
This page was built for publication: Bilattices and the semantics of logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983121)