135 citations · 373 across the 42 of their papers we have counts for
5 papers · 1 filter
Answer Set Programming Made Easy
Jorge Fandinno, Seemran Mishra, Javier Romero +1
We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programm…
Automata for dynamic answer set solving: Preliminary report
Pedro Cabalar, Martín Diéguez, Susana Hahn +1
We explore different ways of implementing temporal constraints expressed in an extension of Answer Set Programming (ASP) with language constructs from dynamic logic. Foremost, we i…
Planning with Incomplete Information in Quantified Answer Set Programming
Jorge Fandinno, François Laferrière, Javier Romero +2
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planni…
Towards a Semantics for Hybrid ASP systems
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficu…
On the Foundations of Grounding in Answer Set Programming
Roland Kaminski, Torsten Schaub
We provide a comprehensive elaboration of the theoretical foundations of variable instantiation, or grounding, in Answer Set Programming (ASP). Building on the semantics of ASP's m…