scientific article; zbMATH DE number 590572

zbMath0820.68116MaRDI QIDQ4296171

Larry Wos, Jim Boyle, Ewing L. Lusk, Ross A. Overbeek

Publication date: 16 June 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automated reasoninglogic

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (27)

Basic research problems: The problem of strategy and hyperresolution ⋮ The problem of hyperparamodulation ⋮ The problem of hyperparamodulation and nuclei ⋮ Towards automating duality ⋮ The resonance strategy ⋮ Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction ⋮ Searching for circles of pure proofs ⋮ A finitely axiomatized formalization of predicate calculus with equality ⋮ Steps toward a computational metaphysics ⋮ Unification in sort theories and its applications ⋮ Constructing Craig interpolation formulas ⋮ The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself ⋮ The problem of demodulator adjunction ⋮ Automated Puzzle Solving ⋮ Partial matching for analogy discovery in proofs and counter-examples ⋮ Building proofs or counterexamples by analogy in a resolution framework ⋮ A typed resolution principle for deduction with conditional typing theory ⋮ The problem of naming and function replacement ⋮ The kernel strategy and its use for the study of combinatory logic ⋮ The problem of reasoning by analogy ⋮ The problem of selecting an approach based on prior success ⋮ The problem of automated theorem finding ⋮ SET-VAR ⋮ Automated proofs of equality problems in Overbeek's competition ⋮ The problem of induction ⋮ The problem of reasoning by case analysis ⋮ The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies

This page was built for publication: