Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal. (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.

Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal. (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal. 
by

1 Answer

Answer :

(B) The resolvent of two Horn clauses is a Horn Clause.
by

Related questions

A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Description : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal

Last Answer : (D) A clause that has at most one positive literal 

A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All

Description : A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All

Last Answer : b) At most one

Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic proposition on left side and a single atomic proposition on right side. (D) A single atomic proposition on left side or an empty left side.

Description : Horn clauses are special kinds of propositions which can be described as (A) Single atomic proposition on left side. (B) Single or multiple atomic proposition on left side. (C) A single atomic ... proposition on right side. (D) A single atomic proposition on left side or an empty left side.

Last Answer : (D) A single atomic proposition on left side or an empty left side.

Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Description : Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Last Answer : c) Generalized modus ponens

In the MOA there are 6 classes. We can alter all clauses expect one clause. What is that clause? A. Objects clause B. Name clause C. Association clause D. None of these

Description : In the MOA there are 6 classes. We can alter all clauses expect one clause. What is that clause? A. Objects clause B. Name clause C. Association clause D. None of these

Last Answer : C. Association clause

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Last Answer : (B) PROLOG is a Strongly Typed Language.

Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

Description : Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

Last Answer : d) First-order definite clauses

The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five

Last Answer : (C) Four Explanation:

Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Description : Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.

Last Answer : (B) SLR is powerful than LALR.

Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Description : Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Last Answer : A) Subset of X

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Description : Pointer holds A) Value of variable B) Address of variable C) Value and address of variable D) Always null

Last Answer : B) Address of variable

The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Description : The property of binary tree is A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty

Last Answer : D) The right subtree can be empty

The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Description : The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate

Last Answer : A) Like Predicate

…………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Description : …………….. is used to determine whether of a table contains duplicate rows. A) Unique predicate B) Like Predicate C) Null predicate D) In predicate

Last Answer : A) Unique predicate

NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Description : NULL is (A) the same as 0 for integer (B) the same as blank for character (C) the same as 0 for integer and blank for character (D) not a value

Last Answer : (D) not a value

Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above

Description : Which of the following is a legal expression in SQL? (A) SELECT NULL FROM EMPLOYEE; (B) SELECT NAME FROM EMPLOYEE; (C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; (D) None of the above

Last Answer : B) SELECT NAME FROM EMPLOYEE;

Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec

Last Answer : (B) 80 msec

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

Among the following which is not a horn clause? a) p b) Øp V q c) p → q d) p → Øq

Description : Among the following which is not a horn clause? a) p b) Øp V q c) p → q d) p → Øq

Last Answer : d) p → Øq

Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ? (A) not(G):– !, call(G), fail. not(G). (B) not(G):– call(G), !, fail. not(G). (C) not(G):– call(G), fail, !. not(G). (D) not(G):– call(G), fail. not(G):– !.

Description : Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ? (A) not(G):– !, call(G), fail. not(G). (B) not(G):– call(G), !, fail. not(G). (C) not(G):– call(G), fail, !. not(G). (D) not(G):– call(G), fail. not(G):– !.

Last Answer : (B) not(G):– call(G), !, fail. not(G).

What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Description : What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Last Answer : c) Generalized Modus Ponens

………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Description : ………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Last Answer : A) Mutual Exclusion

Which of the following are the principles tasks of the linker? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of the program. IV. Enforce access-control restrictions on system libraries. (A) I and II (B) I and III (C) II and III (D) I and IV

Description : Which of the following are the principles tasks of the linker? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of ... (A) I and II (B) I and III (C) II and III (D) I and IV

Last Answer : (B) I and III

System.in.read() is being used, the program must specify the .................. clause. A) throws.java.out.IOException B) throws.java.in.IOException C) throws.java.io.IOException D) throws.java.io.InException

Description : System.in.read() is being used, the program must specify the .................. clause. A) throws.java.out.IOException B) throws.java.in.IOException C) throws.java.io.IOException D) throws.java.io.InException

Last Answer : C) throws.java.io.IOException

