We study a variation of the Stable Marriage problem, where every man and...
The Stable Roommates problem with Ties and Incomplete lists (SRTI) is a
...
We study a dynamic version of multi-agent path finding problem (called
D...
We investigate the use of Answer Set Programming to solve variations of
...
We propose a novel formal framework (called 3D-nCDC-ASP) to represent an...
The multi-agent path finding (MAPF) problem is a combinatorial search pr...
For planning an assembly of a product from a given set of parts, robots
...
The Stable Roommates problem (SR) is characterized by the preferences of...
Since the first conference held in Marseille in 1982, ICLP has been the
...
We are proud to introduce this special issue of Theory and Practice of L...
For planning rearrangements of objects in a clutter, it is required to k...
We study robot construction problems where multiple autonomous robots
re...
We introduce a parallel offline algorithm for computing hybrid condition...
For a finite state automaton, a synchronizing sequence is an input seque...
We introduce novel mathematical models and algorithms to generate (short...
We present ReAct!, an interactive tool for high-level reasoning for cogn...
We investigate different approaches to integrating object recognition an...
We provide a systematic analysis of levels of integration between discre...
For some computational problems (e.g., product configuration, planning,
...
In this work, we develop an intelligent user interface that allows users...
We generalize a theorem by Francois Fages that describes the relationshi...