Machine-translated by Google. Questions are authored in English.
Top

Knowledge Representation Questions and Answers

Answer: C

Event calculus uses time points and intervals directly, so concurrent events and events with duration are natural, whereas situation calculus threads a sequence of situations through the description. Preconditions and participants are representable in both. The closed world assumption is often used with event calculus but is not required. Choosing between an explicit timeline and a chain of situations determines how easily concurrency and duration can be expressed, which is usually the deciding consideration.

Please log in or register to report this question.

Answer: D

A knowledge graph stores entities as nodes and typed relations as edges, at a scale of billions of assertions, and is used to answer queries and to ground search results. It is the descendant of the semantic network, given a formal basis and industrial scale. Growth plots, rule diagrams and proof structures are different objects. That an idea criticised for lacking semantics returned at enormous scale once the semantics were supplied is a fair summary of the field's history here.

Please log in or register to report this question.

Answer: A

RDF expresses everything as subject predicate object triples, which is exactly a labelled edge in a graph and is simple enough to be exchanged between systems that agree on nothing else. Definitions, rules and probabilities are layered on top by other standards. The minimal common structure of a labelled directed edge is what allows data from many sources to be merged without prior agreement about schema, which was the design goal.

Please log in or register to report this question.

Answer: B

Any relational fact can be broken into labelled edges, so two data sets can be merged by concatenating their triples without any schema negotiation. That is the whole design argument. Storage is if anything worse than a table, relational databases store tuples of higher arity, and contradictions merge as freely as anything else. Choosing the smallest common structure, so that agreement is required about as little as possible, is the design principle behind most successful interchange formats.

Please log in or register to report this question.

Answer: C

OWL supplies a description logic semantics, so a reasoner can compute subsumption, detect inconsistency and infer class membership rather than merely retrieving stored edges. Querying is the role of a separate language, and compression and access control are engineering concerns. Layering inference on top of an interchange format, rather than building it in, is what allows the same data to be used by systems that reason and by systems that merely store.

Please log in or register to report this question.

Answer: D

Adopting a description logic fragment ensures that subsumption and consistency remain decidable, and several profiles trade expressiveness against complexity for different applications. Readability, storage and contradiction are not the reason. That a standard intended for enormous data volumes should choose its logic for tractability rather than power is the same trade that runs through the whole subject, made explicit in a published specification.

Please log in or register to report this question.

Answer: A

Instance checking asks whether the asserted facts entail that a particular individual falls under a concept, which is how a reasoner classifies data rather than merely retrieving it. Non-emptiness, validation and counting are different queries. Together with subsumption it makes up the two standard reasoning services, one about concepts and one about individuals, and keeping them distinct clarifies what a reasoner is being asked to do.

Please log in or register to report this question.

Answer: B

The TBox holds the concept definitions and the subsumption axioms, while the ABox holds the assertions about individuals, and separating them lets the taxonomy be computed once and reused across changing data. Vocabulary lists and inference rules are different things. Dividing a knowledge base into a slowly changing schema and rapidly changing data is the same separation a database makes, and it has the same practical benefits.

Please log in or register to report this question.

Answer: C

Classifying the concept hierarchy is expensive and need be done only when the definitions change, whereas instance data arrives continuously and is checked against the existing taxonomy. The same reasoner handles both. Expressibility and standards are not the reason. Separating what is stable from what is volatile, so that expensive computation is done on the stable part, is a design pattern that appears wherever a schema and its data are distinguished.

Please log in or register to report this question.

Answer: D

Roles are the binary relations, such as has parent or works for, from which complex concepts are built using restrictions and quantifiers. Concepts are the unary predicates. Event participation is a use of roles rather than the definition, and functional roles are a special case. Building complex concept descriptions out of atomic concepts and roles, rather than asserting them, is what allows the hierarchy to be computed rather than declared.

Please log in or register to report this question.

Loading…

Other Subjects

Tags: Knowledge Representation Questions and Answers || Knowledge Representation MCQ Questions and Answers || Knowledge Representation GK Questions and Answers || Knowledge Representation GK MCQ Questions || Knowledge Representation Multiple Choice Questions and Answers || Knowledge Representation GK || GK on Knowledge Representation || Artificial Intelligence Questions and Answers || Artificial Intelligence MCQ Questions and Answers || Artificial Intelligence GK Questions and Answers || GK on Artificial Intelligence