Our goal here is to explore the interplay of constraints and planning, highlighting the differences between propositional satisfiability (SAT), integer programming (IP), and constraint programming (CP), and to discuss their potential in expressing and solving AI planning problems.
Constraints and AI Planning
GIUNCHIGLIA, ENRICO;
2005-01-01
Abstract
Our goal here is to explore the interplay of constraints and planning, highlighting the differences between propositional satisfiability (SAT), integer programming (IP), and constraint programming (CP), and to discuss their potential in expressing and solving AI planning problems.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
