15 citations · 15 across the 8 of their papers we have counts for
10 papers
Meta-Programming for Linear-time Temporal Answer Set Programming
Susana Hahn, Amadé Nemes, Javier Romero +1
The development of temporal extensions of Answer Set Programming (ASP) has led to the emergence of non-monotonic linear-time (TEL), dynamic (DEL), and metric (MEL) temporal equilib…
Event Calculus Meets Hybrid ASP
Ondřej Vašíček, Joaquín Arias, Jan Fiedor +5
Event Calculus (EC) implemented in answer set programming (ASP) has proven suitable for specifying requirements on safety-critical systems thanks to its elegant representation of b…
Reasoning about Study Regulations in Answer Set Programming
Susana Hahn, Cedric Martens, Amade Nemes +4
We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different st…
On the generalization of learned constraints for ASP solving in temporal domains
Javier Romero, Torsten Schaub, Klaus Strauch
The representation of a dynamic problem in ASP usually boils down to using copies of variables and constraints, one for each time stamp, no matter whether it is directly encoded or…
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…
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…
Learning First-Order Representations for Planning from Black-Box States: New Results
Ivan D. Rodriguez, Blai Bonet, Javier Romero +1
Recently Bonet and Geffner have shown that first-order representations for planning domains can be learned from the structure of the state space without any prior knowledge about t…
eclingo: A solver for Epistemic Logic Programs
Pedro Cabalar, Jorge Fandinno, Javier Garea +2
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the…
How to build your own ASP-based system?!
Roland Kaminski, Javier Romero, Torsten Schaub +1
Answer Set Programming (ASP) has become a popular and quite sophisticated approach to declarative problem solving. This is arguably due to its attractive modeling-grounding-solving…
plasp 3: Towards Effective ASP Planning
Yannis Dimopoulos, Martin Gebser, Patrick Lühne +2
We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired b…