Pages that link to "Item:Q3983121"

The following pages link to Bilattices and the semantics of logic programming (Q3983121):

Displaying 50 items.

• On all strong Kleene generalizations of classical logic (Q295922) (← links)
• Preferences in artificial intelligence (Q314443) (← links)
• A core language for fuzzy answer set programming (Q448947) (← links)
• Borderline vs. unknown: comparing three-valued representations of imperfect information (Q465586) (← links)
• Belief functions on distributive lattices (Q490415) (← links)
• A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices (Q503219) (← links)
• Fixpoints for general correctness (Q549677) (← links)
• Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
• Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
• Completeness and cut-elimination theorems for trilattice logics (Q639681) (← links)
• Ideal paraconsistent logics (Q647409) (← links)
• Combining explicit negation and negation by failure via Belnap's logic (Q673380) (← links)
• Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
• Answering queries from context-sensitive probabilistic knowledge bases (Q673387) (← links)
• A theory of nonmonotonic inheritance based on annotated logic (Q685338) (← links)
• A logic for reasoning with inconsistency (Q688558) (← links)
• On partial and paraconsistent logics (Q701297) (← links)
• Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
• Aggregated fuzzy answer set programming (Q766043) (← links)
• A non-deterministic view on non-classical negations (Q813081) (← links)
• Gentzen-type methods for bilattice negation (Q813084) (← links)
• Nelson's negation on the base of weaker versions of intuitionistic negation (Q813089) (← links)
• Some useful 16-valued logics: How a computer network should think (Q815018) (← links)
• A family of strict/tolerant logics (Q830368) (← links)
• Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation (Q865046) (← links)
• Fuzzy logic programming via multilattices (Q876496) (← links)
• Weakly idempotent lattices and bilattices, non-idempotent Plonka functions. (Q895871) (← links)
• Bi-inductive structural semantics (Q1012127) (← links)
• A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) (Q1037603) (← links)
• Gradual trust and distrust in recommender systems (Q1037950) (← links)
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
• Bilattices and the theory of truth (Q1123891) (← links)
• Paraconsistent disjunctive deductive databases (Q1185011) (← links)
• Probabilistic logic programming (Q1207942) (← links)
• The value of the four values (Q1274293) (← links)
• Elements of intuitionistic fuzzy logic. I (Q1292063) (← links)
• A semantical framework for supporting subjective and conditional probabilities in deductive databases (Q1311410) (← links)
• Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic (Q1337604) (← links)
• Fixpoint semantics for logic programming a survey (Q1605173) (← links)
• Four-valued paradefinite logics (Q1685565) (← links)
• Interpolation methods for Dunn logics and their extensions (Q1685574) (← links)
• Stone-type representations and dualities for varieties of bisemilattices (Q1744009) (← links)
• Bitopology and four-valued logic (Q1744388) (← links)
• An encompassing framework for paraconsistent logic programs (Q1775864) (← links)
• Fuzzy logic programming and fuzzy control (Q1780897) (← links)
• Parametrized semantics of logic programs -- a unifying framework (Q1884892) (← links)
• First-order theories for pure Prolog programs with negation (Q1892097) (← links)
• Reasoning with logical bilattices (Q1919988) (← links)
• \(q\)-bilattices (Q1948519) (← links)
• Bilattice logic of epistemic actions and knowledge (Q1987215) (← links)