Computing answers with model elimination
type: Item
instance of: scholarly article
title: Computing answers with model elimination
zbMATH Open document ID: 1017.03505
DOI: 10.1016/S0004-3702(96)00042-2
author: Peter Baumgartner
author: Ulrich Furbach
author: Frieder Stolzenburg
published in: Artificial Intelligence
publication date: 2003-08-28T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1972334
zbMATH Keywords: Automated reasoning
zbMATH Keywords: Theorem proving
zbMATH Keywords: Model elimination
zbMATH Keywords: Logic programing
zbMATH Keywords: Computing answers
describes a project that uses: SETHEO
describes a project that uses: TPTP
describes a project that uses: PROTEIN
describes a project that uses: OTTER
describes a project that uses: SATCHMO
MaRDI profile type: Publication
cites work: Q4261066
cites work: Consolution as a framework for comparing calculi
cites work: Model elimination without contrapositives
cites work: Q5679729
cites work: Q4012177
cites work: Removing redundancy from a clause
cites work: Q5649989
cites work: Q3785940
cites work: Controlled integration of the cut rule into connection tableau calculi
cites work: SETHEO: A high-performance theorem prover
cites work: Q3992908
cites work: Mechanical Theorem-Proving by Model Elimination
cites work: Q4139711
cites work: Near-Horn prolog and beyond
cites work: Near-Horn Prolog and the ancestry family of procedures
cites work: Q3821629
cites work: Problem corner: Predicate logic hacker tricks
cites work: Non-Horn clause logic programming without contrapositives
cites work: Q4202953
cites work: Implication of clauses is undecidable
cites work: Q3869300
cites work: Automated deduction by theory resolution
cites work: A Prolog technology theorem prover: Implementation by an extended Prolog compiler
cites work: The TPTP problem library
description: scientific article; zbMATH DE number 1972334