scientific article; zbMATH DE number 4185056

zbMATH Open0718.68065MaRDI QIDQ5750422FDOQ5750422

P. van Beek

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Tractable approximations for temporal constraint handling
• Complexity and algorithms for reasoning about time
• scientific article; zbMATH DE number 1149417
• Temporal constraint networks
• Reasoning about qualitative temporal information

zbMATH Keywords

approximation algorithmstemporal reasoninginterval logic complexity

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cited In (12)

• A generalized time quantifier approach to approximate reasoning
• Efficient Temporal Satisfiability
• From local to global consistency
• Reasoning about qualitative temporal information
• Temporal representation and reasoning in artificial intelligence: A review
• Complexity and algorithms for reasoning about time
• On redundant topological constraints
• Robust Approximation of Temporal CSP
• The complexity of finding temporal separators under waiting time constraints
• Parameterised temporal exploration problems
• An initial study of time complexity in infinite-domain constraint satisfaction
• An Algebraic Approach to Time-Span Reduction

This page was built for publication:

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