Complexity and related enhancements for automated theorem-proving programs
type: Item
instance of: scholarly article
title: Complexity and related enhancements for automated theorem-proving programs
zbMATH Open document ID: 0336.68037
DOI: 10.1016/0898-1221(76)90002-X
author: K. Appert
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 3526307
Wikidata QID: Q114262236
MaRDI profile type: Publication
cites work: The Unit Proof and the Input Proof in Theorem Proving
cites work: An implementation of hyper-resolution
cites work: Q3268764
cites work: The Concept of Demodulation in Theorem Proving
full work available at URL: 0898-1221(76)90002-x
OpenAlex ID: W2036475963
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3526307