closed by
5,712 views
5 5 votes
closed with the note: Out of syllabus now

Consider the following logic program P

$\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$

Which of the following first order sentences is equivalent to P?

  1. $(\forall  x) [(\exists y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land \neg (\exists x)[B(x,x)]$

  2. $(\forall  x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land \neg (\exists x)[B(x,x)]$

  3. $(\forall  x) [(\exists y) [B(x,y) \land C(y)] \Rightarrow A(x)] \vee \neg (\exists x)[B(x,x)]$

  4. $(\forall  x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land  (\exists x)[B(x,x)]$

Answer:
Position:
Show:

Related questions

2 2 votes
2 2 answers
7.6k
7.6k views
Kathleen asked Sep 17, 2014
7,638 views
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed...
61 61 votes
5 answers 5 answers
14.5k
14.5k views
Kathleen asked Sep 17, 2014
14,505 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
0 0 votes
0 0 answers
2.0k
2.0k views
Kathleen asked Sep 17, 2014
2,033 views
A piecewise linear function $f(x)$ is plotted using thick solid lines in the figure below (the plot is drawn to scale).If we use the Newton-Raphson method to find the roo...
17 17 votes
3 answers 3 answers
11.4k
11.4k views
Kathleen asked Sep 16, 2014
11,432 views
Ram and Shyam have been asked to show that a certain problem $\Pi$ is $\text{NP-complete}.$ Ram shows a polynomial time reduction from the $\text{3-SAT}$ problem to $\Pi$...