Ontologies
2003 AAAI Spring Symposium Series
Abecker, Andreas, Antonsson, Erik K., Callaway, Charles B., Dignum, Virginia, Doherty, Patrick, Elst, Ludger van, Freed, Michael, Freedman, Reva, Guesgen, Hans, Jones, Gareth, Koza, John, Kortenkamp, David, Maybury, Mark, McCarthy, John, Mitra, Debasis, Renz, Jochen, Schreckenghost, Debra, Williams, Mary-Anne
The Association for the Advancement of Artificial Intelligence, in cooperation with Stanford University's Department of Computer Science, presented the 2003 Spring Symposium Series, Monday through Wednesday, 24-26 March 2003, at Stanford University. The titles of the eight symposia were Agent-Mediated Knowledge Management, Computational Synthesis: From Basic Building Blocks to High- Level Functions, Foundations and Applications of Spatiotemporal Reasoning (FASTR), Human Interaction with Autonomous Systems in Complex Environments, Intelligent Multimedia Knowledge Management, Logical Formalization of Commonsense Reasoning, Natural Language Generation in Spoken and Written Dialogue, and New Directions in Question-Answering Motivation.
Ontologies for Corporate Web Applications
Obrst, Leo, Liu, Howard, Wray, Robert
In this article, we discuss some issues that arise when ontologies are used to support corporate application domains such as electronic commerce (ecommerce) and some technical problems in deploying ontologies for real-world use. In particular, we focus on issues of ontology integration and the related problem of semantic mapping, that is, the mapping of ontologies and taxonomies to reference ontologies to preserve semantics. Along the way, we discuss what typically constitutes an ontology architecture. We situate the discussion in the domain of business-to-business (B2B) e-commerce. By its very nature, B2B e-commerce must try to interlink buyers and sellers from multiple companies with disparate product-description terminologies and meanings, thus serving as a paradigmatic case for the use of ontologies to support corporate applications.
The Process Specification Language (PSL) Theory and Applications
Gruninger, Michael, Menzel, Christopher
The PROCESS SPECIFICATION language (PSL) has been designed to facilitate correct and complete exchange of process information among manufacturing systems, such as scheduling, process modeling, process planning, production planning, simulation, project management, work flow, and business-process reengineering. We give an overview of the theories within the PSL ontology, discuss some of the design principles for the ontology, and finish with examples of process specifications that are based on the ontology.
Sweetening WORDNET with DOLCE
Gangemi, Aldo, Guarino, Nicola, Masolo, Claudio, Oltramari, Alessandro
Despite its original intended use, which was very different, WORDNET is used more and more today as an ontology, where the hyponym relation between word senses is interpreted as a subsumption relation between concepts. In this article, we discuss the general problems related to the semantic interpretation of WORDNET taxonomy in light of rigorous ontological principles inspired by the philosophical tradition. Then we introduce the DOLCE upper-level ontology, which is inspired by such principles but with a clear orientation toward language and cognition. We report the results of an experimental effort to align WORDNET's upper level with DOLCE. We suggest that such alignment could lead to an "ontologically sweetened" WORDNET, meant to be conceptually more rigorous, cognitively transparent, and efficiently exploitable in several applications.
Ontology Research
In this issue, I have collected a fairly broad, although by no means exhaustive, sampling of work in the field of ontology research. To define a field is often quite difficult; it is more a collection of people and ideas than it is a specific technology. To represent our field, I present six articles that cover several of the major thrusts of ontology research from the past decade.
Ray Reiter's Knowledge in Action: A Review
We can only state these relationships by adding axioms of some sort. Getting the axioms right, and getting algorithms based on them right, has not been easy. As a result, the basic situation calculus lived as a textbook curiosity for several years. Researchers interested in practical applications of temporal reasoning, such as automated planning, kept the basic ontology of the and execution. Haas (1987), Schubert (1990), and not hold true. To express the papers that have given new life to of Reiter (1991), breathed new fact that adopting a person makes the attempt to formalize realistic reasoning life into the situation calculus (Mc-him/her one's child, we might write in temporal contexts.
The AAAI-02 and IAAI-02 Conferences
The Eighteenth National Conference on Artificial Intelligence (AAAI-02) and the Fourteenth Conference on Innovative Applications of AI (IAAI- 02) were positively received by those who attended. This report provides a few snapshots of the vast and varied content of the 2002 conferences. Proceedings of AAAI-02 and IAAI-02 are available from AAAI Press (www.- aaaipress.org).
Human Language Technology and Knowledge Management
This article summarizes the results of the 6-7 July Workshop on Human Language Technology and Knowledge Management held in Toulouse, France. It describes invited keynotes, presentations, and results of brainstorming sessions to create a technology road map for this important area. The group also articulated grand challenges in human language technology and solutions to these challenges that could benefit facilities for knowledge discovery, access, and exploitation.
Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints
Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given in terms of positive, conjunctive, existential FOL. We present here a family of extensions of this model, based on rules and constraints, keeping graph homomorphism as the basic operation. We focus on the formal definitions of the different models obtained, including their operational semantics and relationships with FOL, and we analyze the decidability and complexity of the associated problems (consistency and deduction). As soon as rules are involved in reasonings, these problems are not decidable, but we exhibit a condition under which they fall in the polynomial hierarchy. These results extend and complete the ones already published by the authors. Moreover we systematically study the complexity of some particular cases obtained by restricting the form of constraints and/or rules.