135 citations · 373 across the 42 of their papers we have counts for
4 papers · 1 filter
Bounded Combinatorial Reconfiguration with Answer Set Programming
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue +1
We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to…
Past-present temporal programs over finite traces
Pedro Cabalar, Martín Diéguez, François Laferrière +1
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computationa…
Metric Temporal Equilibrium Logic over Timed Traces
Arvid Becker, Pedro Cabalar, Martín Diéguez +2
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects…
Clingraph: A System for ASP-based Visualization
Susana Hahn, Orkunt Sabuncu, Torsten Schaub +1
We present the ASP-based visualization tool, clingraph, which aims at visualizing various concepts of ASP by means of ASP itself. This idea traces back to the aspviz tool and cling…