Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada August 2 4, 2002 : proceedings
It has been recognized since the inception of Artificial Intelligence (AI) that abstractions, problem reformulations, and approximations (AR&A) are central to human common sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains. AR&A techniq...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science. Lecture notes in artificial intelligence
2371 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Abstraction, reformulation, and approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings, Sven Koenig, Robert C. Holte (eds.), Berlin, Springer, 2002, 1 vol. (XI-346 p.), Lecture notes in computer science, 3-540-43941-2 • Abstraction, Reformulation, and Approximation, Texte imprimé, 9783662193082 |
Sommario:
- Invited Presentations
- Model Checking and Abstraction
- Reformulation in Planning
- Spatiotemporal Abstraction of Stochastic Sequential Processes
- State Space Relaxation and Search Strategies in Dynamic Programming
- Invited Presentations
- Admissible Moves in Two-Player Games
- Dynamic Bundling: Less Effort for More Solutions
- Symbolic Heuristic Search Using Decision Diagrams
- On the Construction of Human-Automation Interfaces by Formal Abstraction
- Pareto Optimization of Temporal Decisions
- An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection
- A Tractable Query Cache by Approximation
- An Algebraic Framework for Abstract Model Checking
- Action Timing Discretization with Iterative-Refinement
- Formalizing Approximate Objects and Theories: Some Initial Results
- Model Minimization in Hierarchical Reinforcement Learning
- Learning Options in Reinforcement Learning
- Approximation Techniques for Non-linear Problems with Continuum of Solutions
- Approximation of Relations by Propositional Formulas: Complexity and Semantics
- Abstracting Visual Percepts to Learn Concepts
- Short Presentations
- PAC Meditation on Boolean Formulas
- On the Reformulation of Vehicle Routing Problems and Scheduling Problems
- The Oracular Constraints Method
- Performance of Lookahead Control Policies in the Face of Abstractions and Approximations
- TTree: Tree-Based State Generalization with Temporally Abstract Actions
- Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction
- Research Summaries
- Abstracting Imperfect Information Game Trees
- Using Abstraction for Heuristic Search and Planning
- Approximation Techniques in Multiagent Learning
- Abstraction and Reformulation in GraphPlan
- Abstract Reasoning for Planning and Coordination
- Research Summary: Abstraction Techniques, and Their Value
- Reformulation of Non-binary Constraints
- Reformulating Combinatorial Optimization as Constraint Satisfaction
- Autonomous Discovery of Abstractions through Interaction with an Environment
- Interface Verification: Discrete Abstractions of Hybrid Systems
- Learning Semi-lattice Codebooks for Image Compression
- Research Summary
- Principled Exploitation of Heuristic Information
- Reformulation of Temporal Constraint Networks.