Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Inverting abstract unification for set-sharing
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
On the counting complexity of propositional circumscription
Information Processing Letters
Computational Complexity
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
How to Complete an Interactive Configuration Process?
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Formal approach to integrating feature and architecture models
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
| Hi-index | 0.89 |