Performing experiments with human-robot interfaces often requires the allocation of expensive and complex hardware and large physical spaces. Those costs constrain development and...
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
A novel `play-by-play' based procedure learning system has been successfully applied to automate Web tasks. In the transition to a non-Web domain, for a system widely used at...
Nate Blaylock, William de Beaumont, Lucian Galescu...
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...