Recently, several researchers have demonstrated domains where partially-ordered planners outperform totally-ordered planners. In (Barrett & Weld 1994), Barrett and Weld build a series of arti cial domains exploring the concepts of trivial and laborious serializability, in which a partially-ordered planner, snlp, consistently outperforms two totally-ordered planners. In this paper, we demonstrat...

introduction: lack of coordination between academic education and their application in the workplace is a common gap between theory and practice. this issue of concern has been discussed among planners of medical education. in this study, the attitude of medical students, externs and interns, was evaluated about the clinical applications of bacteriology. methods: one hundred and fifty four medi...

By implementing agents and environments using a domain-independent, extensible simulation substrate, described in this paper, agents will have clean interfaces to their environments. These makes it easier for agents to be plugged into other environments that have been similarly defined. If agents can interact with multiple environments, their behaviors and the associated experimental results wi...

When the Aswan Dam was planned, there was recorded as well as tacit knowledge about its unwanted side effects, such as the spread of schistosomiasis and diminished soil fertility. The fact that Egyptian’ experts now regard its benefits to greatly outweigh the costs and disutilities does not excuse lack of better planning. The knowledge may not have been retrieved and brought to bear at the righ...

transfer problem-solving experience from previous tasks into the new task. Recently, the artificial intelligence community has attempted to model this transfer in an effort to improve learning on new tasks by using knowledge from related tasks. For example, classification and inference algorithms have been extended to support transfer of conceptual knowledge (for a survey see Torrey and Shavlik...

Planning with SAT has long been viewed as a main approach to AI planning. In comparison to other approaches, its high memory requirements have been considered to be a main obstacle to its scalability to large planning problems. Better implementation technology, especially addressing the memory use, together with a shift of understanding about SAT-based planning during the past ten years, enable...

Existing plan synthesis approaches in artiicial intelligence fall into two categories { domain independent and domain dependent. The domain independent approaches are applicable across a variety of domains, but may not be very eecient in any one given domain. The domain dependent approaches need to be (re)designed for each domain separately, but can be very eecient in the domain for which they ...

Introduction. State-of-the-art robotic systems [1, 2, 3] increasingly rely on search-based planning or optimal control methods to guide decision making. Similar observations can be made about computer game engines. Such methods are nearly always extremely crude approximations to the reality encountered by the robot: they consider a simplified model of the robot (as a point, or a “flying brick”)...

Axioms can be used to model derived predicates in domainindependent planning models. Formulating models which use axioms can sometimes result in problems with much smaller search spaces and shorter plans than the original model. Previous work on axiom-aware planners focused solely on statespace search planners. We propose axiom-aware planners based on answer set programming and integer prorammi...