@conference {17819,
	title = {Agents dealing with time and uncertainty},
	booktitle = {Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2},
	series = {AAMAS {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {912 - 919},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Situated agents in the real world need to handle the fact that events occur frequently, as well as the fact that the agent typically has uncertain knowledge about what is true in the world. The ability to reason about both time and uncertainty is therefore very important. In this paper, we develop a formal theory of agents that can reason about both time and uncertainty. The theory extends the notion of agents described in [10, 21] and proposes the notion of temporal probabilistic (or TP) agents. A formal semantics for TP-agents is proposed - this semantics is described via structures called feasible TP-status interpretations (FTPSI{\textquoteright}s). TP-agents continuously evaluate changes (in the state of the environment they are situated in) and compute appropriate FTPSI{\textquoteright}s. For a class of TP-agents called positive TP-agents, we develop a provably sound and complete procedure to compute FTPSI{\textquoteright}s.},
	keywords = {formalisms and logics, logic programming, probabilistic/uncertain reasoning, temporal reasoning, theories of agency},
	isbn = {1-58113-480-0},
	doi = {10.1145/544862.544953},
	url = {http://doi.acm.org/10.1145/544862.544953},
	author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian}
}
@article {17822,
	title = {Temporal agent programs},
	journal = {Artificial Intelligence},
	volume = {127},
	year = {2001},
	month = {2001/03//},
	pages = {87 - 135},
	abstract = {The {\textquotedblleft}agent program{\textquotedblright} framework introduced by Eiter, Subrahmanian and Pick [Artificial Intelligence 108 (1{\textendash}2) (1999) 179], supports developing agents on top of arbitrary legacy code. Such agents are continuously engaged in an {\textquotedblleft}event\&$\#$xa0;occurs{\textrightarrow}think{\textrightarrow}act{\textrightarrow}event\&$\#$xa0;occurs{\textellipsis}{\textquotedblright} cycle. However, this framework has two major limitations: (1)all actions are assumed to have no duration, and
(2)
all actions are taken now, but cannot be scheduled for the future.
 In this paper, we present the concept of a {\textquotedblleft}temporal agent program{\textquotedblright} (tap for short) and show that using taps, it is possible to build agents on top of legacy code that can reason about the past and about the future, and that can make temporal commitments for the future now. We develop a formal semantics for such agents, extending the concept of a status set proposed by Eiter et al., and develop algorithms to compute the status sets associated with temporal agent programs. Last, but not least, we show how taps support the decision making of collaborative agents.
},
	keywords = {agents, Heterogenous systems, Information integration, logic programming, temporal reasoning},
	isbn = {0004-3702},
	doi = {10.1016/S0004-3702(01)00052-2},
	url = {http://www.sciencedirect.com/science/article/pii/S0004370201000522},
	author = {Dix,J{\"u}rgen and Kraus,Sarit and V.S. Subrahmanian}
}
