Constraint propagation with interval labels
Artificial Intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Artificial Intelligence - Special issue on knowledge representation
Backtracking algorithms for disjunctions of temporal constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Backtracking algorithms for disjunctions of temporal constraints
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Deciding Separation Formulas with SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
SAT-Based Procedures for Temporal Reasoning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
Exploiting Cycle Structures in Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Low-cost addition of preferences to DTPs and TCSPs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CMRadar: a personal assistant agent for calendar management
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Temporal preference optimization as weighted constraint satisfaction
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Any time, complete algorithm for finding utilitarian optimal solutions to STPPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Within-problem learning for efficient lower bound computation in Max-SAT solving
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Exploiting inference rules to compute lower bounds for MAX-SAT solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Tractable Pareto optimization of temporal preferences
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
TSAT++: an Open Platform for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Project Scheduling as a Disjunctive Temporal Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On the modelling and optimization of preferences in constraint-based temporal reasoning
Artificial Intelligence
PTIME: Personalized assistance for calendaring
ACM Transactions on Intelligent Systems and Technology (TIST)
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Hi-index | 0.00 |
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.