8. SARA 2009: Lake Arrowhead, California, USA

Frontmatter

• SARA2009 Organization.
  
• Preface.
  

Long Papers

• Rui Abreu, Arjan J. C. van Gemund:
  A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis.
  
• Anbulagan, Alban Grastien:
  Importance of Variables Semantic in CNF Encoding of Cardinality Constraints.
  
• Roman Barták, Daniel Toropila:
  Integrating Constraint Models for Sequential and Partial-Order Planning.
  
• Nicolas Berger, Laurent Granvilliers:
  Some Interval Approximation Techniques for MINLP.
  
• Doina Caragea, Vikas Bahirwani, Waleed Aljandal, William H. Hsu:
  Ontology-Based Link Prediction in the LiveJournal Social Network.
  
• Raphaël Chenouard, Laurent Granvilliers, Ricardo Soto:
  Rewriting Constraint Models with Metamodels.
  
• Lukás Chrpa, Roman Barták:
  Reformulating Planning Problems by Eliminating Unpromising Actions.
  
• Susan L. Epstein, Xingjian Li:
  Cluster Graphs as Abstractions for Constraint Satisfaction Problems.
  
• Alexander Feldman, Gregory M. Provan, Johan de Kleer, Lukas Kuhn, Arjan J. C. van Gemund:
  Automated Redesign with the General Redesign Engine.
  
• Ariel Felner, Nathan R. Sturtevant:
  Abstraction-Based Heuristics with True Distance Computations.
  
• Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightingale, Sophie Huczynska:
  Modelling Equidistant Frequency Permutation Arrays in Constraints.
  
• Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
  Confluence of Reduction Rules for Lexicographic Ordering Constraints.
  
• Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
  In Search of a Better Method to Break Row and Column Symmetries.
  
• Timothy L. Hinrichs, Jui-Yi Kao, Michael R. Genesereth:
  Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases.
  
• Philippe Jégou, Lionel Paris:
  A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances.
  
• Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher Jefferson:
  Automatically Enhancing Constraint Model Instances during Tailoring.
  
• Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Gregory:
  Common Subexpressions in Constraint Models of Planning Problems.
  
• Peter Z. Revesz:
  Tightened Transitive Closure of Integer Addition Constraints.
  
• Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
  Abstract Planning with Unknown Object Quantities and Properties.
  
• Gianluca Torta, Daniele Theseider Dupré:
  Abductive Problem Solving with Abstractions.
  
• Miroslav N. Velev, Ping Gao:
  Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles.
  
• Julien Vion, Romuald Debruyne:
  Light Algorithms for Maintaining Max-RPC During Search.
  
• Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, Michael H. Bowling:
  A Practical Use of Imperfect Recall.
  

Short Papers

• Marlene Arangú, Miguel A. Salido, Federico Barber:
  2-C3: From Arc-Consistency to 2-Consistency.
  
• Lorenza Saitta, Corneliu Henegar, Jean-Daniel Zucker:
  Abstracting Complex Interaction Networks.
  
• Sandra Zilles, Robert C. Holte:
  Downward Path Preserving State Space Abstractions (Extended Abstract).
  

Last update Fri May 25 08:35:16 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page