The complexity of model checking for circumscriptive formulae
Information Processing Letters
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal models of a Boolean expression
Information Processing Letters
Handbook of automated reasoning
Handbook of automated reasoning
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of minimal satisfiability problems
Information and Computation
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Minimal vectors in linear codes
IEEE Transactions on Information Theory
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.89 |
Propositional circumscription, asking for the minimal models of a Boolean formula, is an important problem in artificial intelligence, in data mining, in coding theory, and in the model checking based procedures in automated reasoning. We consider the counting problems of propositional circumscription for several subclasses with respect to the structure of the formula. We prove that the counting problem of propositional circumscription for dual Horn, bijunctive, and affine formulas is #P-complete for a particular case of Turing reduction, whereas for Horn and 2affine formulas it is in FP. As a corollary, we obtain also the #P-completeness result for the counting problem of hypergraph transversal.