András Salamon
Title
Cited by
Cited by
Year
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
MC Cooper, PG Jeavons, AZ Salamon
Artificial Intelligence 174 (9-10), 570-584, 2010
882010
The Tractability of CSP Classes Defined by Forbidden Patterns
DA Cohen, MC Cooper, P Creed, D Marx, AZ Salamon
Journal of Artificial Intelligence Research 45 (http://dx.doi.org/10.1613 …, 2012
322012
Perfect constraints are tractable
AZ Salamon, PG Jeavons
CP 2008: 14th International Conference on Principles and Practice of …, 2008
322008
Hybrid tractable CSPs which generalize tree structure
MC Cooper, PG Jeavons, AZ Salamon
ECAI 2008: 18th European Conference on Artificial Intelligence, 530-534, 2008
172008
A framework for constraint based local search using Essence
O Akgun, SWA Attieh, IP Gent, CA Jefferson, IJ Miguel, PW Nightingale, ...
Proceedings of the Twenty-Seventh International Joint Conference on …, 2018
102018
Automatic discovery and exploitation of promising subproblems for tabulation
Ö Akgün, IP Gent, C Jefferson, I Miguel, P Nightingale, AZ Salamon
International Conference on Principles and Practice of Constraint …, 2018
92018
Task graph performance bounds through comparison methods
AZ Salamon
University of the Witwatersrand, 2001
82001
Techniques to achieve moderate alcohol levels in South African wine
A Salamon
Cape Wine Master Diploma, 2006
72006
Instance generation via generator instances
Ö Akgün, N Dang, I Miguel, AZ Salamon, C Stone
International Conference on Principles and Practice of Constraint …, 2019
62019
Classification of annotation semirings over containment of conjunctive queries
EV Kostylev, JL Reutter, AZ Salamon
ACM Transactions on Database Systems (TODS) 39 (1), 1-39, 2014
42014
Classification of annotation semirings over query containment
EV Kostylev, JL Reutter, AZ Salamon
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
22012
Macroscopes: models for collective decision making
S Ramamoorthy, AZ Salamon, R Santhanam
arXiv preprint arXiv:1204.3860, 2012
22012
Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP
Ö Akgün, N Dang, I Miguel, AZ Salamon, P Spracklen, C Stone
International Conference on Integration of Constraint Programming …, 2020
12020
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
C Ansótegui, M Bofill, J Coll, N Dang, JL Esteban, I Miguel, P Nightingale, ...
International Conference on Principles and Practice of Constraint …, 2019
12019
Streaming bounds from difference ramification.
AZ Salamon
Electronic Colloquium on Computational Complexity (ECCC) 19, 183, 2012
12012
Inherent Limitations on Parallel Program Performance
A Salamon, H Neishlos
University of the Witwatersrand, 1991
11991
Exploring Instance Generation for Automated Planning
Ö Akgün, N Dang, J Espasa, I Miguel, AZ Salamon, C Stone
arXiv preprint arXiv:2009.10156, 2020
2020
Stronger Lower Bounds for Polynomial Time Problems
AZ Salamon, M Wehar
arXiv preprint arXiv:2008.06805, 2020
2020
Conjure Documentation, Release 2.3. 0
Ö Akgün, A Salamon
arXiv preprint arXiv:1910.00475, 2019
2019
Transformations of representation in constraint satisfaction
AZ Salamon
University of Oxford, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–20