Extracting information from resolution proof trees

DOI10.1016/0004-3702(71)90003-8zbMath0221.68051OpenAlexW2044919352MaRDI QIDQ2547494

David C. Luckham, Nils J. Nilsson

Publication date: 1971

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(71)90003-8

Mathematics Subject Classification ID

Related Items (12)

Defining answer classes using resolution refutation ⋮ Book review of: S. Russell and P. Norvig, Artificial intelligence: a modern approach ⋮ A logic for default reasoning ⋮ Un-Skolemizing clause sets ⋮ \(\Pi\)-representation: A clause representation for parallel search ⋮ A logical theory of robot problem solving ⋮ A note on answer extraction in resolution-based systems ⋮ Formal methods in the design of question-answering systems ⋮ Rule-oriented methods in problem solving ⋮ A complete, nonredundant algorithm for reversed Skolemization ⋮ Representations of the language recognition problem for a theorem prover ⋮ Constructing specification morphisms

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• Resolution With Merging
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extracting information from resolution proof trees