The following pages link to (Q4139711):
Displayed 50 items.
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Verifying local stratifiability of logic programs and databases (Q1205177) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Local simplification (Q1271570) (← links)
- Theorem proving by chain resolution (Q1274972) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- How good are branching rules in DPLL? (Q1281405) (← links)
- An implementation of Kripke-Kleene semantics (Q1292578) (← links)
- The approximation of implicates and explanations (Q1308780) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- On the mechanical derivation of loop invariants (Q1322851) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- On subsumption in distributed derivations (Q1337562) (← links)
- Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures (Q1340966) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732) (← links)
- Computing answers with model elimination (Q1402748) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- \(\mathcal I\)-SATCHMORE: An improvement of \(\mathcal A\)-SATCHMORE (Q1429427) (← links)
- Linear strategy for Boolean ring based theorem proving (Q1579733) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- The achievement of knowledge bases by cycle search. (Q1854365) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- SATCHMORE: SATCHMO with RElevancy (Q1891262) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- A note on assumptions about Skolem functions (Q1904405) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- Avoiding duplicate proofs with the foothold refinement (Q1924821) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)