scientific article; zbMATH DE number 516992
From MaRDI portal
Publication:4282510
zbMath0793.68131MaRDI QIDQ4282510
Gernot Salzer, Christian G. Fermüller
Publication date: 21 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilityTuring machinesdecidabilityresolutionautomated theorem provingordered paramodulationfirst order formulas
Related Items (4)
Tree tuple languages from the logic programming point of view ⋮ Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover ⋮ Testable and untestable classes of first-order formulae ⋮ Decidability and complexity analysis by basic paramodulation
This page was built for publication:
