Projection and scope-determined circumscription
type: Item
instance of: scholarly article
title: Projection and scope-determined circumscription
zbMATH Open document ID: 1259.03025
author: Christoph Wernhard
published in: Journal of Symbolic Computation
publication date: 2012-06-20T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 6048194
zbMATH Keywords: circumscription
zbMATH Keywords: second-order quantifier elimination
zbMATH Keywords: forgetting
zbMATH Keywords: strongest necessary and weakest sufficient condition
zbMATH Keywords: literal projection
zbMATH Keywords: raising
zbMATH Keywords: first-order logic
describes a project that uses: ToyElim
MaRDI profile type: Publication
full work available at URL: j.jsc.2011.12.034
OpenAlex ID: W2074567616
cites work: Computing circumscription revisited: A reduction algorithm
cites work: Q3220545
cites work: Q3543581
cites work: Clause Elimination Procedures for CNF Formulas
cites work: Q4411161
cites work: Q4296747
cites work: On strongest necessary and weakest sufficient conditions
cites work: Circumscription - a form of non-monotonic reasoning
cites work: An algorithm to compute circumscription
cites work: Logics in Artificial Intelligence
cites work: Literal Projection for First-Order Logic
cites work: Tableaux for Projection Computation and Knowledge Compilation
cites work: Circumscription and projection as primitives of logic programming
DOI: 10.1016/J.JSC.2011.12.034
description: scientific article; zbMATH DE number 6048194