将时间约束引入逻辑编程，实现高效精确的时序规划。
Compiling Metric Temporal Answer Set Programming
- 用差分约束外置处理时间逻辑，避免精细化时间带来的计算膨胀
- 突破传统ASP在时间粒度上的瓶颈，支持毫秒级精度而不降速
- 适合需要严格时间约束的自动化调度与系统验证场景
我们提出一种计算方法，将度量答案集编程（Metric ASP）用于表达定量时间约束，如持续时间和截止期限。核心挑战在于细粒度时间约束会显著加剧ASP的展开瓶颈。为此，我们利用带有差分约束的ASP扩展形式，以简化线性约束来外部处理时间相关问题。该方法有效解耦了度量ASP与时间粒度的关系，使解决方案不受时间精度影响，从而在保持可扩展性的同时支持高精度时间建模。
原文摘要 · Abstract (English)
We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is unaffected by time precision.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。