Abstraction, Reformulation and Approximation: 6th by Scot Anderson, Peter Revesz (auth.), Jean-Daniel Zucker,

By Scot Anderson, Peter Revesz (auth.), Jean-Daniel Zucker, Lorenza Saitta (eds.)

This e-book constitutes the refereed lawsuits of the sixth foreign Symposium on Abstraction, Reformulation, and Approximation, SARA 2005, held in Airth citadel, Scotland, united kingdom in July 2005.

The 17 revised complete papers and eight prolonged abstracts have been conscientiously reviewed and chosen for inclusion within the e-book. additionally incorporated are three invited papers and eight learn summaries. All present elements of abstraction, reformulation, and approximation within the context of human commonsense reasoning, challenge fixing, and successfully reasoning in advanced domain names are addressed. one of the program fields of those recommendations are computerized programming, constraint delight, layout, prognosis, laptop studying, seek, making plans, reasoning, video game taking part in, scheduling, and theorem proving.

Show description

Read or Download Abstraction, Reformulation and Approximation: 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005. Proceedings PDF

Best computers books

Fire in the Valley: The Birth and Death of the Personal Computer

Within the Seventies, whereas their contemporaries have been protesting the pc as a device of dehumanization and oppression, a motley choice of university dropouts, hippies, and electronics enthusiasts have been engaged in anything even more subversive. captivated with the belief of having laptop strength into their very own palms, they introduced from their garages a hobbyist stream that grew into an undefined, and finally a social and technological revolution.

STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006. Proceedings

This booklet constitutes the refereed court cases of the twenty third Annual Symposium on Theoretical elements of computing device technology, STACS 2006, held in Marseille, France, in February 2006. The fifty four revised complete papers awarded including 3 invited papers have been rigorously reviewed and chosen from 283 submissions.

Compel (Vol. 23, 2004): Special Issue

Exact factor: chosen papers from PMAPS 2002 -Conference on Probabilistic tools utilized to energy platforms, Naples 2002

Extra info for Abstraction, Reformulation and Approximation: 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005. Proceedings

Example text

4. E. Fink and Q. Yang. Automatically abstracting the effects of operators. In James Hendler, editor, Proceedings of the 1st International Conference on Artificial Intelligence Planning Systems (AIPS92), pages 243–251, College Park, Maryland, USA, 1992. Morgan Kaufmann. 5. F. Giunchiglia, A. Villafiorita, and T. Walsh. Theories of abstraction. Artificial Intelligence Communications, 10(3-4):167–176, 1997. 6. L. Karlsson. Conditional progressive planning under uncertainty. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pages 431–438, 2001.

As demonstrated in [9], a total order relation between increasing sets of goals allows incremental planning by focusing search on the goals that appear earlier, leading to improved planning performances. To solve problems involving multiple domains, one can envisage to solve in each domain the portion of the problem related to it and then glue all the results in a global plan, but doing so might result in degraded execution of the overall plan, because of the localized reasoning. Our work on plan execution on board mobile robots has motivated us to find a general approach that can utilize reasoning over different domains using different planners for problem solving so the resulting plan would execute smoothly and efficiently.

The partitioning of the initial planning problem focuses on producing subproblems with minimum interaction in order to be able to find an efficient solution. It is worth noting that problem partitioning is generally combined with abstraction techniques to control the interaction between the different sub-components of the planning problem [10],[11]. This work has been supported by the Swedish KK foundation and the Swedish research council. -D. Zucker and L. ): SARA 2005, LNAI 3607, pp. 30–43, 2005.

Download PDF sample

Rated 4.27 of 5 – based on 7 votes

Related posts