Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Article type: Research Article
Authors: Maratea, Marco; | Pulina, Luca
Affiliations: DIBRIS, University of Genova, Genova, Italy. E-mail: marco@dist.unige.it | POLCOMING, University of Sassari, Sassari, Italy. E-mail: lpulina@uniss.it
Note: [] Corresponding author: Marco Maratea, DIBRIS, University of Genova, Viale F. Causa 15, Genova, Italy. E-mail: marco@dist.unige.it.
Abstract: 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. In this paper we consider an utilitarian aggregation of DTP constraints weights, and a prominent semantic for aggregating such weights from its difference constraints weights that considers the maximum among the weights associated to satisfied difference constraints in it. We present a novel approach that reduces the problem to Maximum Satisfiability of DTPs (Max-DTPs). In this way, we can employ off-the-shelf Max-DTP solvers with different solution methods, ranging from Satisfiability Modulo Theories (SMT), to interval-based and Boolean optimization-based solvers. We then compare the performance of our approach with different back-end solvers on both randomly generated and real-world benchmarks, in comparison with MAXILITIS, the best solver that can deal with DTPs with preferences using the aggregation methods considered. Results show that the YICES SMT solver is the best, and that YICES and the TSAT# solver based on Boolean optimization can be orders of magnitude faster than MAXILITIS.
Keywords: Disjunctive temporal problems, optimization
DOI: 10.3233/AIC-2012-0527
Journal: AI Communications, vol. 25, no. 2, pp. 137-156, 2012
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl