4 papers
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…
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…