The following pages link to Refutation graphs (Q1226867):
Displaying 20 items.
- The disconnection tableau calculus (Q877889) (← links)
- On connections and higher-order logic (Q908896) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- Using rewriting rules for connection graphs to prove theorems (Q1137877) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- Paramodulated connection graphs (Q1257912) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← 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)
- On the termination of clause graph resolution (Q1344889) (← links)
- A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (Q1354059) (← links)
- Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732) (← links)
- Presenting inequations in mathematical proofs (Q1818758) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Subgoal alternation in model elimination (Q4610327) (← links)
- Semantic tableaux with ordering restrictions (Q5210807) (← links)
- Lemma matching for a PTTP-based top-down theorem prover (Q5234698) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)
