On Agents That Have the Ability to Choose

We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual approaches towards nondeterminism cannot be used here. The semantics that we define for nondeterministic actions is based on the idea that composite actions are unravelled in the strings of atomic actions and tests that constitute them. The main notions used in defining this semantics are finite computation sequences and finite computation runs of actions. The results that we obtain meet our intuitions regarding events and abilities in the presence of nondeterminism.

[1]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

[2]  John-Jules Ch. Meyer,et al.  Actions That Make You Change Your Mind (Extended Abstract) , 1995, KI.

[3]  R. Goldblatt Logics of Time and Computation , 1987 .

[4]  Daniel Marcu,et al.  Foundations of a Logical Approach to Agent Programming , 1995, ATAL.

[5]  A. Montefiore NORM AND ACTION , 1964 .

[6]  Robert C. Moore A Formal Theory of Knowledge and Action , 1984 .

[7]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[8]  David Peleg,et al.  Concurrent dynamic logic , 1985, STOC '85.

[9]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  W. Hoek,et al.  Seeing Is Believing And So Are Hearing and Jumping , 2002 .

[11]  L. T. F. Gamut Intensional logic and logical grammar , 1991 .

[12]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[13]  John-Jules Ch. Meyer,et al.  Formalising Abilities and Opportunities of Agents , 1998, Fundam. Informaticae.

[14]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[15]  John-Jules Ch. Meyer,et al.  A Logical Approach to the Dynamics of Commitments , 1999, Artif. Intell..

[16]  Hector J. Levesque,et al.  Intention is Choice with Commitment , 1990, Artif. Intell..

[17]  Joseph Y. Halpern,et al.  A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[18]  J. Armstrong Knowledge and Belief , 1953 .

[19]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[20]  W. Hoek,et al.  Formalising abilities and opportunities of agents , 1998 .

[21]  Joseph Y. Halpern,et al.  The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) , 1981, FOCS.

[22]  Robert C. Moore Reasoning About Knowledge and Action , 1977, IJCAI.

[23]  Mark A. Brown On the logic of ability , 1988, J. Philos. Log..

[24]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

[25]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[26]  John-Jules Ch. Meyer,et al.  Tests as Epistemic Updates , 1994, ECAI.

[27]  Joseph Y. Halpern,et al.  The prepositional dynamic logic of deterministic, well-structured programs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[28]  Nicholas Rescher,et al.  The Logic of Decision and Action , 1967 .

[29]  L. T. F. Gamut Logic, language, and meaning , 1991 .

[30]  John-Jules Ch. Meyer,et al.  A Logic of Capabilities , 1994, LFCS.

[31]  Jan A. Bergstra,et al.  Linear Time and Branching Time Semantics for Recursion with Merge , 1983, Theor. Comput. Sci..

[32]  Anthony Kenny,et al.  Will, freedom, and power , 1975 .

[33]  W. van der Hoek,et al.  Unravelling nondeterminism: On having the ability to choose , 1993 .

[34]  John-Jules Ch. Meyer,et al.  The Dynamics of Default Reasoning , 1997, Data Knowl. Eng..

[35]  Roel Wieringa,et al.  Actor-Oriented Specification of Deontic Integrity Constraints , 1991, MFDBS.

[36]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[37]  Manfred Broy,et al.  A Theory for Nondeterminism, Parallelism, Communication, and Concurrency , 1986, Theor. Comput. Sci..