Article

Agents dealing with time and uncertainty

Authors:

VS SubrahmanianAuthors Info & Claims

AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2

Pages 912 - 919

https://doi.org/10.1145/544862.544953

Published: 15 July 2002 Publication History

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's). TP-agents continuously evaluate changes (in the state of the environment they are situated in) and compute appropriate FTPSI's. For a class of TP-agents called positive TP-agents, we develop a provably sound and complete procedure to compute FTPSI's.

References

[1]

H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens. MetateM: A framework for, programming in temporal logic. In LNCS 430. Springer-Verlag, June 1989

Digital Library

[2]

G. Boole. The Laws of Thought. Macmillan, London, 1854

[3]

T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1989

Digital Library

[4]

T. Dean and K. Kanazawa. Probabilistic Temporal Reasoning. In Proceedings AAAI, pages 524{529, 1988

[5]

J. Dix, S. Kraus, and V. Subrahmanian. Temporal agent reasoning. Artificial Intelligence, 127(1):87--135, 2001

Digital Library

[6]

J. Dix, M. Nanni, and V. S. Subrahmanian. Probabilistic agent reasoning. ACM Transactions of Computational Logic, 1(2):201--245, 2000

Digital Library

[7]

D. Dubois, J. Lang, and H. Prade. Towards Possibilistic Logic Programming. In Proceedings of the Eighth ICLP, pages 581{595, Paris, France, June 1991. MIT Press

[8]

D. Dubois and H. Prade. Possibilistic logic. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Nonmonotonic and Uncertain Reasoning, pages 439--513. Oxford University Press, 1994

Digital Library

[9]

E. Sandewall. Features and Fluents: The Representation of Knowledge about Dynamical Systems, 1994

Digital Library

[10]

T. Eiter, V. Subrahmanian, and G. Pick. Heterogeneous Active Agents, I: Semantics. Artificial Intelligence, 108(1-2):179--255, 1999

Digital Library

[11]

R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Massachusetts, 1995. 2nd printing

Digital Library

[12]

R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1/2):78--128, July/August 1990

Digital Library

[13]

M. Fisher. A survey of Concurrent MetateM -, the language and its applications. In D. M. Gabbay and H. J. Ohlbach, editors, Temporal Logic - Proceedings of the, First International Conference. Springer-Verlag, July 1994

Digital Library

[14]

P. Gmytrasiewicz and E. Durfee. A Logic of Knowledge and Belief for Recursive Modeling. In Proceedings of the 10th National Conference on Artificial, Intelligence, pages 628--634, San Jose, CA, 1992. AAAI Press/MIT Press

Digital Library

[15]

P. Gmytrasiewicz, E. Durfee, and D. Wehe. A Decision-Theoretic Approach to Coordinating Multiagent, Interactions. In Proceedings of the 12th IJCAI, pages 62{68, Sydney, Australia, 1991. Morgan Kaufmann

[16]

P. Haddawy. Representing Plans under Uncertainty: A Logic of Time, Chance and Action. PhD thesis, University of Illinois, 1991

Digital Library

[17]

K. Kanazawa. A Logic and Time Nets for Probabilistic Inference. In Proceedings AAAI-91, pages 360--365, Anaheim, August 1991

[18]

V. S. Lakshmanan, N. Leone, R. Ross, and S. V. S. ProbView: A Flexible Probabilistic Database System. ACM Transactions on Database Systems, 22(3):419--469, September 1997

Digital Library

[19]

D. Lehmann and S. Shelah. Reasoning with time and chance. Information and Control, 53:165--198, 1982

[20]

J. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, Germany, 1984, 1987

Digital Library

[21]

V. Subrahmanian, P. Bonatti, J. Dix, T. Eiter, S. Kraus, F. Özcan, and R. Ross. Heterogenous Active Agents. MIT-Press, 2000

[22]

B. Thomas, Y. Shoham, A. Schwartz, and S. Kraus. Preliminary Thoughts on an Agent Description Language. International Journal of Intelligent Systems, 6(5):497--508, August 1991

Cited By

Dix JFisher M(2018)Where logic and agents meetAnnals of Mathematics and Artificial Intelligence10.1007/s10472-010-9223-961:1(15-28)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s10472-010-9223-9
Barták RMorris RVenable K(2014)An Introduction to Constraint-Based Temporal ReasoningSynthesis Lectures on Artificial Intelligence and Machine Learning10.2200/S00557ED1V01Y201312AIM0268:1(1-121)Online publication date: 28-Feb-2014
https://doi.org/10.2200/S00557ED1V01Y201312AIM026

Index Terms

Agents dealing with time and uncertainty
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Intelligent agents

Recommendations

Ascribing beliefs to resource bounded agents
AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2

Logical approaches to reasoning about agents often rely on idealisations about belief ascription and logical omniscience which make it difficult to apply the results obtained to real agents. In this paper, we show how to ascribe beliefs and an ability ...
Heterogeneous temporal probabilistic agents

To date, there has been no work on temporal probabilistic agent reasoning on top of heterogeneous legacy databases and software modules. We will define the concept of a heterogeneous temporal probabilistic (HTP) agent. Such agents can be built on top of ...
Reasoning in Non-probabilistic Uncertainty: Logic Programming and Neural-Symbolic Computing as Examples

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty (and even more, that there are kinds of uncertainty which are for principled reasons not addressable with probabilistic means); and to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2

July 2002

508 pages

ISBN:1581134800

DOI:10.1145/544862

Conference Chairs:
Maria Gini
University of Minnesota, USA
,
Toru Ishida
Kyoto University, Japan
,
Program Chairs:
Cristiano Castelfranchi
CNR and Università di Siena, Italy
,
W. Lewis Johnson
University of Southern California, USA

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

AAMAS02

Sponsor:

AAMAS02: The First International Joint Conference on Autonomous Agents and Multi-Agent Systems ( formerly known as Autonomous Agents )

July 15 - 19, 2002

Bologna, Italy

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
383
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dix JFisher M(2018)Where logic and agents meetAnnals of Mathematics and Artificial Intelligence10.1007/s10472-010-9223-961:1(15-28)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s10472-010-9223-9
Barták RMorris RVenable K(2014)An Introduction to Constraint-Based Temporal ReasoningSynthesis Lectures on Artificial Intelligence and Machine Learning10.2200/S00557ED1V01Y201312AIM0268:1(1-121)Online publication date: 28-Feb-2014
https://doi.org/10.2200/S00557ED1V01Y201312AIM026

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents