Temporal constraint networks

DOI10.1016/0004-3702(91)90006-6zbMath0737.68070OpenAlexW2130182605MaRDI QIDQ1182161

Rina Dechter, Judea Pearl, Itay Meiri

Publication date: 28 June 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(91)90006-6

zbMATH Keywords

decomposition temporal reasoning Floyd-Warshall all pairs- shortest paths algorithm path consistency algorithm temporal constraint satisfaction problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (only showing first 100 items - show all)

Formal semantics for interactive music scores: a framework to design, specify properties and execute interactive scenarios ⋮ Temporal Reasoning in Nested Temporal Networks with Alternatives ⋮ Using Satisfiability for Non-optimal Temporal Planning ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ From points to intervals ⋮ MODELING THE REPRESENTATION OF TIME FROM A FUZZY PERSPECTIVE ⋮ Admissible generalisation of temporal sequences as chronicles ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Reducing the number of disjuncts in DTPs ⋮ A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Early detection of temporal constraint violations ⋮ Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) ⋮ Dynamic controllability of temporal networks with instantaneous reaction ⋮ CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL ⋮ Step by step – Building representations in algebraic logic ⋮ The school bus routing and scheduling problem with transfers ⋮ Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility ⋮ Mining Significant Temporal Networks Is Polynomial ⋮ An interval-based temporal algebra based on binary encoding of point relations ⋮ Temporal agent programs ⋮ From binary temporal relations to non-binary ones and back ⋮ Temporal representation and reasoning in artificial intelligence: A review ⋮ Uncertantty in temporal representation and reasoning ⋮ Fuzzy temporal constraint logic: A valid resolution principle ⋮ Iterative Flattening Search on RCPSP/max Problems: Recent Developments ⋮ Handling contingency in temporal constraint networks: from consistency to controllabilities ⋮ Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier ⋮ Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking ⋮ Forward Chaining Hierarchical Partial-Order Planning ⋮ GSM+T: A Timed Artifact-Centric Process Model. ⋮ An intensional approach to qualitative and quantitative periodicity-dependent temporal constraints ⋮ Inequality-sum: a global constraint capturing the objective function ⋮ Safe Multi-Agent Pathfinding with Time Uncertainty ⋮ Satisfying constraint sets through convex envelopes ⋮ On point-duration networks for temporal reasoning ⋮ Solving multi-granularity temporal constraint networks ⋮ Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way ⋮ On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning ⋮ IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ Time representation: A taxonomy of temporal models ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Extending uncertainty formalisms to linear constraints and other complex formalisms ⋮ Principles for the design of large neighborhood search ⋮ Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm ⋮ Dynamic controllability via timed game automata ⋮ Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification ⋮ The dial-A-ride problem with transfers ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ Temporal reasoning about fuzzy intervals ⋮ Modelling and solving temporal reasoning as propositional satisfiability ⋮ The complexity of query evaluation in indefinite temporal constraint databases ⋮ Relation algebras of intervals ⋮ Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks ⋮ Temporally and spatially flexible plan execution for dynamic hybrid systems ⋮ A spatio-temporal framework for managing archaeological data ⋮ Supporting dispatchability in schedules with consumable resources ⋮ Diagnosing time-varying misbehavior: An approach based on model decomposition ⋮ Planning parallel actions ⋮ Optimal rectangle packing ⋮ Discovering implied constraints in precedence graphs with alternatives ⋮ From local to global consistency in temporal constraint networks ⋮ Local and global relational consistency ⋮ Combining qualitative and quantitative constraints in temporal reasoning ⋮ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ On tree-preserving constraints ⋮ Processing disjunctions in temporal constraint networks ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ An event-based fragment of first-order logic over intervals ⋮ A global constraint for total weighted completion time for unary resources ⋮ Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm ⋮ Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games ⋮ Implementation of the temporal reasoning mechanism in modern intelligent systems ⋮ Cost-based temporal reasoning ⋮ On the modelling and optimization of preferences in constraint-based temporal reasoning ⋮ Explaining the \texttt{cumulative} propagator ⋮ A min-flow algorithm for minimal critical set detection in resource constrained project scheduling ⋮ The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ Tractable approximations for temporal constraint handling ⋮ A zero-space algorithm for negative cost cycle detection in networks ⋮ Queries on ontologies with temporal dependences on Allen's extended interval logic ⋮ Handling fuzzy temporal constraints in a planning environment ⋮ Strong temporal planning with uncontrollable durations ⋮ Planning temporal events using point-interval logic ⋮ Group planning with time constraints ⋮ A polynomial time algorithm for Zero-Clairvoyant scheduling ⋮ A fuzzy constraint satisfaction approach for signal abstraction ⋮ Reasoning about qualitative temporal information ⋮ A mechanical verification of the stressing algorithm for negative cost cycle detection in networks ⋮ Continuous management of airlift and tanker resources: a constraint-based approach ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ Stochastic task networks -- trading performance for stability ⋮ Rescheduling railway traffic on real time situations using time-interval variables ⋮ Dynamic temporal decoupling ⋮ Flexibility and decoupling in simple temporal networks ⋮ Linear time-dependent constraints programming with MSVL

Cites Work

This page was built for publication: Temporal constraint networks