……………..specifies a search condition for a group or an aggregate. A) GROUP BY Clause B) HAVING Clause C) FROM Clause D) WHERE Clause

Description : ……………..specifies a search condition for a group or an aggregate. A) GROUP BY Clause B) HAVING Clause C) FROM Clause D) WHERE Clause

Last Answer : B) HAVING Clause

In snapshot, …………………. clause tells oracle how long to wait between refreshes. A) Complete B) Force C) Next D) Refresh

Description : In snapshot, …………………. clause tells oracle how long to wait between refreshes. A) Complete B) Force C) Next D) Refresh

Last Answer : D) Refresh

…………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Description : …………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate

Last Answer : D) Predicate

……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Description : ……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by

Last Answer : C) Having

‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.

Description : ‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.

Last Answer : (B) Rename operation.

Which mathematical symbol set expresses a negated relationship? -Technology

Description : Which mathematical symbol set expresses a negated relationship? -Technology

Last Answer : Negated Relations symbols that express a negated relationship.

Which of the following conditions is not allowed in an RS latch? a. R is asserted, S is asserted b. R is asserted, S is negated c. R is negated, S is asserted d. R is negated, S is negated

Description : Which of the following conditions is not allowed in an RS latch? a. R is asserted, S is asserted b. R is asserted, S is negated c. R is negated, S is asserted d. R is negated, S is negated

Last Answer : a. R is asserted, S is asserted

If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if (A) h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

If a friends instigates you to participate actively in the strike but you disagree with them, then how will you react in this situation? Options: A) You indirectly co-operate them but not with the issues B) You will not participate actively as your consciousness does not allow you C) You first do your duties then something else D) You will launch a movement against your friends to resolve the conflict

Description : If a friends instigates you to participate actively in the strike but you disagree with them, then how will you react in this situation? Options: A) You indirectly co-operate them but not ... duties then something else D) You will launch a movement against your friends to resolve the conflict

Last Answer : C) You first do your duties then something else 

A hypothesis that States the nature (positive or negative) of the interaction between two or more variables is called a. Associated Hypothesis b. Casual Hypothesis c. Null Hypothesis d. Directional Hypothesis

Description : A hypothesis that States the nature (positive or negative) of the interaction between two or more variables is called a. Associated Hypothesis b. Casual Hypothesis c. Null Hypothesis d. Directional Hypothesis

Last Answer : d. Directional Hypothesis

A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced

Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced 

Last Answer : (A) degenerate

If a research finding is statistically significant, then ____. a. The observed result is probably not due to chance b. The observed result cannot possibly be due to chance c. The observed result is probably a chance result d. The null hypothesis of “no relationship” is probably true

Description : If a research finding is statistically significant, then ____. a. The observed result is probably not due to chance b. The observed result cannot possibly be due to chance c. The observed result is probably a chance result d. The null hypothesis of “no relationship” is probably true

Last Answer : a. The observed result is probably not due to chance

Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Description : Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Last Answer : (D) only surrogate keys

If a hypothesis says it should be positive, but in fact, it is negative, we call it a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis e) A true positive hypothesis

Description : If a hypothesis says it should be positive, but in fact, it is negative, we call it a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis e) A true positive hypothesis

Last Answer : c) A false positive hypothesis

True or false If two independent clauses are connected by a semicolon, the dotted line is slanted from one verb to the other.?

Description : True or false If two independent clauses are connected by a semicolon, the dotted line is slanted from one verb to the other.?

Last Answer : False. The correct answer is "If two independent clauses are connected by a semicolon, the dotted line goes straight from one verb to the other." (A+)

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Description : Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Last Answer : (D) θ(f(n) + g(n)) = max(f(n), g(n))

In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle

Description : In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle

Last Answer : (D) Toggle 

The major goal of inheritance in C++ is A) To facilitate the conversion of data types B) To help modular programming C) To facilitate the reusability of code D) To extend the capabilities of a class

Description : The major goal of inheritance in C++ is A) To facilitate the conversion of data types B) To help modular programming C) To facilitate the reusability of code D) To extend the capabilities of a class

Last Answer : D) To extend the capabilities of a class