Pages that link to "Item:Q6488549"

The following pages link to On restrictions of ordered paramodulation with simplification (Q6488549):

Displaying 21 items.

• Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
• Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
• A completion procedure for conditional equations (Q758211) (← links)
• Order-sorted completion: The many-sorted way (Q1177935) (← links)
• On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
• Basic paramodulation (Q1899908) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
• Goal directed strategies for paramodulation (Q5055756) (← links)
• Regular substitution sets: A means of controlling E-unification (Q5055844) (← links)
• The search efficiency of theorem proving strategies (Q5210762) (← links)
• Ordered chaining for total orderings (Q5210789) (← links)
• Associative-commutative deduction with constraints (Q5210795) (← links)
• Automated Reasoning (Q5307052) (← links)
• Inductive theorem proving by consistency for first-order clauses (Q5881188) (← links)
• Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
• Completion of first-order clauses with equality by strict superposition (Q5881276) (← links)
• Clausal rewriting (Q5881281) (← links)
• A comprehensive framework for saturation theorem proving (Q5918558) (← links)
• A comprehensive framework for saturation theorem proving (Q5970776) (← links)
• Positive deduction modulo regular theories (Q6560184) (← links)