Sciweavers

2834 search results - page 154 / 567
» Representing Trees with Constraints
Sort
View
EMNLP
2008
13 years 12 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky
AAAI
1998
13 years 11 months ago
Qualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
Daniel J. Clancy, Benjamin Kuipers
AIPS
2000
13 years 11 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 10 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
FLAIRS
2008
14 years 22 days ago
Reasoning with Conditional Time-Intervals
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
Philippe Laborie, Jerome Rogerie