STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
The complexity of logic-based abduction
Journal of the ACM (JACM)
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
Extending and implementing the stable model semantics
Artificial Intelligence
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The Operators minCh and maxCh on the Polynomial Hierarchy
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Reductions between disjoint NP-pairs
Information and Computation
The complexity of model checking for propositional default logics
Data & Knowledge Engineering
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
A knowledge-based approach for selecting information sources
Theory and Practice of Logic Programming
Outlier detection by logic programming
ACM Transactions on Computational Logic (TOCL)
Proving SAT does not have small circuits with an application to the two queries problem
Journal of Computer and System Sciences
What causes a system to satisfy a specification?
ACM Transactions on Computational Logic (TOCL)
The Complexity of Power-Index Comparison
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Note: The complexity of power-index comparison
Theoretical Computer Science
Lexicographical Inference over Inconsistent DL-Based Ontologies
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
A note on #P-completeness of NP-witnessing relations
Information Processing Letters
Formal Methods in System Design
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Detecting outlying properties of exceptional objects
ACM Transactions on Database Systems (TODS)
Complexity of counting the optimal solutions
Theoretical Computer Science
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
Responsibility and blame: a structural-model approach
Journal of Artificial Intelligence Research
Semantical and computational aspects of horn approximations
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
Model-based revision operators for terminologies in description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reductions between disjoint NP-Pairs
Information and Computation
Acceptor-definable counting classes
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Updating action domain descriptions
Artificial Intelligence
Other complexity classes and measures
Algorithms and theory of computation handbook
The complexity of finding reset words in finite automata
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Weighted argument systems: Basic definitions, algorithms, and complexity results
Artificial Intelligence
The complexity of finding kth most probable explanations in probabilistic networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Detecting and repairing anomalous evolutions in noisy environments
Annals of Mathematics and Artificial Intelligence
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Logspace optimization problems and their approximability properties
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Structural complexity of multiobjective NP search problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survey: A survey on the structure of approximation classes
Computer Science Review
Survey: The consequences of eliminating NP solutions
Computer Science Review
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Fundamenta Informaticae
Do hard SAT-related reasoning tasks become easier in the Krom fragment?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Functions Computable with Nonadaptive Queries to NP
Theory of Computing Systems
| Hi-index | 0.01 |