23 citations · 88 across the 36 of their papers we have counts for
4 papers · 2 filters
Comparing Non-minimal Semantics for Disjunction in Answer Set Programming
Felicidad Aguado, Pedro Cabalar, Brais Muñiz +2
In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of…
Towards Constraint Temporal Answer Set Programming
Pedro Cabalar, Martín Diéguez, François Olivier +2
Reasoning about dynamic systems with a fine-grained temporal and numeric resolution presents significant challenges for logic-based approaches like Answer Set Programming (ASP). To…
Compiling Metric Temporal Answer Set Programming
Arvid Becker, Pedro Cabalar, Martin Diéguez +3
We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challen…
Strong Equivalence in Answer Set Programming with Constraints
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if…