default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. SARA 2007: Whistler, Canada
- Ian Miguel
, Wheeler Ruml:
Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings. Lecture Notes in Computer Science 4612, Springer 2007, ISBN 978-3-540-73579-3
Invited Talks (Abstracts)
- Vadim Bulitko:
State Abstraction in Real-Time Heuristic Search. 1 - Alan M. Frisch:
Abstraction and Reformulation in the Generation of Constraint Models. 2-3 - John N. Hooker:
A Framework for Integrating Optimization and Constraint Programming. 4
Research Papers
- Montserrat Abril, Miguel A. Salido, Federico Barber:
DFS-Tree Based Heuristic Search. 5-19 - Kenneth Anderson, Robert Holte, Jonathan Schaeffer:
Partial Pattern Databases. 20-34 - Scot Anderson, Peter Z. Revesz:
CDB-PV: A Constraint Database-Based Program Verifier. 35-49 - Roman Barták:
Generating Implied Boolean Constraints Via Singleton Consistency. 50-63 - Kenneth M. Bayer, Martin Michalowski, Berthe Y. Choueiry, Craig A. Knoblock:
Reformulating Constraint Satisfaction Problems to Improve Scalability. 64-79 - Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper, Toby Walsh:
Reformulating Global Constraints: The Slideand RegularConstraints. 80-92 - Dominique D'Almeida, Jean-François Condotta, Christophe Lecoutre, Lakhdar Sais:
Relaxation of Qualitative Constraint Networks. 93-108 - Johan de Kleer:
Dynamic Domain Abstraction Through Meta-diagnosis. 109-123 - Stijn De Saeger, Atsushi Shimojima:
Channeling Abstraction. 124-138 - Alexander Feldman, Gregory M. Provan, Arjan J. C. van Gemund:
Approximate Model-Based Diagnosis Using Greedy Stochastic Search. 139-154 - Ariel Felner, Nir Ofek:
Combining Perimeter Search and Pattern Database Abstractions. 155-168 - Igor Gammer, Eyal Amir:
Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic. 169-183 - Ian P. Gent, Ian Miguel, Andrea Rendl:
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion. 184-199 - Peter Gregory, Derek Long, Maria Fox:
A Meta-CSP Model for Optimal Planning. 200-214 - Timothy L. Hinrichs, Michael R. Genesereth:
Reformulation for Extensional Reasoning. 215-229 - Zina M. Ibrahim, Ahmed Y. Tawfik:
An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus. 230-242 - Ugur Kuter, Jiaqiao Hu:
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning. 243-257 - Nicholas K. Jong, Peter Stone:
Model-Based Exploration in Continuous State Spaces. 258-272 - Anders Jonsson, Andrew G. Barto:
Active Learning of Dynamic Bayesian Networks in Markov Decision Processes. 273-284 - Santiago Macho González, Pedro Meseguer:
Boosting MUS Extraction. 285-299 - Sriram Raghavan, Balaraman Ravindran:
Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage. 300-313 - Lorenza Saitta, Pietro Torasso, Gianluca Torta:
Formalizing the Abstraction Process in Model-Based Diagnosis. 314-328 - Peter Schachte, Harald Søndergaard:
Boolean Approximation Revisited. 329-343 - Nathan R. Sturtevant, M. Renee Jansen:
An Analysis of Map-Based Abstraction and Refinement. 344-358 - Pavel Surynek:
Solving Difficult SAT Instances Using Greedy Clique Decomposition. 359-374 - Lorenza Saitta, Jean-Daniel Zucker:
Abstraction and Complexity Measures. 375-390
Research Summaries
- Russ Abbott:
Abstraction, Emergence, and Thought. 391-392 - J. Christopher Beck, Michael Grüninger:
What's Your Problem? The Problem of Problem Definition. 393-394 - Hadrien Cambazard, Barry O'Sullivan:
A Reformulation-Based Approach to Explanation in Constraint Satisfaction. 395-396 - Broderick Crawford, Carlos Castro, Éric Monfroy:
Integration of Constraint Programming and Metaheuristics. 397-398 - David C. Haley:
Rule-Based Reasoning Via Abstraction. 399 - Timothy L. Hinrichs:
Extensional Reasoning. 400-401 - Martin Michalowski, Craig A. Knoblock, Berthe Y. Choueiry:
Reformulating Constraint Models Using Input Data. 402-404 - Marc Pickett:
Using Analogy Discovery to Create Abstractions. 405-406 - Miguel A. Salido:
Distributed CSPs: Why It Is Assumed a Variable per Agent? 407-408 - Eric Schkufza:
Decomposition of Games for Efficient Reasoning. 409-410 - Xuan-Ha Vu, Barry O'Sullivan:
Generalized Constraint Acquisition. 411-412 - Fan Yang, Joseph C. Culberson, Robert Holte:
Using Infeasibility to Improve Abstraction-Based Heuristics. 413-414 - Rong Zhou:
Leveraging Graph Locality Via Abstraction. 415-416
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-10-08 20:39 CEST 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:
