I am looking for help with Predicate and Quantitative Logic.
Provide proofs for the attached 4 problems using the 9 rules of inference, the 10 rules of replacement and Quantitative logic.
Provide proof s for the following four arguments using:
The 9 rules of inference; Modus Pollens (MP); Modus Tollens (MT); Hypothetical Syllogism (HS);
Disjunctive Syllogism (DS); Constructive Dilemna (CD); Absorption (Abs); Simplification (Simp);
Conjuction (Conj); and Addition (Add)
The 10 rules of replacement: DeMorgans Theorems (DeM); Commutation (Com); Association (Assoc);
Distribution (Dist);Double Negation (DN); Transposition (Trans); Implication (Impl);
Equivalence (Equiv); Exportation (Exp); and Repetition (Rep)
Quantification Logic: Universal Instantiation (UI); Universal Generalization (UG); Existential
Generalization (EG); Existential Instantiation (EI) and Change of Quantifier Rules (CQ)
1. (x) [Ax > Bx > Cx)]
2. (3x) (Ax v Dx)
3. (x) ~Dx
4. (x) Bx / (3x) Cx
1. ~(3x) (Ax & ~Bx)
2. ~(3x) (Bx & ~Cx) / (x) (Ax > Cx)
1. (3x) (~Hx) > (x) (Ax > Bx)
2. ~(x) (Hx v Bx) / (3x) ~Ax
1. (3x) (Px v Gx) > (x) Hx
2. (3x) (~Hx) / (x) (~Px)
Please find attached the proofs and review them carefully. Different books often have ...
Provides completed proofs for four predicate / quantitative logic proofs.
Planning a route for a robot to take from one city to another
Consider the problem of planning a route for a robot to take from one city to another. The basic action taken by the robot is Go (x,y), which takes it from city x to city y if there is a direct route between those cities. DirectRoute(x,y) is true if an only if there is a direct route from x to y; you can assume that all such facts are already in the knowledge base. The robot begins in New York and must reach Los Angeles.
Write a suitable logical description of the initial situation of the Robot.
Write a suitable logical query whose solutions will provide possible paths to the goal.
Write a sentence describing the Go action. Use a successor-state axiom.View Full Posting Details