Skip to main content
main-content

Über dieses Buch

Reasoning and Unification over Conceptual Graphs is an exploration of automated reasoning and resolution in the expanding field of Conceptual Structures. Designed not only for computing scientists researching Conceptual Graphs, but also for anyone interested in exploring the design of knowledge bases, the book explores what are proving to be the fundamental methods for representing semantic relations in knowledge bases. While it provides the first comprehensive treatment of Conceptual Graph unification and reasoning, the book also addresses fundamental issues of graph matching, automated reasoning, knowledge bases, constraints, ontology and design. With a large number of examples, illustrations, and both formal and informal definitions and discussions, this book is excellent as a tutorial for the reader new to Conceptual Graphs, or as a reference book for a senior researcher in Artificial Intelligence, Knowledge Representation or Automated Reasoning.

Inhaltsverzeichnis

Frontmatter

Chapter 1. Conceptual Structures

Abstract
Conceptual Graphs are a flexible, extensible method for knowledge representation. They are able to contain the knowledge of a domain, describe the relationship of parts of that knowledge to other parts, and to validate the knowledge against the meta-knowledge of the domain.
Dan Corbett

Chapter 2. Unification, Knowledge Structures and Constraints

Abstract
This chapter discusses the relationships between unification, knowledge structures, and Constraint Logic Programming. First, each of these fields is introduced, and the relevant literature reviewed. Then the recent research in each area is compared to each of the others. We find that there is a great deal of overlap in these fields of research, and that each field already contributes to the others. Finally, the interaction among these three fields is brought into the arena of Conceptual Graph research, and we examine how these fields contribute there.
Dan Corbett

Chapter 3. An Algorithm for the Unification of Conceptual Graphs with Constraints

Abstract
Constraint Satisfaction Problems (CSP) are a well-understood and well-researched area, and many tools exist to handle CSP [Cohen 1990; Frost and Dechter 1994; Gini and Rogialli 1994; Van Hentenryck et al. 1997]. These languages and tools are excellent at handling real numbers, and simultaneous equations. However, most still fall short in representation power, as they lack sufficiently complex knowledge structures to represent the knowledge of many interesting domains, as will be discussed in Chapter Four.
Dan Corbett

Chapter 4. Results, Demonstrations and Comparisons

Abstract
Our main focus so far has been the formal definition of a unification and constraint tool over conceptual structures. We now demonstrate the significance of this extended Conceptual Graph model defined in the first three chapters. This chapter will present the results of applying that tool to real-world domains.
Dan Corbett

Chapter 5. Placing the Unification Model in Context

Abstract
This chapter will explore how the unification model presented in this thesis can become part of a practical set of software tools for the Conceptual Graph designer, programmer and user. We examine some methods for organizing the new extensions and the old formalism into a unified set of tools. This new organization will show how these tools can be compared to each other for usefulness in a given domain or set of software.
Dan Corbett

Chapter 6. Conclusions and Future Work

Abstract
This research has addressed two important areas in the field of Conceptual Structures. The first is the unification of Conceptual Graphs, and the consequent work in projection and in type hierarchies. The second is the definition of constraints, especially real-value constraints on the concept referents, with particular attention to handling constraints during the unification of Conceptual Graphs.
Dan Corbett

Backmatter

Weitere Informationen