Skip to main content
SpringerLink
Log in
Book cover

Abstraction, Reformulation, and Approximation

4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Berthe Y. Choueiry

    1. Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Toby Walsh

    1. Department of Computer Science, University of York, Heslington, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1864)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Tutorial

    1. GIS Databases: From Multiscale to MultiRepresentation

      • Stefano Spaccapietra, Christine Parent, Christelle Vangenot
      Pages 57-70

  4. Full Papers

    1. An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation

      • Stefano Bistarelli, Philippe Codognet, Francesca Rossi
      Pages 71-86

    2. Abstractions for Knowledge Organization of Relational Descriptions

      • Isabelle Bournaud, Mélanie Courtine, Jean-Daniel Zucker
      Pages 87-106

    3. Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions

      • Carlos Carreras, Manuel V. Hermenegildo
      Pages 107-123

    4. Approximating Data in Constraint Databases

      • Rui Chen, Min Ouyang, Peter Z. Revesz
      Pages 124-143

    5. Linearly Bounded Reformulations of Unary Databases

      • Rada Chirkova, Michael R. Genesereth
      Pages 144-163

    6. A CSP Abstraction Framework

      • Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Eric Grégoire
      Pages 164-184

    7. Interactions of Abstractions in Programming

      • Gordon S. Novak Jr.
      Pages 185-201

    8. Reformulation and Approximation in Model Checking

      • Peter Z. Revesz
      Pages 202-218

    9. The Lumberjack Algorithm for Learning Linked Decision Forests

      • William T. B. Uther, Manuela M. Veloso
      Pages 219-232

    10. Reformulating Propositional Satisfiability as Constraint Satisfaction

      • Toby Walsh
      Pages 233-246

  5. Extended Abstracts

    1. Improving the Efficiency of Reasoning Through Structure-Based Reformulation

      • Eyal Amir, Sheila McIlraith
      Pages 247-259

    2. Using Feature Hierarchies in Bayesian Network Learning

      • Marie desJardins, Lise Getoor, Daphne Koller
      Pages 260-270

    3. On Reformulating Planning as Dynamic Constraint Satisfaction

      • Jeremy Frank, Ari K. Jónsson, Paul Morris
      Pages 271-280

    4. Experiments with Automatically Created Memory-Based Heuristics

      • István T. Hernádvölgyi, Robert C. Holte
      Pages 281-290

    5. Abstraction and Phase Transitions in Relational Learning

      • Lorenza Saitta, Jean-Daniel Zucker
      Pages 291-301
Back to top

Keywords

About this book

This volume contains the proceedings of SARA 2000, the fourth Symposium on Abstraction, Reformulations, and Approximation (SARA). The conference was held at Horseshoe Bay Resort and Conference Club, Lake LBJ, Texas, July 26– 29, 2000, just prior to the AAAI 2000 conference in Austin. Previous SARA conferences took place at Jackson Hole in Wyoming (1994), Ville d’Est´erel in Qu´ebec (1995), and Asilomar in California (1998). The symposium grewout of a series of workshops on abstraction, approximation, and reformulation that had taken place alongside AAAI since 1989. This year’s symposium was actually scheduled to take place at Lago Vista Clubs & Resort on Lake Travis but, due to the resort’s failure to pay taxes, the conference had to be moved late in the day. This mischance engendered eleventh-hour reformulations, abstractions, and resource re-allocations of its own. Such are the perils of organizing a conference. This is the ?rst SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a re?ection of the increased maturity of the ?eld and that the increased visibility brought by the publication of this volume will help the discipline grow even further. Abstractions, reformulations, and approximations (AR&A) have found - plications in a variety of disciplines and problems including automatic progr- ming, constraint satisfaction, design, diagnosis, machine learning, planning, qu- itative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains.

Editors and Affiliations

  • Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln

    Berthe Y. Choueiry

  • Department of Computer Science, University of York, Heslington, UK

    Toby Walsh

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation