This paper introduces a novel algorithm called bdAC-3, designed to achieve binarized-domains Arc-Consistency (bdArc-Consistency) for Temporal Constraint Satisfaction Problems (TCSPs). The algorithm is an adaptation of Mackworth's AC-3 algorithm and aims to minimize binarized domains for TCSPs by ensuring arc-consistency. The research includes computational analysis of bdAC-3, demonstrating its polynomial time complexity for certain tasks and its effectiveness in filtering procedures for solution search algorithms. The paper also presents experimental comparisons of bdAC-3 with existing algorithms like ACSTP and discusses its application in TCSP-based job shop scheduling. AI
IMPACT Introduces a new algorithmic approach for temporal constraint satisfaction problems, potentially improving efficiency in related AI applications like scheduling.
RANK_REASON The cluster contains a research paper detailing a new algorithm for Temporal Constraint Satisfaction Problems. [lever_c_demoted from research: ic=1 ai=1.0]
- ACSTP
- bdAC-3
- bdArc-Consistency
- Dechter et al.
- Kong et al.
- Mackworth
- Schwalb and Dechter
- SWI-Prolog
- TCSPs
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
