书目名称 | Conceptual Structures: Applications, Implementation and Theory | 副标题 | Third International | 编辑 | Gerard Ellis,Robert Levinson,John F. Sowa | 视频video | http://file.papertrans.cn/236/235041/235041.mp4 | 丛书名称 | Lecture Notes in Computer Science | 图书封面 |  | 描述 | This book constitutes the proceedings of the Third International Conference on Conceptual Structures, ICCS ‘95, held in Santa Cruz, California in August 1995..Conceptual structures are a modern treatment of Peirce‘s existential graphs, a graphic notation for classical logic with higher order extensions. Besides three invited papers, there are included 21 revised full papers selected from 58 submission. The volume reflects the state-of-the-art in this research area of growing interest. The papers are organized in sections on natural language, applications, programming in conceptual graphs, machine learning and knowledge acquisition, hardware and implementation, graph operations, and ontologies and theory. | 出版日期 | Conference proceedings 1995 | 关键词 | Conceptual Graphs; Graph Operations; Graph-Operationen; Knowledge Representations; Konzeptuelle Graphen; | 版次 | 1 | doi | https://doi.org/10.1007/3-540-60161-9 | isbn_softcover | 978-3-540-60161-6 | isbn_ebook | 978-3-540-49539-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 | issn_series | 0302-9743 | copyright | Springer-Verlag Berlin Heidelberg 1995 |
1 |
Front Matter |
|
|
Abstract
|
2 |
,Syntax, semantics, and pragmatics of contexts, |
John F. Sowa |
|
Abstract
The notion of context is indispensable in discussions of meaning, but the word . has often been used in conflicting senses. In logic, the first representation of context as a formal object was by the philosopher C. S. Peirce; but for nearly eighty years, his treatment was unknown outside a small group of Peirce afficionados. In the early 1980s, three new theories included related notions of context: Kamp‘s .; Barwise and Perry‘s .; and Sowa‘s ., which explicitly introduced Peirce‘s approach to the AI community. More recently, John McCarthy and his students have begun to use a closely related notion of context as a basis for organizing and partitioning knowledge bases. Each of the theories has distinctive, but complementary ideas that can enrich the others, but the relationships between them are far from clear. This paper analyzes the semantic foundations of these theories and shows how McCarthy‘s ist(.) predicate can be interpreted in terms of the semantic notions underlying the others.
|
3 |
,Ontology revision, |
Norman Foo |
|
Abstract
Knowledge systems as currently configured are static in their concept sets. As knowledge maintenance becomes more sophisticated, the need to address issues concerning dynamic concept sets will naturally arise. Such dynamics is properly called ontology revision, or in the simpler case, expansion. A number of sub-disciplines in artificial intelligence, philosophy and recursion theory have results that are relevant to ontology expansion even though their motivations were quite different. More recently in artificial intelligence ontologies have been explicitly considered. This paper is partly a summary of early results, and partly an account of ongoing work in this area.
|
4 |
,A triadic approach to formal concept analysis, |
Fritz Lehmann,Rudolf Wille |
|
Abstract
, developed during the last fifteen years, has been based on the dyadic understanding of a concept constituted by its extension and its intension. The pragmatic philosophy of Charles S. Peirce with his three universal categories, and experiences in data analysis, have suggested a triadic approach to Formal Concept Analysis. This approach starts with the primitive notion of a . defined as a quadruple (.) where ., and . are sets and . is a ternary relation between ., and ., i.e. . ⊑ G×.×.; the elements of ., and . are called ., and ., respectively, and (.) ε . is read: the object . has the attribute . (or .) the condition . A . of a triadic context (.) is defined as a triple (., ., .) with .× .sx . ⊑ . which is maximal with respect to component-wise inclusion. The triadic concepts are structured by three quasiorders given by the inclusion order within each of the three components. In analogy to the dyadic case, we discuss how the ordinal structure of the triadic concepts of a triadic context can be analysed and graphically represented. A basic result is that those structures can be understood order-theoretically as “.” up to isomorphism.
|
5 |
,Automatic integration of digital system requirements using schemata, |
R. Y. Kamath,W. R. Cyre |
|
Abstract
Natural language and diagrams of various types are commonly used for specifications on digital systems containing descriptions and requirements. The objective of the research reported here is to develop an algorithm for the automatic integration of requirements using schemata to aid in the automatic detection and joining of common references (coreferences) to objects in natural language and other specifications. This paper describes a rule-based algorithm for the integration of requirements which are expressed as conceptual graphs. The algorithm uses design knowledge in the form of schemas to detect coreferences and perform joins. The algorithm is demonstrated by a small example.
|
6 |
,Service trading using conceptual structures, |
A. Puder,S. Markwitz,F. Gudermann |
|
Abstract
An open distributed environment can be perceived as a service market where services are freely offered and requested. Any infrastructure which seeks to provide appropriate mechanisms for such environments has to include some mediator functionality to bring together matching service requests and service offers. The matching algorithm that the mediator must perform commonly builds upon an IDL—based type definition for service specification. We propose a type specification notation based upon conceptual graphs to support the cognitive domain of application users. In our framework the trader implements a matching algorithm as well as a learning algorithm which are tailored to service trading in open environments.
|
7 |
,Sentence generation from conceptual graphs, |
Nicolas Nicolov,Chris Mellish,Graeme Ritchie |
|
Abstract
This paper describes a technique for translating the semantic information encoded in a conceptual graph into an English language sentence. The use of a non-hierarchically structured semantic representation (conceptual graphs) allows us to investigate a more general version of the sentence generation problem where one is not pre-committed to a choice of the syntactically prominent elements in the initial semantics. We show clearly how the semantic structure is declaratively related to linguistically motivated syntactic representation. Our technique provides flexibility to address cases where the entire input cannot be precisely expressed in a single sentence.
|
8 |
,Discourse spaces: A pragmatic interpretation of contexts, |
Bernard Moulin |
|
Abstract
In human interactions the context in which verbal and non-verbal acts are performed has a prime importance. In this paper we propose an approach emphasizing the cognitive dimension of contexts. Our basic assumption is that a human agent naturally uses contextual information because she cannot manipulate or communicate knowledge without positioning herself relatively to that knowledge. We introduce the notion of . a pragmatic form of context which is used to structure knowledge contained in a discourse. Discourse spaces are created, updated or evoked by an agent who tries to generate or understand a discourse. We extend the basic conceptual graph framework with notions like temporal objects, temporal localizations and different kinds of discourse spaces: situations, definitional and focal DSs. Then, we present agent-related DSs (narrator‘s and agent‘s perspectives, agent‘s attitudes) and inference-related discourse spaces (conditional, alternative, generalized, hypothetical and counterfactual DSs). We also show how these DSs are interleaved in the representation of a discourse.
|
9 |
,A pragmatic representational approach of context and reference in discourses, |
Bernard Moulin |
|
Abstract
Apart from general rules or laws, knowledge must be considered with respect to the agents that manipulate or communicate it. We introduced the notion of . which refers to constructs which are created, updated or evoked by an agent who tries to generate or understand a discourse. Our approach which is based on a generalization of Sowa‘s conceptual graph theory is used to explain a variety of referential mechanisms such as indexicality, metonymy, referential opacity and transparency.
|
10 |
,Using the conceptual graphs operations for natural language generation in medicine, |
J. C. Wagner,R. H. Baud,J. -R. Scherrer |
|
Abstract
Natural language generation systems for the medical domain have to take into account the specific domain vocabulary as well as the particular language style of a highly conventionalised language. This is particularily relevant for multilingual generation..We have developed a system for multilingual natural language generation in medicine, based on the Conceptual Graphs formalism and using a semantic model of medicine. The latter is being developed as part of the European project GALEN and it intends to be a language-independent, semantically valid model of clinical terminology..Within the system we make intensive use of the operations defined in the Conceptual Graphs formalism in order to deal with the specific requirements of the medical language, multilinguality and the specific modelling style encountered within the GALEN-model. The approach has been applied to several languages, with a main focus on English and French. It has also been used within a clinical demonstrator application.
|
11 |
,Table 10 left without paying the bill! a good reason to treat metonymy with conceptual graphs, |
Tassadit Amghar,Françoise Gayral,Bernard Levrat |
|
Abstract
Metonymy is a valuable test bed to appreciate the adequacy of a model of referential mechanisms occurring in natural language surface forms. Our concern in this paper is to propose an alternative treatment to deal with metonymy. We benefit considerably from the ability of conceptual graphs to express semantic norms for implementing a kind of preferential semantics and make special use of its normative apparatus including the type lattice used in the application, canonical graphs, conformity relation. The originality of our approach concerns two main points:.First, we treat not only nominal metonymies, as traditional works do, but also verbal ones. Whereas verb is always, in these approaches, considered as steady, we consider that the verbal operator itself can be a metonymical reference. This not only enlarges the field covered but also allows us to reach more realistic solutions..The second point concerns the use of classical metonymy typologies. Canned metonymies may intervene in two ways, as guides and as filters; in the first case, they render the combinatorial problem manageable by focusing the search during the resolution; in the second case, they are a means to rank the rele
|
12 |
,Object-oriented conceptual graphs, |
Gerard Ellis |
|
Abstract
In this paper a state based view of conceptual graphs borrowed from the Object-Z program specification language is introduced. This new view is contrasted with the object-oriented model developed by Sowa [5]. The new model is demonstrated by reducing Sowa‘s example proof from 18 steps to 4 steps. The new model uses relations connecting object pre-states and post-states to represent object methods, rather than using messages as concepts as in Sowa‘s version. We argue that the new model is clearer because it is based on a simple state transition and that this leads to more efficient theorem proving and programming.
|
13 |
,A direct proof procedure for definite conceptual graph programs, |
Bikash Chandra Ghosh,Vilas Wuwongse |
|
Abstract
Conceptual graphs form the basis of a graph-based existential-conjunctive logic. In this paper, first, we illustrate the problems associated with a proof procedure for conceptual graph programs and then specify the definitions of a normal form representation for a conceptual graph program, an anti-normal form representation for a goal, and a conceptual graph unification procedure called CG unification. Next, we develop a direct proof procedure for definite conceptual graph programs, called CGF-derivation. The proof procedure takes advantage of the normal form of a definite conceptual graph program and the anti-normal form of a goal, and utilizes the CG unification procedure for matching conceptual graphs. Finally, we prove that the proposed CGF-derivation procedure is sound and complete.
|
14 |
,Conceptual clustering of complex objects: A generalization space based approach, |
Isabelle Bournaud,Jean-Gabriel Ganascia |
|
Abstract
A key issue in learning from observations is to build a classification of given objects or situations. . address this problem of recognizing regularities among a set of objects that have not been pre-classified, so as to organize them into a hierarchy of concepts. Early approaches have been limited to unstructured domains, in which objects are described by fixed sets of attribute-value pairs. Recent approaches in structured domains use a first order logic based representation to represent complex objects. The problem addressed in this paper is to provide a basis for the analysis of complex objects clustering represented using conceptual graphs formalism. We propose a new clustering method that extracts a hierarchical categorization of the provided objects from an explicit space of concepts hierarchies, called .. We give a general algorithm and expose several complexity factors. This algorithm has been implemented in a system called .. We provide some empirical results on its use to cluster a large database of Chinese characters.
|
15 |
,Using empirical subsumption to reduce the search space in learning, |
Marc Champesme |
|
Abstract
In the traditional learning framework, hypothesis that are not equivalent with respect to the standard subsomption relation can be equivalent from the learning‘s point of view. We define in this paper a new subsumption relation, called empirical subsumption, that allows to take into account this fact. This new subsomption relation is then used to define a particular kind of search space reduction that do not reduce the class of learnable concepts. Then, we show that theses theoretical results can be applied when the knowledge representation formalism is the conceptual graph formalism.
|
16 |
,A new parallelization of subgraph isomorphism refinement for classification and retrieval of concep |
James D. Roberts |
|
Abstract
Major applications of conceptual structures will require quick response times on extremely large knowledge bases. Although algorithmic developments have provided tremendous improvements in speed, we believe implementation on parallel processors will be needed to meet long-term needs. This paper presents a new parallelization of a subgraph isomorphism refinement algorithm for performing projection tests and retrieving conceptual structures (CS). The improved algorithm is faster, requires fewer processors, and is compatible with recent relation-based representations of CS..The new parallelization takes advantage of the features of contemporary massively parallel machines by exploiting bit-parallelism in the data words. Processing numerous CS on a single parallel array using load balancing integrated with multi-level indexed search, it combines the strengths of prior parallel subgraph isomorphism parallelizations. It incorporates lattice codes of the concept-type hierarchy, forming all node candidate binding lists in parallel. Simulation results of the behavior of the refinement algorithm with parameterized synthetic data sets are presented.
|
17 |
,Transputer network implementation of a parallel projection algorithm for conceptual graphs, |
Alfred Chan,Pavel Kocura |
|
Abstract
The design, implementation on a network of transputers, and testing of a parallel projection algorithm which differs from traditional methods is described. A new automated testbed generator which produces large, complex CGs knowledge bases for testing CGs systems, is introduced and discussed. Extensive tests, using automatically generated data, show that the algorithm is scalable and free from excessive communication overhead. A parallel version of the Peirce-logic-based theorem prover is suggested.
|
18 |
,Spanning tree representations of graphs and orders in conceptual structures, |
Andrew Fall |
|
Abstract
Graphs and partial orders are fundamental to conceptual structures theory. Conceptual graphs are used in the knowledge base and canonical basis as well as for type and conceptual relation definitions. Partial orders are used to specify the associations among types and relations, as well as graphs in the generalization hierarchy. The speed with which basic operations on these structures can be achieved will have a pronounced effect on efficiency. In this paper we explore the use of spanning trees as underlying representations of graphs and partial orders, and their effect on storage and operational efficiency. The simple structure of trees can be exploited to improve matching and joins of graphs (through normalization), to refine search algorithms on orders, and for taxonomic encoding. Although this inquisition is preliminary in nature, we provide some useful techniques for gaining efficiency through the use of spanning trees, including an implementation with a special form of feature term.
|
19 |
,An implementation model for contexts and negation in conceptual graphs, |
John Esch,Robert Levinson |
|
Abstract
An implementation model for a retrieval and inference system based on the theory of conceptual graphs is presented. Several hard issues related to the full implementation of the theory are taken up and solutions presented. The solutions attempt to exploit existing but not fully recognized symmetries in CG theory. These symmetries include those between formation and inference rules, AND and OR, positive and negative, copy and restrict, general and specific, etc. Topics taken up include the implementation of Sowa‘s formation rules, the storage of a conceptual graph hierarchy involving contexts and negation as a conjunctive normal form (CNF) lattice, the extension of existing retrieval algorithms, such as Levinson‘s Method III and UDS, to handle complex referents and nested contexts, the checking of consistency, and the definition of Peirce‘s inference rules in terms of formation rules. A distinction is made between syntactic implication and semantic implication. The issues tackled in the paper lay the foundation for a full scale graph-based first-order logic theorem prover.
|
20 |
,A linear descriptor for conceptual graphs and a class for polynomial isomorphism test, |
O. Cogis,O. Guinaldo |
|
Abstract
The isomorphism problem is not known to be NP-complete nor polynomial. Yet it is crucial when maintaining large conceptual graphs databases. Taking advantage of conceptual graphs specificities, whenever, by means of structural functions, a linear order of the conceptual nodes of a conceptual graph . can be computed as invariant under automorphism, a descriptor is assigned to . in such a way that any other conceptual graph isomorphic to . has the same descriptor and conversely. The class of conceptual graphs for which the linear ordering of the conceptual nodes succeeds is compared to other relevant classes, namely those of locally injective, .-rigid and irredundant conceptual graphs. Locally injective conceptual graphs are proved to be irredundant, thus linearly ordered by the specialization relation.
|
书目名称Conceptual Structures: Applications, Implementation and Theory影响因子(影响力) 
书目名称Conceptual Structures: Applications, Implementation and Theory影响因子(影响力)学科排名 
书目名称Conceptual Structures: Applications, Implementation and Theory网络公开度 
书目名称Conceptual Structures: Applications, Implementation and Theory网络公开度学科排名 
书目名称Conceptual Structures: Applications, Implementation and Theory被引频次 
书目名称Conceptual Structures: Applications, Implementation and Theory被引频次学科排名 
书目名称Conceptual Structures: Applications, Implementation and Theory年度引用 
书目名称Conceptual Structures: Applications, Implementation and Theory年度引用学科排名 
书目名称Conceptual Structures: Applications, Implementation and Theory读者反馈 
书目名称Conceptual Structures: Applications, Implementation and Theory读者反馈学科排名 
|
|
|