`land'' for the symbol ∧  ``lor'' for the symbol ∨ ``lnot'' for the symbol ¬``is_not'' for the symbol≠. Consider a tiny Robot World (robot R in a room) which has two actions: walkout: R walks out of the room unlock: R unlocks the door. two fluents: DoorLocked: the room door is locked, InsideRoom: R is inside the room. a) R can walk out of the room iff R is inside the room and the door is not locked. Meanwhile, R can unlock the door if it is locked. Write the precondition axioms for these two actions. b) Consequence of the action walking-out is that the fluent InsideRoom becomes false. Consequence of the action of unlocking is that DoorLocked is false. Assuming explanation closure, write the successor state axioms for these two fluents. c) If in the initial state S0, we have both fluents (DoorLocked, InsideRoom) true, would the following sequence of actions a legal one? do(walkout, do(unlock, S0)) If yes, what would be the fluent values in the state resulting from executing the sequence. d) Again if in the initial state S0, we have DoorLocked, InsideRoom, would the following sequence a legal one? do(unlock, do(walkout, S0)) If yes, what would be the fluent values in the state resulting from executing the sequence

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Note that for this question, you can in addition use

``land'' for the symbol ∧ 

``lor'' for the symbol ∨

``lnot'' for the symbol ¬``is_not'' for the symbol≠.

Consider a tiny Robot World (robot R in a room) which has two actions:
walkout: R walks out of the room
unlock: R unlocks the door.

two fluents:
DoorLocked: the room door is locked,
InsideRoom: R is inside the room.

a) R can walk out of the room iff R is inside the room and the door is not locked. Meanwhile, R can unlock the door if it is locked. Write the precondition axioms for these two actions.

b) Consequence of the action walking-out is that the fluent InsideRoom becomes false. Consequence of the action of unlocking is that DoorLocked is false. Assuming explanation closure, write the successor state axioms for these two fluents.

c) If in the initial state S0, we have both fluents (DoorLocked, InsideRoom) true, would the following sequence of actions a legal one?
do(walkout, do(unlock, S0))
If yes, what would be the fluent values in the state resulting from executing the sequence.

d) Again if in the initial state S0, we have DoorLocked, InsideRoom, would the following sequence a legal one?
do(unlock, do(walkout, S0))
If yes, what would be the fluent values in the state resulting from executing the sequence.

Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education