scientific article; zbMATH DE number 559756
From MaRDI portal
Publication:4289327
Recommendations
Cited in
(53)- Giles's game and the proof theory of Łukasiewicz logic
- A framework for automated reasoning in multiple-valued logics
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
- Optimal axiomatizations of finitely valued logics
- Resolution-based theorem proving for many-valued logics
- Many-valued logic and mixed integer programming
- Unranked fuzzy logic and reasoning
- Analytic tableaux for non-deterministic semantics
- Hypersequent and display calculi -- a unified perspective
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions
- The number of clones determined by disjunctions of unary relations
- Automated theorem proving by resolution in non-classical logics
- Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
- Automated deduction for many-valued logics
- scientific article; zbMATH DE number 2177634 (Why is no real title available?)
- A Modal-Layered Resolution Calculus for K
- Latticed Simulation Relations and Games
- CWA extensions to multi-valued logics
- An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics
- 1998 European Summer Meeting of the Association for Symbolic Logic
- scientific article; zbMATH DE number 512980 (Why is no real title available?)
- scientific article; zbMATH DE number 695097 (Why is no real title available?)
- scientific article; zbMATH DE number 1076961 (Why is no real title available?)
- scientific article; zbMATH DE number 1076962 (Why is no real title available?)
- On Theorem Proving in Annotated Logics
- scientific article; zbMATH DE number 2042613 (Why is no real title available?)
- scientific article; zbMATH DE number 1754535 (Why is no real title available?)
- scientific article; zbMATH DE number 1775515 (Why is no real title available?)
- Tableaux for logic programming with strong negation
- MUltlog 1.0: towards an expert system for many-valued logics
- The tableau-based theorem prover 3 T A P Version 4.0
- Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
- scientific article; zbMATH DE number 837781 (Why is no real title available?)
- Exploiting data dependencies in many-valued logics
- A mechanization of strong Kleene logic for partial functions
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
- Temporal reasoning over linear discrete time
- Effective Finite-Valued Approximations of General Propositional Logics
- Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- An application of automated equational reasoning to many-valued logic
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
- MaxSAT resolution for regular propositional logic
- Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC
- Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- Bilattice tableau calculi with rough set semantics
- Belief Horn merging operators: characterization results and implementations
- On partial and paraconsistent logics
- Simple tableaus for simple logics
- Complexity issues in Basic Logic
- Equilibrium logic
- Filter-based resolution principle for lattice-valued propositional logic LP(X)
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 Q4289327)
