Maratea, Marco and Pulina, Luca (2012) Solving disjunctive temporal problems with preferences using maximum satisfiability. AI Communications, Vol. 25 (2), p. 137-156. eISSN 1875-8452. Article.
Full text not available from this repository.
The Disjunctive Temporal Problem (DTP) involves conjunction of DTP constraints, each DTP constraint being a disjunction of difference constraints of the form x−y≤c, where x and y range over a domain of interpretation, and c is a numeric constant. The DTP is recognized to be an expressive framework for constraints modeling and processing. The addition of preferences, in the form of weights associated to difference constraints for their satisfaction, needs methods for aggregating preferences among and within DTP constraints to compute meaningful and high quality solutions, while further enhancing DTP expressivity and applicability.
I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore
Repository Staff Only: item control page