Looking for 338.055, VL Computational Logics for AI, Martina Seidl / Clemens Hofstadler, 2025W test answers and solutions? Browse our comprehensive collection of verified answers for 338.055, VL Computational Logics for AI, Martina Seidl / Clemens Hofstadler, 2025W at moodle.jku.at.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Given the following first-order formula with equality:
(f(x) ≐ g(x) ∨ q(x)) ∧
(f(x) ≐ x) ∧
(¬(x ≐ a()) ∨ ¬q(x)) ∧
(¬p(g(f(a()))) ∧
(p(f(a())) ∨ p(x))
Prove that this formula is unsatisfiable (1) by enriching the formula with equality axioms and standard FO-resolution or (2) with the resolution calculus with paramodulation.
Given the set of clauses
(p(a()) ∨ p(b()) ∨ p(x) ∨ q(x) ∨ q(y) ∨ p(z) ∨ p(f(z)) ∨ ¬p(z))
Which clauses can be derived by factorization?
Given the following first-order formula with equality:
(f(X) ≐ g(X) ∨ q(X)) ∧
(f(X) ≐ X) ∧
(¬(X ≐ a) ∨ ¬q(X)) ∧
(¬p(g(f(a))) ∧
(p(f(a)) ∨ p(X))
Prove that this formula is unsatisfiable (1) by enriching the formula with equality axioms and standard FO-resolution or (2) with the resolution calculus with paramodulation.
Given the set of clauses
(p(a) ∨ p(b) ∨ p(X) ∨ q(X) ∨ q(Y) ∨ p(Z) ∨ p(f(Z)) ∨ ¬p(Z))
Which clauses can be derived by factorization?
Given the first-order formula
.
Which of the following statements hold?
Show unsatisfiability of the following formula using First-Order Resolution
Given the first-order formula p(f(x), g(b(),y)) ∨ q(b(), h(x,a(),x), b()). Which of the following elements are in the Herbrand Universe of this formula?
Transform the following formula into Skolem Normal Form:
∃x∀y∃z. (p(x, y) ∨ ∀u∃v. q(z, u, v))
Consider a signature with constants a, b; function symbols f, g; predicate symbols p, q and variables x, y, z.
Given the following first-order formula Φ:
∀x∀y.(p(x,y) ∧ ¬q(f(a()), f(z), g(a(),b()))) ∧ p(z,z)
Which of the following properties hold?