The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to which of the following? (1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) (3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P)) (4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))

The first order logic (FOL) statement ((RᴠQ)˄(Pᴠ¬Q)) is equivalent to

which of the following?

(1) ((Rᴠ¬Q)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))

(2) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP))

(3) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(Rᴠ¬P))

(4) ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(¬RᴠP))


by

1 Answer

Answer :

 ((RᴠQ)ᴧ(Pᴠ¬Q)ᴧ(RᴠP)) 
by

Related questions

The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Description : The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Last Answer : d) All of the mentioned

What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Last Answer : a) Search & Logic

In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Last Answer : (B) (~P∨Q)∧(~Q∨P)

Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/ are correct? (A) (a) only (B) (b) only (C) (a) and (b) (D) (a), (b) and (c)

Description : Consider the following statements : (a) Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b) Optimal Boolean expressions may not correspond to simplest networks. (c) Choosing essential blocks first in a Karnaugh map ... (b) only (C) (a) and (b) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c) 

Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree” a) ∀ a PhD(a) -> Master(a) b) ∃ a PhD(a) -> Master(a) c) A is true, B is true d) A is false, B is false

Description : Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree” a) ∀ a PhD(a) -> Master(a) b) ∃ a PhD(a) -> Master(a) c) A is true, B is true d) A is false, B is false

Last Answer : a) ∀ a PhD(a) -> Master(a)

What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Description : What is the output when following statement is executed ? >>>print('new' 'line') a) Error b) Output equivalent to print ‘new\nline’ Page No 22 c) newline d) new line

Last Answer : c) newline

Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Last Answer : c) Every sentence of first-order logic

Aniline reacts with mixed acid (conc. `HNO_(3)` and conc. `H_(2)SO_(4)`) at 288 K to give P (51%), Q (47%) and R(2%). The major product (s) of the fol

Description : Aniline reacts with mixed acid (conc. `HNO_(3)` and conc. `H_(2)SO_(4)`) at 288 K to give P (51%), Q (47%) and R(2%). The major product (s) of the fol

Last Answer : Aniline reacts with mixed acid (conc. `HNO_(3)` and conc. `H_(2)SO_(4)`) at 288 K to give P ... of the following reaction sequence is (are) B. C. D.

What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Description : What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Last Answer : c) Semantic interpretation

Which of the following perennials has more varieties? a. Geranium b. Helenium c. Verbena d. Ghazania 574 Which of the fol

Description : Which of the following perennials has more varieties? a. Geranium b. Helenium c. Verbena d. Ghazania 574 Which of the fol

Last Answer : Geranium

Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Description : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Last Answer : d) All of the mentioned

Buying on the basis Buying on the basis of price alone of price alone risks pr risks problems in each oblems in each of the fol of the following categories lowing categories except a. Capacity b. Quality c. Quantity d. Supplier

Description : Buying on the basis Buying on the basis of price alone of price alone risks pr risks problems in each oblems in each of the fol of the following categories lowing categories except a. Capacity b. Quality c. Quantity d. Supplier

Last Answer : b. Quality

Define FOL.

Description : Define FOL.

Last Answer : FOL is a first order logic. It is a representational language of knowledge which is powerful than propositional logic (i.e.) Boolean Logic. It is an expressive, declarative, compositional language. 

The agency that sits between the user and the UNIX system is called the A. logic B. profile C. shell D. erxc E. None of the above

Description : The agency that sits between the user and the UNIX system is called the A. logic B. profile C. shell D. erxc E. None of the above

Last Answer : C. shell

…………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly. A) Zombie B) Worm C) Trojan Horses D) Logic Bomb

Description : …………… programs can be used to accomplish functions indirectly that an unauthorized user could not accomplish directly. A) Zombie B) Worm C) Trojan Horses D) Logic Bomb

Last Answer : C) Trojan Horses

The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met. A) Trap doors B) Trojan horse C) Logic Bomb

Description : The …………….. is code embedded in some legitimate program that is set to “explode” when certain conditions are met. A) Trap doors B) Trojan horse C) Logic Bomb

Last Answer : C) Logic Bomb

The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events. A) Trap doors B) Trojan horse C) Logic Bomb D) Virus

Description : The ……….. is code that recognizes some special sequence of input or is triggered by being run from a certain user ID of by unlikely sequence of events. A) Trap doors B) Trojan horse C) Logic Bomb D) Virus

Last Answer : A) Trap doors

……………… is a tabular method for describing the logic of the decisions to be taken. A) Decision tables B) Decision tree C) Decision Method D) Decision Data

Description : ……………… is a tabular method for describing the logic of the decisions to be taken. A) Decision tables B) Decision tree C) Decision Method D) Decision Data

Last Answer : A) Decision tables

