Pages that link to "Item:Q1897558"
From MaRDI portal
The following pages link to Resolution-based theorem proving for many-valued logics (Q1897558):
Displaying 30 items.
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- Binary resolution over Boolean lattices (Q853473) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
- A resolution framework for finitely-valued first-order logics (Q1185455) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- Proof search and co-NP completeness for many-valued logics (Q1697337) (← links)
- Optimal axiomatizations of finitely valued logics (Q1854378) (← links)
- On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic (Q1933772) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic (Q2392565) (← links)
- Ideal resolution principle for lattice-valued first-order logic based on lattice implication algebra (Q2440194) (← links)
- (Q2766946) (← links)
- Resolution-Like Theorem Proving for High-Level Conditions (Q3540406) (← links)
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination (Q3605518) (← links)
- CWA Extensions to Multi-Valued Logics (Q3647206) (← links)
- (Q3726086) (← links)
- Automatisches Beweisen für endlichwertige Logiken. (Automatic theorem- proving for finite-valued logics) (Q3976578) (← links)
- On the completeness theorem for many-valued lattices (Q4005530) (← links)
- Short Conjunctive Normal Forms in Finitely Valued Logics (Q4323008) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- MUltlog 1.0: Towards an expert system for many-valued logics (Q4647516) (← links)
- Semantic trees revisited: Some new completeness results (Q4647548) (← links)
- Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices (Q4647557) (← links)
- An application of automated equational reasoning to many-valued logic (Q5881275) (← links)
- CWA formalizations in multi-valued logics (Q5942700) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)