![]() ![]() ![]() We prove that, even with individual modules being polytime solvable, the framework is expressive enough to capture all of NP, a property which does not hold without loop. We study the expressive power of our framework and demonstrate that adding the feedback operator increases the expressive power considerably. Look at the state of the world: Is it the goal state If so, the list of operators so far is the plan to be applied. Prolog unification data and continuation functions always have dynamic extent. If that continuation fails control may return to any previous choice point, undoing any intervening unifications, and trying a different solution choice. In particular, we use a model-theoretic setting and introduce a feedback (loop) operator on modules. Computation in Prolog works by attempting to satisfy a clause and, if successful, calling a continuation function. GitHub - DrLux/BlocksworldProlog: Implementation of Block World in Prolog. We start our development from a previous work,, but modify and extend that framework significantly. ![]() We develop a modular framework where parts of a modular system can be written in different languages. Motivated by the need to combine systems and logics, we develop a modular approach to the model expansion (MX) problem, a task which is common in applications such as planning, scheduling, computational biology, formal verification. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |