Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

DOI10.1007/978-3-540-74970-7_23zbMath1145.68515OpenAlexW2146497100MaRDI QIDQ3523065

Alfonso E. Gerevini, Alessandro Saetti

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_23

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure

Cites Work

• Unnamed Item
• Unnamed Item
• Reasoning about qualitative temporal information
• A comparison of point-based approaches to qualitative temporal reasoning
• Efficient algorithms for qualitative reasoning about time
• Complexity and algorithms for reasoning about time

This page was built for publication: Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure