scientific article; zbMATH DE number 4185056

MaRDI QIDQ5750422zbMATH OpenFDO

Authors P. van Beek

Publication date 1989

zbMATH Keywords

approximation algorithmsinterval logic complexitytemporal reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30)

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

Cited in

(14)

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

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)