A Multivalued logic model of planning

Authors:
M. Baioletti;A. Milani;V. Poggioni;S. Suriani
Affiliations:
Università degli Studi di Perugia, Italy, email: {baioletti,milani,poggioni,suriani}@dipmat.unipg.it;Università degli Studi di Perugia, Italy, email: {baioletti,milani,poggioni,suriani}@dipmat.unipg.it;Università degli Studi di Perugia, Italy, email: {baioletti,milani,poggioni,suriani}@dipmat.unipg.it;Università degli Studi di Perugia, Italy, email: {baioletti,milani,poggioni,suriani}@dipmat.unipg.it
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 5
Cited 2

Fast planning through planning graph analysis

Artificial Intelligence
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Multi-valued symbolic model-checking

ACM Transactions on Software Engineering and Methodology (TOSEM)
CAMA: A Multi-Valued Satisfiability Solver

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
The MathSAT 3 system

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Parallel Actions and Generalized Multivalued Constraints in Multivalued Planning

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
A multivalued planning model

International Journal of Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work a model for planning with multivalued fluents and graded actions, based on the infinite valued Lukasiewicz logic, is introduced. In multivalued planning, fluents can assume truth values in the interval [0, 1] and actions can be executed at different application degrees also varying in [0, 1]. The notions of planning problem and solution plan also reflect a multivalued approach. Multivalued fluents and graded actions allow to model many real situations where some features of the world cannot be modeled with boolean values and where actions can be executed with varying strength which produces graded effects as well. Even if most existing planning models fail to address this kind of domains, our model is comparable with models allowing flexible actions and soft constraints. A correct/complete algorithm which solves bounded multivalued planning problems based on MIP compilation is also described and a prototype implementation is presented.