Low-cost addition of preferences to DTPs and TCSPs

Authors:
Bart Peintner;Martha E. Pollack
Affiliations:
Computer Science and Engineering, University of Michigan, Ann Arbor, MI;Computer Science and Engineering, University of Michigan, Ann Arbor, MI
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 6
Cited 12

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Backtracking algorithms for disjunctions of temporal constraints

Artificial Intelligence
Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence
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
Dynamic control of plans with temporal uncertainty

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results

AI Communications - Constraint Programming for Planning and Scheduling
Fuzzy conditional temporal problems: Strong and weak consistency

Engineering Applications of Artificial 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
Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case

Journal of Artificial Intelligence Research
Applying local search to disjunctive temporal problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Disjunctive temporal planning with uncertainty

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Review:

The Knowledge Engineering Review
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”
Temporal Bayesian Knowledge Bases - Reasoning about uncertainty with temporal constraints

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and Their subclass Temporal Constraint Satisfaction Problems (TCSPs). Specifically, we describe an algorithm for checking the consistency of and finding optimal solutions to such probkms. The algorithm borrows concepts from previous algorithms for solving TCSPs and Simple Temporal Problems with Preferences (STPPs), in both cases using techniques for projecting and solving component sub-problems. We show that adding preferences to DTPs and TCSPs requires only slightly more time than corresponding algorithms for TCSPs and DTPs without preferences. Thus, for problems where DTPs and TCSPs make sense, adding preferences provides a substantial gain in expressiveness for a marginal cost.