Topic
Knowledge representation and reasoning
About: Knowledge representation and reasoning is a research topic. Over the lifetime, 20078 publications have been published within this topic receiving 446310 citations. The topic is also known as: KR & KR².
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper shows, how a new object categorization system is set up by a knowledge acquisition and learning phase and then used by anobject categorization phase.
95 citations
•
TL;DR: UPON is presented, a methodology for ontology building derived from the Unified Software Development Process, and a comparative evaluation with other methodologies, as well as the results of its adoption in the context of the Athena Integrated Project.
Abstract: Ontologies are the backbone of the Semantic Web, a semantic-aware version of the World Wide Web. To the end of making available large-scale, high quality domain ontologies, effective and usable methodologies are needed to facilitate the process of Ontology Building. Many of the methods proposed so far only partly refer to well-known and widely used standards from other areas, like software engineering and knowledge representation. In this paper we present UPON, a methodology for ontology building derived from the Unified Software Development Process. A comparative evaluation with other methodologies, as well as the results of its adoption in the context of the Athena Integrated Project, are also discussed.
95 citations
••
TL;DR: This paper describes a belief network engineering process based on the spiral system lifecycle model that facilitates tracing of the rationale for modeling decisions, as well as supporting maintenance and enhancement of the knowledge base.
Abstract: The construction of a large, complex belief network model, like any major system development effort, requires a structured process to manage system design and development. This paper describes a belief network engineering process based on the spiral system lifecycle model. The problem of specifying numerical probability distributions for random variables in a belief network is best treated not in isolation, but within the broader context of the system development effort as a whole. Because structural assumptions determine which numerical probabilities or parameter values need to be specified, there is an interaction between specification of structure and parameters. Evaluation of successive prototypes serves to refine system requirements, ensure that modeling and elicitation effort are focused productively, and prioritize directions of enhancement and improvement for future prototypes. Explicit representation of semantic information associated with probability assessments facilitates tracing of the rationale for modeling decisions, as well as supporting maintenance and enhancement of the knowledge base.
95 citations
••
TL;DR: A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs, and it is proved that inheritance does not cause any computational overhead.
Abstract: The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP<. The complexity of DLP< is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP< has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP< to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP< language has been implemented on top of the DLV system and has subsequently been integrated into DLV.
95 citations
••
TL;DR: Using the proof planner of the Ω mega system, the approach for the mathematical domain of limit theorems, which was proposed as a challenge to automated theorem proving by the late Woody Bledsoe, is demonstrated.
94 citations