Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Which will be the instance of the class datalog knowledge bases?

a) Variables

b) No function symbols

c) First-order definite clauses

d) None of the mentioned
by

1 Answer

Answer :

b) No function symbols
by

Related questions

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

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

What kind of clauses are available in Conjunctive Normal Form? a) Disjunction of literals b) Disjunction of variables c) Conjunction of literals d) Conjunction of variables

Description : What kind of clauses are available in Conjunctive Normal Form? a) Disjunction of literals b) Disjunction of variables c) Conjunction of literals d) Conjunction of variables

Last Answer : a) Disjunction of literals

Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Description : Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Last Answer : a) First-order definite clause are similar to propositional forward chaining

What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Description : Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this

Last Answer : C) this

State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Description : State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Last Answer : B) i-false, ii-true

Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Description : Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Last Answer : a) Temporal model

How the entries in the full joint probability distribution can be calculated? a) Using variables b) Using information c) Both Using variables & information d) None of the mentioned

Description : How the entries in the full joint probability distribution can be calculated? a) Using variables b) Using information c) Both Using variables & information d) None of the mentioned

Last Answer : b) Using information

Which is unique up to renaming of variables? a) Unifier b) Most general unifier c) Unifier & Most general unifier d) None of the mentioned

Description : Which is unique up to renaming of variables? a) Unifier b) Most general unifier c) Unifier & Most general unifier d) None of the mentioned

Last Answer : b) Most general unifier

What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

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

Can static method access instance variables ?

Description : Can static method access instance variables ?

Last Answer : Ans. Though Static methods cannot access the instance variables directly, They can access them using instance handler.

What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual pre-terminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) ... d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written

How many proposition symbols are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

Description : How many proposition symbols are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

Which is used to construct the complex sentences? a) Symbols b) Connectives c) Logical connectives

Description : Which is used to construct the complex sentences? a) Symbols b) Connectives c) Logical connectives

Last Answer : c) Logical connectives

What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual preterminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins ... ) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written

The symbols used in describing the syntax of a programming language are __________ a) 0 b) {} c) “” d) <>

Description : The symbols used in describing the syntax of a programming language are __________ a) 0 b) {} c) “” d)

Last Answer : d)

Conventional Artificial Intelligence is different from soft computing in the sense A. Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal with fuzzy logic B. Conventional Artificial Intelligence methods are limited by symbols where as soft computing is based on empirical data C. Both (a) and (b) D. None of the above

Description : Conventional Artificial Intelligence is different from soft computing in the sense A. Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal with fuzzy logic B. Conventional Artificial ... empirical data C. Both (a) and (b) D. None of the above

Last Answer : C. Both (a) and (b

Symbols, symbolic expressions and computing with those is at the core of ______ A. LISP B. ELIZA C. PROLOG D. NLP

Description : Symbols, symbolic expressions and computing with those is at the core of ______ A. LISP B. ELIZA C. PROLOG D. NLP

Last Answer : A. LISP A. LISP

______ is used for AI because it supports the implementation of software that computes with symbols very well. A. LISP B. ELIZA C. PROLOG D. NLP

Description : ______ is used for AI because it supports the implementation of software that computes with symbols very well. A. LISP B. ELIZA C. PROLOG D. NLP 

Last Answer : A. LISP 

What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Description : What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

Last Answer : b) Separate words into individual morphemes and identify the class of the morphemes

What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label

Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Description : Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned

Last Answer : b) Knowledge base

Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

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

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Description : Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Last Answer : a) Propositions

The primitives in probabilistic reasoning are random variables. a) True b) False

Description : The primitives in probabilistic reasoning are random variables. a) True b) False

Last Answer : a) True

A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Last Answer : d) Both Literals & Actions

The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Description : The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Last Answer : a) True

How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Define runtime variables.

Description : Define runtime variables.

Last Answer : Plans to gather and use information are represented using short hand  Notation called runtime variables (n).  Example  [Look up (Agent, “Phone number (Divya)”.N), Dial (n)]

What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Last Answer : a) Planning problem

What is the other name of each and every total-order plans? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each and every total-order plans? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Description : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Last Answer : a) Depends on the nodes

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Last Answer : b) It prints the result returned by the function

In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Last Answer : a) (setq a 10)

What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Description : What is back propagation? a) It is another name given to the curvy function in the perceptron b) It is the transmission of error back through the network to adjust the inputs c) It is the ... the network to allow weights to be adjusted so that the network can learn d) None of the mentioned

Last Answer : c) It is the transmission of error back through the network to allow weights to be adjusted so that the network can learn

Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Last Answer : d) All of the mentioned

What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Description : What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Last Answer : b) Unrealizable

Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Description : Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned

Last Answer : a) Evaluation function

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Last Answer : d) All of the mentioned