SARA 2013

Accepted Papers

Home | Call for Papers | Programme Committee | Dates | Submission | Local Info |

Keynote Speakers | Accepted Papers | Schedule

Amir Aavani, David Mitchell and Eugenia Ternovska
New Encoding for Translating Pseudo-Boolean Constraints into SAT

Maher Alhossaini and Chris Beck
Instance-Specific Remodelling of Planning Domains by Adding Macros and Removing Operators

Christian Bessiere, Zeynep Kiziltan, Andrea Rappini and Toby Walsh
A Framework for Combining Set Variable Representations

Lukas Chrpa, Mauro Vallati, Thomas Leo Mccluskey and Diane Kitchin
Generating Macro-operators by Exploiting Inner Entanglements

Lukas Chrpa, Mauro Vallati and Thomas Leo Mccluskey
Determining Linearity of Optimal Plans by Operator Schema Analysis

T.K. Satish Kumar, Liron Cohen and Sven Koenig
Submodular Constraints and Planar Constraint Networks: New Results

T.K. Satish Kumar, Liron Cohen and Sven Koenig
Incorrect Lower Bounds for Path Consistency and More

Filip Dvorak, Daniel Toropila and Roman Bartak
Towards AI Planning Efficiency: Finite-domain State Variable Reformulation

Robert Holte
Korf's Conjecture and the Future of Abstraction-based Heuristics

Said Jabbour, Jerry Lonlac and Lakhdar Saïs
Adding New Bi-Asserting Clauses For Faster Search in Modern SAT Solvers

T. K. Satish Kumar, Marcello Cirillo and Sven Koenig
On the Traveling Salesman Problem with Simple Temporal Constraints

Ashique Rupam Mahmood and Richard S. Sutton
Representation Search through Generate and Test

Abhijeet Mohapatra and Michael Genesereth
Reformulating Aggregate Queries Using Views

Achref El Mouelhi, Philippe Jegou and Cyril Terrioux
Microstructures for CSPs with Constraints of Arbitrary Arity

Mehdi Sadeqi, Robert Holte and Sandra Zilles
Using Coarse State Space Abstractions to Detect Mutex Pairs

Harm van Seijen, Shimon Whiteson and Leon Kester
Efficient Abstraction Selection in Reinforcement Learning

Nathan Sturtevant
External Memory PDBs: Initial Results

Pavel Surynek
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases