scientific article; zbMATH DE number 3648682
From MaRDI portal
Publication:3206928
Cited in
(only showing first 100 items - show all)- Dialogue games for many-valued logics -- an overview
- A four-valued semantics for terminological logics
- A resolution framework for finitely-valued first-order logics
- Resolution approximation of first-order logics
- Paraconsistent logic programming
- Limited reasoning in first-order knowledge bases
- A logical semantics for depth-first Prolog with ground negation
- Fuzzy types: A framework for handling uncertainty about types of objects
- Fixpoint semantics for logic programming a survey
- Pecularities of some three- and four-valued second order logics
- The strong version of a sentential logic
- Four-valued paradefinite logics
- Rivals to Belnap-Dunn logic on interlaced trilattices
- Paraconsistent logic, evidence, and justification
- Paraconsistent double negations as classical and intuitionistic negations
- Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant
- Disentangling \textsf{FDE}-based paraconsistent modal logics
- Cut elimination, identity elimination, and interpolation in super-Belnap logics
- First-degree entailment and its relatives
- Interpolation methods for Dunn logics and their extensions
- Impossible worlds and the logic of imagination
- Provably true sentences across axiomatizations of Kripke's theory of truth
- The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\)
- Interpolation in 16-valued trilattice logics
- Stone-type representations and dualities for varieties of bisemilattices
- Bitopology and four-valued logic
- Implicit, explicit and speculative knowledge
- Aggregation on Boolean multi-polar space: knowledge-based vs. category-based ordering
- An encompassing framework for paraconsistent logic programs
- Double-faced rough sets and rough communication
- Parametrized semantics of logic programs -- a unifying framework
- On transitivity of strict preference relations
- A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information
- Strengthening Brady's paraconsistent 4-valued logic BN4 with truth-functional modal operators
- A hierarchy of weak double negations
- Bi-facial truth: a case for generalized truth values
- A general framework for FDE-based modal logics
- Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic
- Propositional and predicate logics of incomplete information
- Containment logics: algebraic completeness and axiomatization
- Embedding friendly first-order paradefinite and connexive logics
- Subminimal negation on the Australian plan
- Valuation semantics for first-order logics of evidence and truth
- An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi
- First-order logics of evidence and truth with constant and variable domains
- Modal bilattice logic and its extensions
- An algebraic theory for data linkage
- Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic
- The normal and self-extensional extension of Dunn-Belnap logic
- Classifying material implications over minimal logic
- The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3
- Free choice reasons
- A four-valued dynamic epistemic logic
- Revisiting four-valued logics from \textit{Maple} using the \textit{Logics Explorer} package
- Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation
- Defining rough sets as core-support pairs of three-valued functions
- Probabilities with gaps and gluts
- Distance-based paraconsistent logics
- On extensions of triangular norms on bounded lattices
- Countably many weakenings of Belnap-Dunn logic
- Paraconsistency and the need for infinite semantics
- Bilattice logic properly displayed
- Distributive bilattices from the perspective of natural duality theory.
- The logic of generalized truth values and the logic of bilattices
- Policy-based inconsistency management in relational databases
- Active logic semantics for a single agent in a static world
- Analysing inconsistent first-order knowledgebases
- Adding a conditional to Kripke's theory of truth
- Is `no' a force-indicator? Yes, sooner or later!
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- Quotients of d-frames
- Representation of interlaced trilattices
- Any-world assumptions in logic programming
- A skeptical theory of inheritance in nonmonotonic semantic networks
- The problem of rational knowledge
- Correspondence analysis and automated proof-searching for first degree entailment
- Metasequents and tetravaluations
- A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE
- Notes on models of (partial) Kripke-Feferman truth
- Paraconsistent modal logics
- The relevance of relevance to relevance logic
- Reductio ad contradictionem: an algebraic perspective
- On all strong Kleene generalizations of classical logic
- Gradual structures of oppositions
- A Gentzen calculus for nothing but the truth
- Preferences in artificial intelligence
- Data repair of inconsistent nonmonotonic description logic programs
- How a Computer Should Think
- Bi-classical connexive logic and its modal extension: cut-elimination, completeness and duality
- On a multilattice analogue of a hypersequent S5 calculus
- Judging actions on the basis of prima facie duties. The case of self-driving cars
- Belief revision in non-classical logics
- Processing Information from a Set of Sources
- Bilattices with implications
- A useful four-valued extension of the temporal logic \(\mathsf{K}_{\mathsf t}\mathsf{T4}\)
- An infinity of super-Belnap logics
- On deductive bases for paraconsistent answer set semantics
- A modal theorem-preserving translation of a class of three-valued logics of incomplete information
- A computational interpretation of conceptivism
- Substructural epistemic logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206928)