Search
This exercise aims at knowledge representation, reasoning and planning in first-order logic. You will apply situation calculus in order to plan in a dynamic task in terms of first-order logical deductions.
Monkey-banana problem is a simple task in which a monkey is in a room. A banana hangs from the ceiling. The monkey stands just below the banana but it is beyond the monkey's reach. The monkey is able to walk, move and climb objects. The room is just the right height so that the monkey can move a box, climb it and grasp the banana. The goal is to generate this plan (i.e., a sequence of simple actions) automatically.
The problem will be solved in Prover9 system. Utilize the situation calculus formalism to resolve the following subtasks:
Monday 7.5.2018 23:59 CEST
Submit in the upload system, submit a zip file that contains three different solution files (keep the names mentioned below, do not use folders):
Notes on efficiency and generality
10 point assignment, min 5 points needed to pass it.
Employ the concept of situation calculus, the solutions that ignore it cannot pass the threshold. The grading is as follows: 2 points for the simple solution, 5 points for principled use of situation calculus in the formal solution, 3 points for its complete coherence (the objects cannot copy, the complete set of frame axioms, etc.).
The existence of proofs themselves helps to evaluate the solutions but it is not directly graded. Do not try to reach them at any cost (intentional mistakes that make Prover9 exit as expected).