scientific article
From MaRDI portal
Publication:3833651
zbMath0677.68094MaRDI QIDQ3833651
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automated deductionrecursive programsbottom-up reduction techniquePROLOG systemstopdown theorem provers
Related Items
Hypothesis finding based on upward refinement of residue hypotheses., KoMeT, Constraint satisfaction from a deductive viewpoint, IeanCOP: lean connection-based theorem proving, Non-elementary speed-ups in proof length by different variants of classical analytic calculi, The undecidability of simultaneous rigid E-unification, Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach, Detecting non-provable goals, Let's plan it deductively!, Simplification of boolean verification conditions, Decidability and complexity of simultaneous rigid E-unification with one variable and related results, Set of support, demodulation, paramodulation: a historical perspective
