default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. SARA 2000: Horseshoe Bay, Texas, USA
- Berthe Y. Choueiry, Toby Walsh:
Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings. Lecture Notes in Computer Science 1864, Springer 2000, ISBN 3-540-67839-5
Invited Talks
- Patrick Cousot:
Partial Completeness of Abstract Fixpoint Checking. 1-25 - Thomas G. Dietterich:
An Overview of MAXQ Hierarchical Reinforcement Learning. 26-44 - Richard E. Korf:
Recent Progress in the Design and Analysis of Admissible Heuristic Functions. 45-55
Tutorial
- Stefano Spaccapietra, Christine Parent, Christelle Vangenot:
GIS Databases: From Multiscale to MultiRepresentation. 57-70
Full Papers
- Stefano Bistarelli
, Philippe Codognet, Francesca Rossi:
An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation. 71-86 - Isabelle Bournaud, Mélanie Courtine, Jean-Daniel Zucker:
Abstractions for Knowledge Organization of Relational Descriptions. 87-106 - Carlos Carreras, Manuel V. Hermenegildo:
Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions. 107-123 - Rui Chen, Min Ouyang, Peter Z. Revesz:
Approximating Data in Constraint Databases. 124-143 - Rada Chirkova, Michael R. Genesereth:
Linearly Bounded Reformulations of Unary Databases. 144-163 - Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. 164-184 - Gordon S. Novak Jr.:
Interactions of Abstractions in Programming. 185-201 - Peter Z. Revesz:
Reformulation and Approximation in Model Checking. 202-218 - William T. B. Uther, Manuela M. Veloso:
The Lumberjack Algorithm for Learning Linked Decision Forests. 219-232 - Toby Walsh:
Reformulating Propositional Satisfiability as Constraint Satisfaction. 233-246
Extended Abstracts
- Eyal Amir, Sheila A. McIlraith:
Improving the Efficiency of Reasoning Through Structure-Based Reformulation. 247-259 - Marie desJardins, Lise Getoor, Daphne Koller:
Using Feature Hierarchies in Bayesian Network Learning. 260-270 - Jeremy Frank, Ari K. Jónsson, Paul H. Morris:
On Reformulating Planning as Dynamic Constraint Satisfaction. 271-280 - István T. Hernádvölgyi, Robert C. Holte:
Experiments with Automatically Created Memory-Based Heuristics. 281-290 - Lorenza Saitta, Jean-Daniel Zucker:
Abstraction and Phase Transitions in Relational Learning. 291-302
Posters
- Terrence P. Fries, James H. Graham:
An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis. 303-308 - T. K. Satish Kumar:
A Compositional Approach to Causality. 309-312 - Yoshiaki Okubo, Makoto Haraguchi, Yan Fang Zheng:
A Method for Finding Consistent Hypotheses Using Abstraction. 313-316
Research Summaries
- Thomas Ellman:
Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction. 317-319 - David Furcy:
Using and Learning Abstraction Hierarchies for Planning. 320-321 - Lise Getoor:
Learning Probabilistic Relational Models. 322-323 - T. K. Satish Kumar:
Synergy between Compositional Modeling and Bayesian Networks. 324-325 - Christophe Lecoutre, Sylvain Merchez, Frédéric Boussemart, Éric Grégoire:
A CSP Abstraction Framework. 326-327 - Chen Li:
Answering Queries with Database Restrictions. 328-329 - Gordon S. Novak Jr.:
Research Summary. 330-331
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-12-19 22:18 CET 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:
