Formal Foundations of Incremental Dynamic Answer Set Programming
Pedro Cabalar, Martín Diéguez, François Laferrière et al.
· 0 citations
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
This work develops a computational approach to Metric Answer Set Programming to express quantitative temporal constrains, such as durations and deadlines, and effectively decouples metric ASP from the granularity of time, resulting in a solution that is independent of time precision.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.