The complexity of logic-based abduction
Journal of the ACM (JACM)
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
SIGACT news complexity theory column 35
ACM SIGACT News
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Alternating and Empty Alternating Auxiliary Stack Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Perspective on Lindström Quantifiers and Oracles
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Generalized Quantifiers in Logic Programs
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Theta2p-Completeness: A Classical Approach for New Results
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The Operators minCh and maxCh on the Polynomial Hierarchy
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Exact complexity of exact-four-colorability
Information Processing Letters
Complexity results for explanations in the structural-model approach
Artificial Intelligence
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
The complexity of Kemeny elections
Theoretical Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Cluster computing and the power of edge recognition
Information and Computation
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Complexity of counting the optimal solutions
Theoretical Computer Science
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Complexity of nested circumscription and abnormality theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The computational complexity of ideal semantics
Artificial Intelligence
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Updating action domain descriptions
Artificial Intelligence
Deciding according to the shortest computations
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences
Data exchange beyond complete data
Journal of the ACM (JACM)
Hi-index | 0.01 |