5 papers · 1 filter
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…
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…
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…