抽象、重组与逼近/会议录 Abstraction, reformulation, and approximatio
点此进入淘宝搜索页搜索分类: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Sven Koenig著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 346印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540439417包装： 平装编辑推荐
The LNAI series reports state-of-the-art results in artificial intelligence re-search，development， and education， at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community， with numerous individuals， as well as with prestigious organizations and societies，LNAI has grown into the most comprehensive artificial intelligence research forum available.
The scope of LNAI spans the whole range of artificial intelligence and intelli-gent information processing including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on PhD work）.
内容简介
This book constitutes the refereed proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation, SARA 2002, held in Kananaskis, Alberta, Canada, in August 2002.The 15 revised full papers and 6 short papers were carefully reviewed and selected for inclusion in the book. Also included are 4 invited papers and 14 abstracts. All current aspects of abstraction, reformulation, and approximation in the context of human common-sense reasoning, problem solving, and efficiently reasoning in complex domains are addressed. Among the application fields of these techniques are automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving.
目录
Invited Presentations
Model Checking and Abstraction
Reformulaion in Planning
Spatiotemporal Abstraction of Stochastic Sequential Processes
State Spate Relaxation and Search Strategies in Dynamic Programming
Full 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
Author Index
