Implementing Metric Temporal Answer Set Programming
🤖 AI Summary
This work addresses the grounding bottleneck in Metric Temporal Answer Set Programming (MT-ASP), which severely limits scalability when handling fine-grained temporal constraints. The authors propose a novel approach that deeply integrates Difference Constraint Systems (DCS) with ASP, offloading quantitative temporal constraints—such as durations and deadlines—to a dedicated constraint solver. This design effectively decouples temporal precision from logical reasoning performance. By doing so, the method preserves the full expressiveness of standard ASP while substantially improving solving efficiency. Crucially, its performance remains unaffected by the granularity of time, thereby overcoming a fundamental scalability barrier inherent in traditional metric temporal ASP frameworks.
Application Category
📝 Abstract
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.
Problem
Research questions and friction points this paper is trying to address.
Metric Temporal Answer Set Programming
quantitative temporal constraints
grounding bottleneck
scalability
time granularity
Innovation
Methods, ideas, or system contributions that make the work stand out.
Metric Temporal Answer Set Programming
Difference Constraints
Grounding Bottleneck
Time Granularity
Scalability
🔎 Similar Papers
No similar papers found.
