Constraint Satisfaction for Configuration: Logical Fundamentals, Algorithms, and Complexity: Publications
-
[1]
Size and Treewidth Bounds for Conjunctive Queries
Georg Gottlob‚ Stephanie Tien Lee‚ Gregory Valiant and Paul Valiant
In Journal of the ACM. 2012.
Accepted for publication
Details about Size and Treewidth Bounds for Conjunctive Queries | BibTeX data for Size and Treewidth Bounds for Conjunctive Queries | Download (pdf) of Size and Treewidth Bounds for Conjunctive Queries
-
[2]
On Minimal Constraint Networks
Georg Gottlob
In Artificial Intelligence. 2012.
Submitted Preprint
Details about On Minimal Constraint Networks | BibTeX data for On Minimal Constraint Networks | Download (pdf) of On Minimal Constraint Networks
-
[3]
The Partner Units Problem − A Constraint Programming Case Study
Conrad Drescher
In Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence‚ ICTAI'12. 2012.
Details about The Partner Units Problem − A Constraint Programming Case Study | BibTeX data for The Partner Units Problem − A Constraint Programming Case Study | Download (pdf) of The Partner Units Problem − A Constraint Programming Case Study
-
[4]
Unifying Software and Product Configuration: A Research Roadmap
Arnaud Hubaux‚ Dietmar Jannach‚ Conrad Drescher‚ Leonardo Murta‚ Tomi Mannisto‚ Krzysztof Czarnecki‚ Patrick Heymans‚ Tien Nguyen and Markus Zanker
In Proceedings of the ECAI 2012 Workshop on Configuration. 2012.
Details about Unifying Software and Product Configuration: A Research Roadmap | BibTeX data for Unifying Software and Product Configuration: A Research Roadmap | Download (pdf) of Unifying Software and Product Configuration: A Research Roadmap
-
[5]
LoCo — A Logic for Configuration Problems
Markus Aschinger‚ Conrad Drescher and Heribert Vollmer
In Proceedings of the 20th European Conference on Artificial Intelligence‚ ECAI 2012. 2012.
Details about LoCo — A Logic for Configuration Problems | BibTeX data for LoCo — A Logic for Configuration Problems | Download (pdf) of LoCo — A Logic for Configuration Problems
-
[6]
Parameterized Complexity of Weighted Satisfiability Problems
Nadia Creignou and Heribert Vollmer
In Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing‚ SAT 2012. 2012.
Details about Parameterized Complexity of Weighted Satisfiability Problems | BibTeX data for Parameterized Complexity of Weighted Satisfiability Problems | Download (pdf) of Parameterized Complexity of Weighted Satisfiability Problems
-
[7]
On Minimal Constraint Networks
Georg Gottlob
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming‚ CP 2011. Perugia‚ Italy. 2011.
Details about On Minimal Constraint Networks | BibTeX data for On Minimal Constraint Networks | Download (pdf) of On Minimal Constraint Networks
-
[8]
Introducing LoCo‚ a Logic for Configuration Problems
Markus Aschinger‚ Conrad Drescher and Georg Gottlob
In Proceedings of the 2nd Workshop on Logics for Component Configuration‚ LoCoCo 2011. Perugia‚ Italy. 2011.
Details about Introducing LoCo‚ a Logic for Configuration Problems | BibTeX data for Introducing LoCo‚ a Logic for Configuration Problems | Download (pdf) of Introducing LoCo‚ a Logic for Configuration Problems
-
[9]
Tackling the Partner Units Configuration Problem
Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen
In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). Barcelona‚ Spain. 2011.
Details about Tackling the Partner Units Configuration Problem | BibTeX data for Tackling the Partner Units Configuration Problem | Download (pdf) of Tackling the Partner Units Configuration Problem
-
[10]
Optimization Methods for the Partner Units Problem
Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen
In Proceedings of the 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011). Berlin‚ Germany. 2011.
Details about Optimization Methods for the Partner Units Problem | BibTeX data for Optimization Methods for the Partner Units Problem | Download (pdf) of Optimization Methods for the Partner Units Problem
-
[11]
Structural Decomposition Methods‚ and What They are Good For
Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen
2011.
Invited Paper at STACS 2011
Details about Structural Decomposition Methods‚ and What They are Good For | BibTeX data for Structural Decomposition Methods‚ and What They are Good For | Download (pdf) of Structural Decomposition Methods‚ and What They are Good For
-
[12]
Balanced Queries: Divide and Conquer
Dmitri Akatov and Georg Gottlob
In Proceedings of the 35th International Symposiums on Mathematical Foundations of Computer Science (MFCS 2010). Brno‚ Czech Republic. 2010.
Details about Balanced Queries: Divide and Conquer | BibTeX data for Balanced Queries: Divide and Conquer | Download (pdf) of Balanced Queries: Divide and Conquer
-
[13]
Tackling the Partner Units Configuration Problem
Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen
No. CS−RR−10−28. Computing Laboratory‚ University of Oxford. 2010.
Details about Tackling the Partner Units Configuration Problem | BibTeX data for Tackling the Partner Units Configuration Problem | Download (pdf) of Tackling the Partner Units Configuration Problem
-
[14]
Tractable Optimization Problems through Hypergraph−Based Structural Restrictions
Georg Gottlob‚ Gianluigi Greco and Francesco Scarcello
In Proceedings of the 36th International Colloquium on Automata‚ Languages and Programming. Rhodes‚ Greece. 2009.
Details about Tractable Optimization Problems through Hypergraph−Based Structural Restrictions | BibTeX data for Tractable Optimization Problems through Hypergraph−Based Structural Restrictions | Download (pdf) of Tractable Optimization Problems through Hypergraph−Based Structural Restrictions