Formal Foundations of Incremental Dynamic Answer Set Programming
Pedro Cabalar, Martín Diéguez, François Laferrière et al.
· 0 citations
Sponsored
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
3 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.
Open access
Sep 2026
Implementing Metric Temporal Answer Set Programming
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.
Susana Hahn, Arvid Becker, Pedro Cabalar et al.
· Theory and Practice of Logic... · 0 citations
Open access
Jul 2026
Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
A many-sorted variant of the Bound-founded Logic of Here-and-There (HTb) is introduced, providing a versatile framework capable of characterizing equilibrium models across a wide spectrum of alternative semantics for extensions of ASP with linear constraints.
Pedro Cabalar, Jorge Fandinno, N. Rühling et al.
· Electronic Proceedings in Th... · 0 citations