Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

Planning research in Artificial Intelligence (AI) has often focused on problems where there
are cascading levels of action choice and complex interactions between actions. In contrast …

In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal
planning problems and its implementation in the SGPlan4 planner. Based on the strong …

This paper studies novel subgoaling relaxations for automated planning with propositional
and numeric state variables. Subgoaling relaxations address one source of complexity of the …

The TM-LPSAT planner can construct plans in domains containing atomic actions and
durative actions; events and processes; discrete, real-valued, and interval-valued fluents; …

Many real world planning problems require goals with deadlines and durative actions that
consume resources. In this paper, we present Sapa, a domain-independent heuristic …

The timeline-based approach to planning represents an effective alternative to classical
planning for complex domains requiring the use of both temporal reasoning and scheduling …

Although the use of metric fluents is fundamental to many practical planning problems, the
study of heuristics to support fully automated planners working with these fluents remains …

Wide-area network applications are increasingly being built using component-based
models, which enable integration of diverse functionality in modules distributed across the …

Component-based approaches are becoming increasingly popular in the areas of adaptive
distributed systems, Web services, and grid computing. In each case, the underlying …