Pages that link to "Item:Q5538933"

The following pages link to Automatic Theorem Proving With Renamable and Semantic Resolution (Q5538933):

Displaying 9 items.

• Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
• Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
• Theorem proving with abstraction (Q1149799) (← links)
• A method for simultaneous search for refutations and models by equational constraint solving (Q1198235) (← links)
• Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
• The search efficiency of theorem proving strategies (Q5210762) (← links)
• A method for building models automatically. Experiments with an extension of OTTER (Q5210763) (← links)
• A complete semantic back chaining proof system (Q6488519) (← links)
• Fully reusing clause deduction algorithm based on standard contradiction separation rule (Q6492544) (← links)