Pages that link to "Item:Q2639044"

The following pages link to A sequent-style model elimination strategy and a positive refinement (Q2639044):

Displaying 11 items.

• A semantic backward chaining proof system (Q1193483) (← links)
• A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
• TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
• Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
• Non-Horn clause logic programming (Q1402738) (← 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)
• Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
• Optimizing proof search in model elimination (Q4647531) (← links)
• Model elimination without contrapositives (Q5210764) (← links)