3 papers
cs.LO2026
Common Knowledge Always, Forever
Martín Diéguez, David Fernández-Duque
There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-ref…
cs.LO2026
Extracting Policies from Quantified Answer Set Programs
Martín Diéguez, Igor Stéphan
Quantified Answer Set Programming (QASP) extends Answer Set Programming (ASP) by allowing quantification over propositional variables, similar to Quantified Boolean Formulas (QBF).…
cs.AI2026
Implementing 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 constraints, like durations and deadlines. A central challe…