Publication:3493325
From MaRDI portal
zbMath0709.68101MaRDI QIDQ3493325
Judea Pearl, Rina Dechter, Itay Meiri
Publication date: 1989
scheduling; parallel computations; temporal constraints; program verification; satisfaction problems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
68N01: General topics in the theory of software
Related Items
Managing concurrency in temporal planning using planner-scheduler interaction, The SAT-based approach to separation logic, Scheduling with neural networks -- the case of the Hubble Space Telescope, A uniform representation for time and space and their mutual constraints, Backtracking algorithms for disjunctions of temporal constraints, Querying temporal and spatial constraint networks in PTIME, Argumentation frameworks as constraint satisfaction problems, The octagon abstract domain for continuous constraints