András Z. Salamon

According to our database, András Z. Salamon authored at least 31 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Plotting: a case study in lifted planning with constraints.

Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret

Constraints An Int. J., June, 2024

Automating Reformulation of Essence Specifications via Graph Rewriting.

Ian Miguel, András Z. Salamon, Christopher Stone

CoRR, 2024

A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models.

Christopher Stone, András Z. Salamon, Ian Miguel

Proceedings of the Graph Transformation - 17th International Conference, 2024

2023

Effective Guessing Has Unlikely Consequences.

András Z. Salamon, Michael Wehar

Theory Comput. Syst., June, 2023

Towards Exploratory Reformulation of Constraint Models.

Ian Miguel, András Z. Salamon, Christopher Stone

CoRR, 2023

Towards a Model of Puzznic.

Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret

CoRR, 2023

Challenges in Modelling and Solving Plotting with PDDL.

Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret

CoRR, 2023

2022

Automatic Tabulation in Constraint Models.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean

CoRR, 2022

Superlinear Lower Bounds Based on ETH.

András Z. Salamon, Michael Wehar

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

2021

Towards Reformulating Essence Specifications for Robustness.

Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

CoRR, 2021

2020

Exploring Instance Generation for Automated Planning.

Özgür Akgün, Nguyen Dang, Joan Espasa, Ian Miguel, András Z. Salamon, Christopher Stone

CoRR, 2020

Stronger Lower Bounds for Polynomial Time Problems.

András Z. Salamon, Michael Wehar

CoRR, 2020

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

Özgür Akgün, Nguyen Dang, Ian Miguel, András Z. Salamon, Patrick Spracklen, Christopher Stone

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

2019

Conjure Documentation, Release 2.3.0.

Özgür Akgün, András Z. Salamon

CoRR, 2019

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

Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret

Proceedings of the Principles and Practice of Constraint Programming, 2019

Instance Generation via Generator Instances.

Özgür Akgün, Nguyen Dang, Ian Miguel, András Z. Salamon, Christopher Stone

Proceedings of the Principles and Practice of Constraint Programming, 2019

2018

A Framework for Constraint Based Local Search using Essence.

Özgür Akgün, Saad Attieh, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon, Patrick Spracklen, James Wetter

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

Automatic Discovery and Exploitation of Promising Subproblems for Tabulation.

Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

Proceedings of the Principles and Practice of Constraint Programming, 2018

2015

Transformations of representation in constraint satisfaction.

András Z. Salamon

Constraints An Int. J., 2015

2014

Classification of annotation semirings over containment of conjunctive queries.

Egor V. Kostylev, Juan L. Reutter, András Z. Salamon

ACM Trans. Database Syst., 2014

2013

Transformations of representation in constraint satisfaction.

András Z. Salamon

PhD thesis, 2013

2012

The Tractability of CSP Classes Defined by Forbidden Patterns.

David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon

J. Artif. Intell. Res., 2012

Streaming bounds from difference ramification.

András Z. Salamon

Electron. Colloquium Comput. Complex., 2012

Macroscopes: models for collective decision making

Subramanian Ramamoorthy, András Z. Salamon, Rahul Santhanam

CoRR, 2012

Classification of annotation semirings over query containment.

Egor V. Kostylev, Juan L. Reutter, András Z. Salamon

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

David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon

CoRR, 2011

2010

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

Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. Sterling, Suresh Venkatasubramanian

SIGACT News, 2010

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

Martin C. Cooper, Peter G. Jeavons, András Z. Salamon

Artif. Intell., 2010

2009

Bounds on series-parallel slowdown

András Z. Salamon, Vashti Galpin

CoRR, 2009

2008

Hybrid tractable CSPs which generalize tree structure.

Martin C. Cooper, Peter G. Jeavons, András Z. Salamon

Proceedings of the ECAI 2008, 2008

Perfect Constraints Are Tractable.

András Z. Salamon, Peter G. Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2008