Avoiding duplicate proofs with the foothold refinement
type: Item
instance of: scholarly article
title: Avoiding duplicate proofs with the foothold refinement
zbMATH Open document ID: 0858.68091
DOI: 10.1007/BF01530763
author: Bruce D. Spencer
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-03-25T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 937304
zbMATH Keywords: automated reasoning
zbMATH Keywords: SLI resolution
zbMATH Keywords: disjunctive logic programs
MaRDI profile type: Publication
cites work: Q5679729
cites work: Q5649989
cites work: Q4139711
cites work: A fixpoint semantics for disjunctive logic programs
cites work: Seventy-five problems for testing automatic theorem provers
cites work: A sequent-style model elimination strategy and a positive refinement
cites work: How to avoid the derivation of redundant clauses in reasoning systems
cites work: A Prolog technology theorem prover: Implementation by an extended Prolog compiler
cites work: Q3994754
description: scientific article; zbMATH DE number 937304