Artificial Intelligence - Special issue on knowledge representation
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
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
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
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
Algorithms for constraint-based temporal reasoning with preferences
Algorithms for constraint-based temporal reasoning with preferences
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
Any time, complete algorithm for finding utilitarian optimal solutions to STPPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Augmenting disjunctive temporal problems with finite-domain constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Tractable Pareto optimization of temporal preferences
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SMT-COMP: satisfiability modulo theories competition
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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)
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Managing dynamic CSPs with preferences
Applied Intelligence
Hi-index | 0.01 |
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system achieves temporal preference optimization using a SAT formulation, with its creators attributing its performance to advances in SAT solving techniques. We depart from the SAT encoding and instead introduce the Valued DTP (VDTP). In contrast to the traditional semiring-based formalism that annotates legal tuples of a constraint with preferences, our framework instead assigns elementary costs to the constraints themselves. After proving that the VDTP can express the same set of utilitarian optimal solutions as the DTPP with piecewise-constant preference functions, we develop a method for achieving weighted constraint satisfaction within a meta-CSP search space that has traditionally been used to solve DTPs without preferences. This allows us to directly incorporate several powerful techniques developed in previous decision-based DTP literature. Finally, we present empirical results demonstrating that an implementation of our approach consistently outperforms the SAT-based solver by orders of magnitude.