What will be the output of the following logic diagram? (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Description : What will be the output of the following logic diagram?  (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Last Answer : (C) x NOR y

Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above

Description : Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above

Last Answer : (A) Functional programming

In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q

Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q 

Last Answer : (B) Q 

Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Description : Which of the following statements is not correct? (A) HTML is not screen precise formatting language. (B) HTML does not specify a logic. (C) DHTML is used for developing highly interactive web pages. (D) HTML is a programming language.

Last Answer : (D) HTML is a programming language.

Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Description : Which of the following logic expressions is incorrect? (A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1 (C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 1

Last Answer : (C) 1 ⊕ 1 ⊕ 0 = 1

Which of the following logic operations is performed by the following given combinational circuit ? Image (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Description : Which of the following logic operations is performed by the following given combinational circuit ?  (A) EXCLUSIVE-OR (B) EXCLUSIVE-NOR (C) NAND (D) NOR

Last Answer : (A) EXCLUSIVE-OR

ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Description : ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Last Answer : Answer: 2  Explanation: Emitter-coupled logic (ECL) is the fastest of all logic families and therefore is used in applications where very high speed is essential. High speeds have become ... configuration, in which they are never driven into saturation and thereby the storage time is eliminated.

State which statement is true for Suspended process? i) The process is not immediately available for execution. ii) The process may be removed from suspended state automatically without removal order. A) i only B) ii only C) i and ii only D) None

Description : State which statement is true for Suspended process? i) The process is not immediately available for execution. ii) The process may be removed from suspended state automatically without removal order. A) i only B) ii only C) i and ii only D) None

Last Answer : A) i only

Unspecified address......................of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Unspecified address......................of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : B) (: : )

Loopback address ....................... of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Loopback address ....................... of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : A) (: : 1)

A …………………….. creates copies during replication that are functionally equivalent but have distinctly different bit patterns. A) Boot Sector Virus B) Polymorphic Virus C) Parasitic Virus D) Macro Virus

Description : A …………………….. creates copies during replication that are functionally equivalent but have distinctly different bit patterns. A) Boot Sector Virus B) Polymorphic Virus C) Parasitic Virus D) Macro Virus

Last Answer : B) Polymorphic Virus

Unspecified address ………………….. of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Unspecified address ………………….. of IPV6 address is equivalent to the IPV4 unspecified address 0.0.0.0. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : B) (: : )

Loopback address ……………………. of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Description : Loopback address ……………………. of IPv6 address is equivalent to the IPV4 loopback address 127.0.0.1. A) (: : 1) B) (: : ) C) (: : 0) D) (1 : : )

Last Answer : A) (: : 1)

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A, A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A, A→α1A | α2A | λ

Description : The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A,  A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Last Answer : (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. Which of the following is true? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Description : Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. ... and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Last Answer : (A) S1 is correct and S2 is not correct.

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Description : The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Last Answer : (A) A B + C * D + EF + G + /

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Description : Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Last Answer : (A + B^ D) / (E – F) + G

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

The equivalent hexadecimal notation for octal number 2550276 is: (A) FADED (B) AEOBE (C) ADOBE (D) ACABE

Description : The equivalent hexadecimal notation for octal number 2550276 is: (A) FADED (B) AEOBE (C) ADOBE (D) ACABE 

Last Answer : (C) ADOBE

The RST 7 instruction in 8085 microprocessor is equivalent to: (A) CALL 0010 H (B) CALL 0034 H (C) CALL 0038 H (D) CALL 003C H

Description : The RST 7 instruction in 8085 microprocessor is equivalent to: (A) CALL 0010 H (B) CALL 0034 H (C) CALL 0038 H (D) CALL 003C H

Last Answer : (C) CALL 0038 H

The octal number 326.4 is equivalent to (A) (214.2)10 and (D6.8)16 (B) (212.5)10 and (D6.8)16 (C) (214.5)10 and (D6.8)16 (D) (214.5)10 and (D6.4)16

Description : The octal number 326.4 is equivalent to (A) (214.2)10 and (D6.8)16 (B) (212.5)10 and (D6.8)16 (C) (214.5)10 and (D6.8)16 (D) (214.5)10 and (D6.4)16

Last Answer : (C) (214.5)10 and (D6.8)16

The hexadecimal equivalent of the octal number 2357 is: (1) 2EE (2) 2FF (3) 4EF (4) 4FE

Description : The hexadecimal equivalent of the octal number 2357 is: (1) 2EE (2) 2FF (3) 4EF (4) 4FE

Last Answer : Answer: 3 Explanation: (2357)8 can be converted into binary just digit by digit. = 010 011 101 111 Now we can regroup the bits into groups of 4 and convert to hexadecimal. = 0100 1110 1111 = 4EF

Convert the octal number 0.4051 into its equivalent decimal number. (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192

Description : Convert the octal number 0.4051 into its equivalent decimal number. (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192

Last Answer : Answer: 1 Explanation: (0.4051)8 = 4x8-1+0x8-2+5x8-3+1x8-4 = 0.5100098

Complete the following statement. The method of incorporating change into project planning and execution processes is called the: Select one: a. project logic diagram. b. change management process. c. milestone schedule d. critical path e. rough order of magnitude

Description : Complete the following statement. The method of incorporating change into  project planning and execution processes is called the: Select one: a. project logic diagram. b. change management process. c. milestone schedule d. critical path e. rough order of magnitude

Last Answer : b. change management process.

What is the equivalent of negative logic AND gate?

Description : What is the equivalent of negative logic AND gate?

Last Answer : Ans-Negative logic of AND gate is NAND.

What is the equivalent logic gate of a two-input NAND gate with both inputs inverted?

Description : What is the equivalent logic gate of a two-input NAND gate with both inputs inverted?

Last Answer : OR gate.

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

.............. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order

Description : .............. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order

Last Answer : (B) First-order

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search

Last Answer : (A) Breadth First Search

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)