Representing Plans Under Uncertainty: A Logic of Time, Chance, and Action"This monograph integrates AI and decision-theoretic approaches to the representation of planning problems by developing a first-order logic of time, chance, and action for representing and reasoning about plans. The semantics of the logic incorporates intuitive properties of time, chance, and action central to the planning problem. The logical language integrates both modal and probabilistic constructs and allows quantification over time points, probability values, and domain individuals. The language can represent the chance that facts hold and events occur at various times and that actions and other events affect the future. An algorithm for the problem of building construction planning is developed and the logic is used to prove the algorithm correct."--PUBLISHER'S WEBSITE. |
Contents
Introduction | 1 |
Related Work | 10 |
Semantic Constraints | 17 |
Copyright | |
10 other sections not shown
Other editions - View all
Representing Plans Under Uncertainty: A Logic of Time, Chance, and Action Peter Haddawy No preview available - 1994 |
Common terms and phrases
A₁ action attempts action is feasible agent Artificial Intelligence assumption ATT(A ATT(start(car attempt an action attempt the action Barcan formula concurrently conditional expected conditional probability constraints CPM algorithm D.H. Mellor da₁ Decision Theory defined definition of c-prob described event token example executability conditions expected utility FEAS(A Field axioms first-order logic HOLDS num(R inevitability infer interval language Ltea max(t'm nodes objective chance OCC(A OCC(drive(home,restaurant OCC(start(car occur Ot₂ p₁(G Pelavin plan is feasible planning algorithm planning problems Pnow FEAS Pnow FEAS(A2 Pnow G Pnow HOLDS Pnow OCC(A1 possible probabilistic probability axioms proof proof theory Pt(ATT(A Pt(v Pt(w ramification conditions reasoning about plans red-picked relation represent representation resource semantics sentence start(car steel crew Suppose t-terms t₁ t₁<t₂ t₂ ta₁ ta₂ tEFF Temporal non-succession temporal tree tit₂ trm1 trm2 true iff trying to attempt utility function w₁ world-histories