让程序能精确处理时间约束，且不因时间精度提高而变慢
Implementing Metric Temporal Answer Set Programming
- 用差分约束外置处理时间问题，避免传统方法的计算瓶颈
- 在高精度时间约束下仍保持高效，不受时间粒度影响
- 适合需要严格时间控制的自动化系统设计
我们提出一种计算方法，用于实现带时间量化的答案集编程（Metric ASP），以表达持续时间、截止时间等定量时间约束。核心挑战在于细粒度时间约束会显著加剧ASP的预处理瓶颈。为此，我们利用带有差分约束的ASP扩展，这是一种简化的线性约束形式，将时间相关逻辑外部化处理。该方法有效解耦了度量ASP与时间粒度之间的关系，使得整体求解性能不受时间精度影响。
原文摘要 · Abstract (English)
We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constraints, 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 官方产品；中文卡片由大模型生成，请以原文为准。