The following pages link to (Q4281690):
Displayed 8 items.
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- Analytic tableaux for non-deterministic semantics (Q2142063) (← links)
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (Q2209555) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- The tableau-based theorem prover 3 T A P Version 4.0 (Q4647529) (← links)
- Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs (Q4982058) (← links)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)