The complexity of logic-based abduction
Journal of the ACM (JACM)
Probabilistic logic programming with conditional constraints
ACM Transactions on Computational Logic (TOCL)
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical 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
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Exact complexity of exact-four-colorability
Information Processing Letters
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
Artificial Intelligence - Special issue on nonmonotonic reasoning
Probabilistic logic under coherence: complexity and algorithms
Annals of Mathematics and Artificial Intelligence
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
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
The complexity of Kemeny elections
Theoretical Computer Science
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
Journal of Artificial Intelligence Research
The Computational Complexity of Weak Saddles
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Complexity of social welfare optimization in multiagent resource allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Data exchange beyond complete data
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding according to the shortest computations
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Query evaluation on a database given by a random graph
ICDT'07 Proceedings of the 11th international conference on Database Theory
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The complexity of computing minimal unidirectional covering sets
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
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)
Tractable approximations of consistent query answering for robust ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Autonomous Agents and Multi-Agent Systems
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
Reasoning about explanations for negative query answers in DL-lite
Journal of Artificial Intelligence Research
| Hi-index | 5.23 |