Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Decomposing and Distributing Configuration Problems
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Decomposition strategies for configuration problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Fast Theta-Subsumption with Constraint Satisfaction Algorithms
Machine Learning
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Task-dependent qualitative domain abstraction
Artificial Intelligence - Special volume on reformulation
Query answering exploiting structural properties
ACM SIGMOD Record
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
On the efficiency of checking perfect privacy
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
Combinatorial auctions with tractable winner determination
ACM SIGecom Exchanges
Efficient core computation in data exchange
Journal of the ACM (JACM)
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
What Is a Real-World SAT Instance?
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
From constraint representations of sequential code and program annotations to their use in debugging
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
A causal analysis method for concurrent hybrid automata
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Model-based monitoring and diagnosis of systems with software-extended behavior
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Conditional constraint satisfaction: logical foundations and complexity
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Dynamic heuristics for backtrack search on tree-decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Qualitative temporal reasoning about vague events
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Automated qualitative domain abstraction
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coupling CSP decomposition methods and diagnosis algorithms for tree-structured systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Bounded search and symbolic inference for constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hypertree-decomposition via branch-decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Task-dependent qualitative domain abstraction
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
A structural approach to reasoning with quantified Boolean formulas
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Treewidth computations I. Upper bounds
Information and Computation
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
A graph based backtracking algorithm for solving general CSPs
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
On the treewidth of NK landscapes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint representations and structural tractability
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Optimal temporal decoupling in multiagent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Default conceptual graph rules, atomic negation and Tic-Tac-Toe
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Typed guarded decompositions for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The effect of constraint representation on structural tractability
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Local search algorithm for unicost set covering problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Conflict-Directed a* search for soft constraints
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
New structural decomposition techniques for constraint satisfaction problems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Finding good decompositions for dynamic programming on dense graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
On minimal constraint networks
Artificial Intelligence
Distributed tree decomposition with privacy
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Theoretical Computer Science
| Hi-index | 0.00 |