On the counting complexity of propositional circumscription
type: Item
instance of: scholarly article
title: On the counting complexity of propositional circumscription
zbMATH Open document ID: 1186.68448
author: Arnaud Durand
author: Miki Hermann
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5694927
zbMATH Keywords: computational complexity
zbMATH Keywords: counting complexity
zbMATH Keywords: propositional circumscription
zbMATH Keywords: Horn
zbMATH Keywords: dual Horn
zbMATH Keywords: bijunctive
zbMATH Keywords: and affine formulas
zbMATH Keywords: Hypergraph transversal
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.11.006
OpenAlex ID: W2019722250
cites work: Minimal vectors in linear codes
cites work: The complexity of model checking for circumscriptive formulae
cites work: Subtractive reductions and complete problems for counting complexity classes
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Generating all maximal models of a Boolean expression
cites work: The complexity of minimal satisfiability problems
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3221403
cites work: Handbook of automated reasoning. In 2 vols
cites work: The complexity of satisfiability problems
cites work: The polynomial-time hierarchy
cites work: The complexity of computing the permanent
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Complete sets and the polynomial-time hierarchy
DOI: 10.1016/J.IPL.2007.11.006
description: scientific article; zbMATH DE number 5694927