default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. SARA 2013: Leavenworth, Washington, USA
- Alan M. Frisch, Peter Gregory:
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013, 11-12 July 2013, Leavenworth, Washington, USA. AAAI 2013, ISBN 978-1-57735-630-1 - SARA 2013 Organization.
- Preface.
- Past SARA Symposia.
Invited Talks
- J. Christopher Beck:
Modeling, Global Constraints, and Decomposition. - Lorenza Saitta:
Abstraction: A Historical and Interdisciplinary Perspective.
Full Papers
- Amir Aavani, David G. Mitchell, Eugenia Ternovska:
New Encoding for Translating Pseudo-Boolean Constraints into SAT. - Maher A. Alhossaini, J. Christopher Beck:
Instance-Specific Remodelling of Planning Domains by Adding Macros and Removing Operators. - Christian Bessiere, Zeynep Kiziltan, Andrea Rappini, Toby Walsh:
A Framework for Combining Set Variable Representations. - Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
Determining Linearity of Optimal Plans by Operator Schema Analysis. - Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey, Diane E. Kitchin:
Generating Macro-Operators by Exploiting Inner Entanglements. - Filip Dvorak, Daniel Toropila, Roman Barták:
Towards AI Planning Efficiency: Finite-Domain State Variable Reformulation. - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:
Microstructures for CSPs with Constraints of Arbitrary Arity. - Saïd Jabbour, Jerry Lonlac
, Lakhdar Saïs:
Adding New Bi-Asserting Clauses for Faster Search in Modern SAT Solvers. - T. K. Satish Kumar, Marcello Cirillo, Sven Koenig:
On the Traveling Salesman Problem with Simple Temporal Constraints. - T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Incorrect Lower Bounds for Path Consistency and More. - T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Submodular Constraints and Planar Constraint Networks: New Results. - Abhijeet Mohapatra, Michael R. Genesereth:
Reformulating Aggregate Queries Using Views. - Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Using Coarse State Space Abstractions to Detect Mutex Pairs. - Nathan R. Sturtevant:
External Memory PDBs: Initial Results.
Extended Abstracts
- Pavel Surynek:
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. - Harm van Seijen, Shimon Whiteson, Leon J. H. M. Kester:
Efficient Abstraction Selection in Reinforcement Learning (Extended Abstract).
Research Summaries
- Robert C. Holte:
Korf's Conjecture and the Future of Abstraction-Based Heuristics. - Ashique Rupam Mahmood, Richard S. Sutton:
Position Paper: Representation Search through Generate and Test.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
