Javier Romero

Javier Romero

Auto-generated profile, based on publicly available information

Javier Romero

University of Potsdam

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 December 2021 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
RKRoland Kaminski
Roland Kaminski
JRJavier Romero
Javier Romero
TSTorsten Schaub
Torsten Schaub
PWPhilipp Wanko
Philipp Wanko
Answer Set Programming, or ASP for short, has become a popular and sophisticated approach to declarative problem solving. Its popularity is due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. However, in contrast to ASP’s ease of use, the high degree of sophistication of the underlying technology makes it even hard for ASP experts to put ideas into practice whenever this involves modifying ASP’s machinery. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system clingo can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how metaprogramming can be used for extending ASP. This is a rather light approach that relies on clingo’s reification feature to use ASP itself for expressing new functionalities. The second part of this tutorial uses traditional programming (in Python) for manipulating clingo via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is clingo’s new Application class that allows us to draw on clingo’s infrastructure by customizing processes similar to the one in clingo. For instance, we may apply manipulations to programs’ abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. A cross-sectional structure, spanning meta as well as application programming, is clingo’s intermediate format, aspif, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several nontrivial case studies. In particular, we show how clingo can be extended by difference constraints and how guess-and-check programming can be implemented with both meta and application programming.

24 September 2021 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
JFJorge Fandinno
Jorge Fandinno
FLFrancois Laferriere
Francois Laferriere
JRJavier Romero
Javier Romero
TSTorsten Schaub
Torsten Schaub
TSTran Cao Son
Tran Cao Son
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 planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.

1 October 2021
Verified
Conference Paper
Open access
SSSoubhik Sanyal
Soubhik Sanyal
BMBetty Mohler
Betty Mohler
AVAlex Vorobiov
Alex Vorobiov
LDLarry Davis
Larry Davis
TBTimo Bolkart
Timo Bolkart
MBMichael J. Black
Michael J. Black
Synthesizing images of a person in novel poses from a single image is a highly ambiguous task. Most existing approaches require paired training images; i.e. images of the same person with the same clothing in different poses. However, obtaining sufficiently large datasets with paired data is challenging and costly. Previous methods that forego paired supervision lack realism. We propose a self-supervised framework named SPICE (Self-supervised Person Image CrEation) that closes the image quality gap with supervised methods. The key insight enabling self-supervision is to exploit 3D information about the human body in several ways. First, the 3D body shape must remain unchanged when reposing. Second, representing body pose in 3D enables reasoning about self occlusions. Third, 3D body parts that are visible before and after reposing, should have similar appearance features. Once trained, SPICE takes an image of a person and generates a new image of that person in a new target pose. SPICE achieves state-of-the-art performance on the DeepFashion dataset, improving the FID score from 29.9 to 7.8 compared with previous unsupervised methods, and with performance similar to the state-of-the-art supervised method (6.4). SPICE also generates temporally coherent videos given an input image and a sequence of poses, despite being trained on static images only.

1 January 2016
Verified
Conference Paper
Open access
RFReuben Fleming
Reuben Fleming
BMBetty J. Mohler
Betty J. Mohler
JRJavier Romero
Javier Romero
MBMichael J. Black
Michael J. Black
MBMartin Breidt
Martin Breidt

18 January 2019 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
YDYannis Dimopoulos
Yannis Dimopoulos
Martin GebserMartin Gebser
Martin Gebser
PLPatrick Lühne
Patrick Lühne
JRJavier Romero
Javier Romero
TSTorsten Schaub
Torsten Schaub
We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translatorplasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result,plaspprovides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.

27 September 2023 in Artificial Intelligence
Verified
Journal Article
Closed access
GBGerhard Brewka
Gerhard Brewka
JDJames Delgrande
James Delgrande
JRJavier Romero
Javier Romero
TSTorsten Schaub
Torsten Schaub