Dynamic CSPs for interval-based temporal reasoning

DOI10.1007/3-540-48035-8_56MaRDI QIDQ3047797zbMATH OpenFDO

Authors Malek Mouhoub, Jonathan Yip

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2358/23580575.htm

zbMATH Keywords

Dynamic Arc ConsistencyPlanningSchedulingTemporal Reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Computing methodologies and applications (68U99)

Recommendations

• Reasoning with numeric and symbolic time information
• Temporal constraint networks
• scientific article; zbMATH DE number 1234563
• Maintaining global consistency of temporal constraints in a dynamic environment

Cited in

(6)

• A path-consistent singleton modeling (CSM) algorithm for arc-constrained networks
• Dynamic branching in qualitative constraint-based reasoning via counting local models
• Robust Approximation of Temporal CSP
• Maintaining global consistency of temporal constraints in a dynamic environment
• Constraint retraction for dynamic constraint satisfaction problems over disjoint real intervals
• scientific article; zbMATH DE number 2202276 (Why is no real title available?)

This page was built for publication: Dynamic CSPs for interval-based temporal reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3047797)