SARA 2009
Main Page
Invited Speakers
Conference Schedule
Presenter Information
Call for Papers (txt) (pdf)
Paper Submission Site
Program Committee
Accepted Papers
Travel & Lodging

Co-Located Conferences

Past SARA Conferences
2007 - Whistler, B.C.
2005 - Airth Castle, Scotland
2002 - Alberta, Canada
2000 - Horseshoe Bay, Texas
1998 - Pacific Grove, California
1995 - Québec, Canada.
1994 - Jackson Hole, Wyoming

SARA 2009: The Eighth Symposium on Abstraction, Reformulation and Approximation

SARA 2009 Accepted Papers

Cluster Graphs as Abstractions for Constraint Satisfaction Problems
 Susan Epstein and Xingjian Li.
Modelling Equidistant Frequency Permutation Arrays in Constraints
Ian Gent, Paul McKay, Ian Miguel, Peter Nightingale and Sophie Huczynska.
Rewriting Constraint Models with Metamodels
Raphael Chenouard, Laurent Granvilliers and Ricardo Soto.
Abstraction-Based Heuristics with True Distance Computations
Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer.
Abstract Planning with Unknown Object Quantities and Properties
Siddharth Srivastava, Neil Immerman and Shlomo Zilberstein.
Abductive Problem Solving with Abstractions
Gianluca Torta and Daniele Theseider Dupré.
Reformulating Planning Problems by Eliminating Unpromising Actions
Lukas Chrpa and Roman Barták.
A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis
Rui Abreu and Arjan J.C. van Gemund.
Abstracting Complex Interaction Networks
Lorenza Saitta, Corneliu Henegar and Jean-daniel Zucker.
Automated Redesign with the General Redesign Engine
Alexander Feldman, Gregory Provan, Johan de Kleer, Lukas Kuhn and Arjan van Gemund.
Ontology-Based Link Prediction in the LiveJournal Social Network
Doina Caragea, Vikas Bahirwani, Waleed Aljandal and William Hsu.
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
Miroslav Velev and Ping Gao.
2-C3: From Arc-Consistency to 2-Consistency
Marlene Arangu, Miguel A. Salido and Federico Barber.
Downward Path Preserving State Space Abstractions
Sandra Zilles and Robert Holte.
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints
Anbulagan A. and Alban Grastien.
Some Interval Approximation Techniques for MINLP
Nicolas Berger and Laurent Granvilliers.
Light Algorithms for Maintaining Max-RPC During Search
Julien Vion and Romuald Debruyne.
Common Subexpressions in Constraint Models of Planning Problems
Andrea Rendl, Ian Miguel, Ian Gent and Peter Gregory.
In search of a better method to break row and column symmetries
Andrew Grayland, Ian Miguel and Colva Roney-Dougal.
Confluence of reduction rules for lexicographic ordering constraints
Andrew Grayland, Ian Miguel and Colva Roney-Dougal.
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances
Philippe Jégou and Lionel Paris.
Automatically Enhancing Constraint Model Instances during Tailoring
Andrea Rendl, Ian Miguel, Ian Gent and Chris Jefferson.
Integrating Constraint Models for Sequential and Partial-Order Planning
Roman Barták and Daniel Toropila.
Computationally Efficient Tiered Inference for Multiple Fault Diagnosis
Juan Liu, Lukas Kuhn and Johan de Kleer.
Inconsistency-tolerant Reasoning with Classical Logic and Large Databases
Timothy Hinrichs, Jui-Yi Kao and Michael Genesereth.
Nested NL Representation for OO Analysis and Design
Magda Ilieva.
A Practical Use of Imperfect Recall
Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein and Michael Bowling.
Efficient Operations on the Octagon Abstract Domain with Integers
Peter Revesz.