András Z. Salamon

Michael Wehar

Theory Comput. Syst., June, 2023

Towards Exploratory Reformulation of Constraint Models.

[BibT_eX]

[DOI]

Ian Miguel

Christopher Stone

CoRR, 2023

Towards a Model of Puzznic.

[BibT_eX]

[DOI]

CoRR, 2023

Challenges in Modelling and Solving Plotting with PDDL.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Automatic Tabulation in Constraint Models.

[BibT_eX]

[DOI]

CoRR, 2022

Superlinear Lower Bounds Based on ETH.

[BibT_eX]

[DOI]

Michael Wehar

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Towards Reformulating Essence Specifications for Robustness.

[BibT_eX]

[DOI]

Alan M. Frisch

Ian Miguel

Peter Nightingale

CoRR, 2021

2020

Exploring Instance Generation for Automated Planning.

[BibT_eX]

[DOI]

CoRR, 2020

Stronger Lower Bounds for Polynomial Time Problems.

[BibT_eX]

[DOI]

Michael Wehar

CoRR, 2020

Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019

Conjure Documentation, Release 2.3.0.

[BibT_eX]

[DOI]

CoRR, 2019

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Instance Generation via Generator Instances.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

A Framework for Constraint Based Local Search using Essence.

[BibT_eX]

[DOI]

Saad Attieh

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Automatic Discovery and Exploitation of Promising Subproblems for Tabulation.

[BibT_eX]

[DOI]

Ian Miguel

Peter Nightingale

Proceedings of the Principles and Practice of Constraint Programming, 2018

2015

Transformations of representation in constraint satisfaction.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

2014

Classification of annotation semirings over containment of conjunctive queries.

[BibT_eX]

[DOI]

Egor V. Kostylev

Juan L. Reutter

ACM Trans. Database Syst., 2014

2013

Transformations of representation in constraint satisfaction.

[BibT_eX]

[DOI]

PhD thesis, 2013

2012

The Tractability of CSP Classes Defined by Forbidden Patterns.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2012

Streaming bounds from difference ramification.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Macroscopes: models for collective decision making

[BibT_eX]

[DOI]

Subramanian Ramamoorthy

Rahul Santhanam

CoRR, 2012

Classification of annotation semirings over query containment.

[BibT_eX]

[DOI]

Egor V. Kostylev

Juan L. Reutter

Suresh Venkatasubramanian

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

2011

The tractability of CSP classes defined by forbidden patterns

[BibT_eX]

[DOI]

CoRR, 2011

2010

Questions answered. in theory.: http://cstheory.stackexchange.com/.

[BibT_eX]

[DOI]

SIGACT News, 2010

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.

[BibT_eX]

[DOI]

Martin C. Cooper

Peter G. Jeavons

Artif. Intell., 2010

2009

Bounds on series-parallel slowdown

[BibT_eX]

[DOI]

Vashti Galpin

CoRR, 2009

2008

Hybrid tractable CSPs which generalize tree structure.

[BibT_eX]

[DOI]

Martin C. Cooper

Peter G. Jeavons

Proceedings of the ECAI 2008, 2008

Perfect Constraints Are Tractable.

[BibT_eX]

[DOI]