Theorem proving with abstraction
type: Item
instance of: scholarly article
title: Theorem proving with abstraction
zbMATH Open document ID: 0454.68113
DOI: 10.1016/0004-3702(81)90015-1
published in: Artificial Intelligence
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 3711450
zbMATH Keywords: resolution proofs
zbMATH Keywords: clauses
zbMATH Keywords: set-of-support strategies
author: David A. Plaisted
MaRDI profile type: Publication
full work available at URL: 0004-3702(81)90015-1
OpenAlex ID: W2025339139
Wikidata QID: Q30052608
cites work: Non-resolution theorem proving
cites work: Q5679729
cites work: Unit Refutations and Horn Sets
cites work: A paradigm for reasoning by analogy
cites work: Q5633671
cites work: Q5619635
cites work: Q3885237
cites work: Q5541351
cites work: Q5562604
cites work: Planning in a hierarchy of abstraction spaces
cites work: Automatic Theorem Proving With Renamable and Semantic Resolution
cites work: Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
DBLP publication ID: journals/ai/Plaisted81
description: scientific article; zbMATH DE number 3711450