CPP: a constraint logic programming based planner with preferences

TL;DR: A semantics for the first-order preference language in the situation calculus is provided, and it is proved that progression of the authors' preference formulae preserves this semantics, which leads to the development of PPlan, a bounded best-first search planner that computes preferred plans.

TL;DR: The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of ℬ, using Constraint Logic Programming over Finite Domains, and generalized to raise the use of constraints to the level of the action language itself.

TL;DR: The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains, and is generalized to lift the use of constraints to the level of the action language itself.

TL;DR: P4Solver is developed, an SMT-based planner computing the preferred plan by reducing the problem to quadratic programming problem, which can be solved using SMT solvers such as Z3.

TL;DR: In this article, a class of logic programming languages, called CLP languages, are defined, all of which share the same essential semantic properties and are based on a unified formal semantics.

Abstract: Publisher Summary This chapter focuses on logic programming, which is closely related to PROLOG. Logic programming constitutes the theoretical framework of PROLOG. This close connection led to the adoption of logic programming as the basis for the influential Japanese Fifth Generation Project. The power of logic programming stems from two reasons. First, it is an extremely simple formalism. It also relies on mathematical logic, which developed its own methods and techniques and which provides a rigorous mathematical framework. The chapter presents a self-contained introduction to the theory of logic programming. It also discusses the causal dependence between various concepts and notions and presents the notion of SLD-resolution, which is central to the subject of logic programming.

TL;DR: This chapter presents a self-contained introduction to the theory of logic programming, which discusses the causal dependence between various concepts and notions and presents the notion of SLD-resolution, which is central to the subject of logic Programming.

TL;DR: This survey of CLP is to give a systematic description of the major trends in terms of common fundamental concepts and the three main parts cover the theory, implementation issues, and programming for applications.