Knowledge preconditions for plans

Research output: Contribution to journalArticle

Abstract

For an agent to be able to rely on a plan, he must know both that he is physically capable of carrying out the physical actions involved, and that he knows enough to carry out the plan. In this paper, we advance and discuss new definitions of 'knowing enough to carry out a plan', for the case of a single agent carrying out a sequence of primitive actions one at a time. We consider both determinate and indeterminate plans. We show how these definitions can be expressed in a formal logic, using a situation calculus model of time and a possible worlds model of knowledge. The definitions strictly subsume previous theories for the single-agent case without concurrent actions. We illustrate the power of the definition by showing that it supports results of the following kinds:. Positive verification: showing that a plan is feasible.Negative verification: showing that a plan is infeasible.Monotonicity: the more an agent knows, the more plans are executable.Reduction for omniscient agent: for an omniscient agent, a plan is epistemically feasible if and only if it is physically feasible.Simple recursive rules that are sufficient conditions for the feasibility of a plan described as a sequence or a conditional combination of subplans.

Original languageEnglish (US)
Pages (from-to)721-766
Number of pages46
JournalJournal of Logic and Computation
Volume4
Issue number5
DOIs
StatePublished - Oct 1994

Fingerprint

Precondition
Calculi
Formal logic
Knowledge
Monotonicity
Concurrent
Calculus
Strictly
Logic
If and only if
Sufficient Conditions

Keywords

  • Feasibility
  • Formal theory of knowledge.
  • Preconditions
  • Semantics of plans

ASJC Scopus subject areas

  • Molecular Biology
  • Hardware and Architecture
  • Software
  • Computational Mathematics
  • Logic
  • Statistics and Probability
  • Theoretical Computer Science

Cite this

Knowledge preconditions for plans. / Davis, Ernest.

In: Journal of Logic and Computation, Vol. 4, No. 5, 10.1994, p. 721-766.

Research output: Contribution to journalArticle

@article{cdaff2b57c7e4a408389152058eb7bbe,
title = "Knowledge preconditions for plans",
abstract = "For an agent to be able to rely on a plan, he must know both that he is physically capable of carrying out the physical actions involved, and that he knows enough to carry out the plan. In this paper, we advance and discuss new definitions of 'knowing enough to carry out a plan', for the case of a single agent carrying out a sequence of primitive actions one at a time. We consider both determinate and indeterminate plans. We show how these definitions can be expressed in a formal logic, using a situation calculus model of time and a possible worlds model of knowledge. The definitions strictly subsume previous theories for the single-agent case without concurrent actions. We illustrate the power of the definition by showing that it supports results of the following kinds:. Positive verification: showing that a plan is feasible.Negative verification: showing that a plan is infeasible.Monotonicity: the more an agent knows, the more plans are executable.Reduction for omniscient agent: for an omniscient agent, a plan is epistemically feasible if and only if it is physically feasible.Simple recursive rules that are sufficient conditions for the feasibility of a plan described as a sequence or a conditional combination of subplans.",
keywords = "Feasibility, Formal theory of knowledge., Preconditions, Semantics of plans",
author = "Ernest Davis",
year = "1994",
month = "10",
doi = "10.1093/logcom/4.5.721",
language = "English (US)",
volume = "4",
pages = "721--766",
journal = "Journal of Logic and Computation",
issn = "0955-792X",
publisher = "Oxford University Press",
number = "5",

}

TY - JOUR

T1 - Knowledge preconditions for plans

AU - Davis, Ernest

PY - 1994/10

Y1 - 1994/10

N2 - For an agent to be able to rely on a plan, he must know both that he is physically capable of carrying out the physical actions involved, and that he knows enough to carry out the plan. In this paper, we advance and discuss new definitions of 'knowing enough to carry out a plan', for the case of a single agent carrying out a sequence of primitive actions one at a time. We consider both determinate and indeterminate plans. We show how these definitions can be expressed in a formal logic, using a situation calculus model of time and a possible worlds model of knowledge. The definitions strictly subsume previous theories for the single-agent case without concurrent actions. We illustrate the power of the definition by showing that it supports results of the following kinds:. Positive verification: showing that a plan is feasible.Negative verification: showing that a plan is infeasible.Monotonicity: the more an agent knows, the more plans are executable.Reduction for omniscient agent: for an omniscient agent, a plan is epistemically feasible if and only if it is physically feasible.Simple recursive rules that are sufficient conditions for the feasibility of a plan described as a sequence or a conditional combination of subplans.

AB - For an agent to be able to rely on a plan, he must know both that he is physically capable of carrying out the physical actions involved, and that he knows enough to carry out the plan. In this paper, we advance and discuss new definitions of 'knowing enough to carry out a plan', for the case of a single agent carrying out a sequence of primitive actions one at a time. We consider both determinate and indeterminate plans. We show how these definitions can be expressed in a formal logic, using a situation calculus model of time and a possible worlds model of knowledge. The definitions strictly subsume previous theories for the single-agent case without concurrent actions. We illustrate the power of the definition by showing that it supports results of the following kinds:. Positive verification: showing that a plan is feasible.Negative verification: showing that a plan is infeasible.Monotonicity: the more an agent knows, the more plans are executable.Reduction for omniscient agent: for an omniscient agent, a plan is epistemically feasible if and only if it is physically feasible.Simple recursive rules that are sufficient conditions for the feasibility of a plan described as a sequence or a conditional combination of subplans.

KW - Feasibility

KW - Formal theory of knowledge.

KW - Preconditions

KW - Semantics of plans

UR - http://www.scopus.com/inward/record.url?scp=0043159618&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0043159618&partnerID=8YFLogxK

U2 - 10.1093/logcom/4.5.721

DO - 10.1093/logcom/4.5.721

M3 - Article

VL - 4

SP - 721

EP - 766

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

SN - 0955-792X

IS - 5

ER -