Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...