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