Conceptual Structures: Theory, Tools and Applications: 6th International Conference on Conceptual Structures, ICCS'98, Montpellier, France, August, ... (Lecture Notes in Computer Science, 1453)
معرفی کتاب «Conceptual Structures: Theory, Tools and Applications: 6th International Conference on Conceptual Structures, ICCS'98, Montpellier, France, August, ... (Lecture Notes in Computer Science, 1453)» نوشتهٔ Marie-Laure Mugnier (editor), Michel Chein (editor)، منتشرشده توسط نشر Springer Spektrum. in Springer-Verlag GmbH در سال 1998. این کتاب در 8 صفحه، فرمت djvu، زبان انگلیسی ارائه شده است.
This book constitutes the refereed proceedings of the 6th International Conference on Conceptual Structures, ICCS'98, held in Montpellier, France, in August 1998. The 20 revised full papers and 10 research reports presented were carefully selected from a total of 66 submissions; also included are three invited contributions. The volume is divided in topical sections on knowledge representation and knowledge engineering, tools, conceptual graphs and other models, relationships with logics, algorithms and complexity, natural language processing, and applications. Front matter Chapter 1 Chapter 2 Chapter 3 Chapter 4 1 Accommodating Standardization and Innovation 2 Actors 3 Indexicals 4 Metalevel and Higher-Order Logic 5 Pictures as Literals References Chapter 5 Chapter 6 Chapter 7 Chapter 8 Chapter 9 Chapter 10 Chapter 11 Chapter 12 Chapter 13 Chapter 14 Chapter 15 Chapter 16 Chapter 17 Introduction Formal preliminaries Matching in $@mathcal {FL}_bot $ Matching in $@mathcal {FL}_neg $ Matching under side conditions Future Work Conclusion Chapter 18 Chapter 19 Chapter 20 Chapter 21 Chapter 22 Chapter 23 Chapter 24 Chapter 25 Chapter 26 Chapter 27 Chapter 28 Chapter 29 Chapter 30 Chapter 31 Chapter 32 Chapter 33 Chapter 34 Chapter 35 Chapter 36 1 Introduction 1.1 Trivial Considerations about Existence 1.2 Plan of the Paper 2 Philosophical vs. AI View of a Concept 2.1 Vague Concepts 2.2 Vague Objects? 2.3 Variable Ontology 3 Some Linguistic Considerations 3.1 General 3.2 What Kind of Thing is a Unix Command? 3.3 What Kind of Thing is a Traffic Light? 3.4 Pustejovsky's Generative Lexicon 3.5 (Provisional) Conclusion 4 Some Promising Tracks 4.1 Semantic Adaptation 4.2 Conceptual Adaptation 5 Summary References Chapter 37 1 Introduction 2 Related Work 3 Simulation Approach 3.1 Execution Semantics of Concept Types 3.2 Simulation Support Mechanisms 3.3 The Simulation Cycle 3.4 Conceptual Relations and the Production of New Incidents 4 Conclusions 5 Acknowledgments References Chapter 38 1 Introduction 2 The CG Literature on Processes 3 From Algorithms to Pre and Postcondition Pairs 4 The Process Statement 5 The Process Statement 5.1 The Evaluation of Parameters 5.2 Process Calls 6 Conclusion and Future Developments References Chapter 39 1 Introduction 2 Descriptive Constraints 2.1 Definition of Descriptive Constraints 2.2 Minimal Descriptive Constraints and Maximal Descriptive Constraints 3 Semantic Validation 3.1 Satisfaction of Minimal Descriptive Constraints 3.2 Satisfaction of Maximal Descriptive Constraints 4 Discussion 4.1 Descriptive Constraints versus Definitions 4.2 Descriptive Constraints versus Constraints 4.3 Conclusion 5 Annex: Proof of the Properties References Chapter 40 1 Introduction 2 Concurrent Engineering and Corporate Memory 2.1 CE Task 2.2 Corporate Memory in CE 3 Viewpoints and Definition 3.1 Definition of a Viewpoint for CE 3.2 Viewpoints and CGs 4 Methodology to Build and Manage CE Project Memory with CG and Viewpoints 4.1 Methodology to Build the Artefact 4.2 Description of the Management of the Artefact in CE 5 Conclusion References Chapter 41 Introduction Design Goals Direct Manipulation Canonical Graphs Distributed Multi-User Application Layout Retention Implementation Architecture Implementation Language: Java Communication Layout Language Conclusion Chapter 42 1 Introduction 2 Overview of CORBA 3 Using CGIF in a heterogeneous environment 4 CG Interface through IDL 5 Example 6 Conclusion References Chapter 43 TOSCANA Thesaurus Terms as Attributes Extending Lattice Diagrams Discussion Chapter 44 Introduction Conceptual Graph Model Algorithm of Integration of two Expertise Models Local Relations among C-vertices of Different Conceptual Graphs Definitions Examples Local Relations among Elementary Links of Conceptual Graphs Definitions of Functions on A1 * A2 Definitions of Functions: A1 '* A2 -> Acom Global Relations among Conceptual Graphs Definitions Construction of the Base Integrated Conceptual Graphs Strategies of Integration Method for Using Integration Strategies Conclusions Implementation and Further Word Refated Word References Chapter 45 Introduction CoGITaNT Graph Rules Typed Nested Graphs with Coreference Links Untyped Nested Graphs and Typed Nested Graphs Typed Nested Graphs in CoGITaNT Coreference Links The BCGCT Format Conclusion Chapter 46 Introduction Description Logics Conceptual Graphs Correspondences Between TSCG and ALEOI Restrictions of TSCG and ALEOI G and L Equivalence between G and L Extensions Subsets of TSCG Extending type definitions in TSCG Conclusion and Perspectives Chapter 47 Introduction Piece Resolution within Conceptual Graphs The Rules Logical Interpretation of a Rule Piece Resolution Procedure Piece Resolution within First-Order Logic Pieces Basic Operations Soundness and Completeness of Logical Piece Resolution From Fact Goals to Rule Goals Comparison and Statistical Analysis An Application to Relational Database Theory Dependencies From One Model to Another Conclusion Chapter 48 Contextual Logic Triadic Contexts of Tonal Music Triadic Concept Graphs Contextual Semantics of Nested Conceptual Graphs Further Research Chapter 49 Introduction Trilattices Powerset Trilattices B-Trilattices Discussion Chapter 50 Introduction Syntax for the Language of Concept Graphs Semantics for Concept Graphs Reasoning with Concept Graphs Entailment and Validity in the Standard Model Projections A Sound and Complete Calculus for all Concept Graphs The Standard Graph of a Relational Context Contextual Logic for Knowledge Representation Appendix: Formal Proofs Chapter 51 Introduction Simple Graphs Basic Notions Co-Reference Links Another FOL Semantics Nested Graphs The Model The Semantics $Phi $ The Semantics $Psi $ Conclusion Chapter 52 Introduction Propositional and Modal Logic Graphs for Propositional Logic Graphs for the Modal Logic S5 The Equivalence Further Work Chapter 53 1. Introduction 2. FCG Formulation with Fuzzy Types 2.1. Fuzzy Types 2.2. FCGs and Ideal FCGs 3. Syntax and Declarative Semantics of FCGPs 3.1. FCGP Syntax 3.2. FCGP Interpretations and Models 3.3. FCGP Fixpoint Semantics 4. Procedural Semantics of FCGPs 4.1. FCGP Reductants 4.2. FCGP Constraints 4.3. FCGP Proof Procedure 4.4. Remarks 5. Conclusions References Chapter 54 1 Introduction 2 Knowledge Querying 2.1 The reasoning 2.2 Composition: The first algorithm 2.3 Blues: The second algorithm 3 The RAP Module 3.1 Presentation 3.2 Optimization of the Blues algorithm 4 Conclusion and Perspectives References Chapter 55 Computing the Completion Inserting a Preconcept A Non-Incremental Procedure may be more Convenient Chapter 56 Introduction Formal Background Hypothesis Space PAC Learnability Obtaining Positive Results A Negative Result Three positive results PAC learning individual graphs Learning formulas based on size limited graphs Conclusion Chapter 57 1 Introduction 2 The Role of Actors 3 The Semi-Automatic Trap 3 Fully Automated Acquisition 4 Fully Automated Interpretation 5 Conclusions References Chapter 58 1 Introduction 2 Descriptive Emphasis 2.1 State 2.2 Act 3 Definitional Information 3.1 None 3.2 Logic 3.3 Prototype 4 Conceptual Grounding 4.1 Percept 4.2 Linguistic 5 Processing Approaches 5.1 Semantic Network 5.2 Predicate Logic 5.3 Procedure 6 Ontological Structures 6.1 Type Hierarchy 6.2 Type Lattice 7 Knowledge Structures 7.1 Simple Graphs 7.2 Nested Graphs 7.3 Positive Nested Graphs 7.4 Actor Graphs 8 A Sampling of Approaches 9 Summary 10 References Chapter 59 Introduction Linguistic Perspective to Countable vs. Uncountable Other Approaches to Uncountability A Mixed Count-Mass Taxonomy in Closed Domains Conclusion Chapter 60 1 Introduction 2 An Agent’s Mental Model Based on Awareness 3 The Agent’s Memory Model and Attentional Model 5 Conclusion References Chapter 61 Introduction Polysemy, Metaphors and Figurative Meanings Ontology, Definitions and Conceptual Graphs Verbal Polysemy: Elements of Interpretation Related Works Conclusion Chapter 62 1 Introduction 2 Adwords 2.1 Adjectives 2.2 Adverbs 2.3 Classifiers in the Chinese language 3 Discussion References Chapter 63 Introduction Background Modeling Medical Language Annotation of Medical Information The Relevance of the Focus for NLP Contexts or Nested Conceptual Graphs Formal Operations to Mediate between KR and NL Basic Operations on CGs Refining Basic Operations for NLP Conclusion References Chapter 64 Introduction Basic Notions Requirements Sharing Activities Instance Management Formalisms Unified Modeling Language Process Interchange Format (PIF) Workflow Reference Model Conceptual Graphs and Processes Summary Experience and Future Work Chapter 65 Introduction User-Driven Specification Finding a Focus Specification Knowledge Handling Knowledge Categories Composition Norm Closure Contexts Example: Mailing List Basic Context Inferences Context Lattices Structuring Composition Norm Management Querying Concept Lattices Supporting the Specification Process An Example Conclusions Chapter 66 Introduction Relevant Formal Methods An Example: Overcoming the 1st Trade Problem Back matter
دانلود کتاب Conceptual Structures: Theory, Tools and Applications: 6th International Conference on Conceptual Structures, ICCS'98, Montpellier, France, August, ... (Lecture Notes in Computer Science, 1453)