Titlebook: Conceptual Structures: Current Practices; Second International William M. Tepfenhart,Judith P. Dick,John F. Sowa Conference proceedings 199

faultfinder

0302-9743 in August 1994..This proceedings presents, on an international scale, up-to- the-minute research results on theoretical and applicational aspects of conceptual graphs, particularly on the use of contexts in knowledge representation. The concept of contexts is highly important for all kinds of knowle

Mingle

https://doi.org/10.1007/978-981-99-7965-3a refutation-based resolution procedure that is somewhat analogous in approach to the SLD-resolution of first-order predicate logic. The second one, called the CGF-derivaton, is a forward derivation based deduction procedure. Both procedures are sound with respect to the declarative semantics of conceptual graph programs.

Humble

Linguistic processing of text for a large-scale conceptual Information Retrieval system, that reveal conceptual relations. They were used to process a Wall Street Journal database covering a period of three years. We describe our methods for constructing the knowledge base, how the linguistic knowledge is used to process the text, and how the retrieval system makes use of the rich representation of documents and information needs.

Mobile

0302-9743 dge-intensive systems. The book is organized into sections on natural language understanding, rational problem solving, conceptual graph theory, contexts and canons, and data modeling.978-3-540-58328-8978-3-540-38675-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

FADE

heterodox

Concluding remarks and future directions,erlying this construction was determinacy. Here, we will show that this determinacy principle is not ideal, and that one should join schematic expansions of the lexical entries instead to achieve the semantic graph of a sentence.

Palter

Foundations of scientific cooperation, etc.) modify these rules. We also consider verb tense determination rules for complex sentences (composed of a main clause and a subordinate clause). Finally, we present a method for applying these verb determination rules to a discourse temporal model.

蜈蚣

Lecture Notes in Computer Science definition of external, internal, elementary and extended join operations. Finally, in order to join graphs which may include functions, compatible projections must be replaced by . compatible projections. This paper formally defines these new projections.

強所

高爾夫

Towards a Christian Literary Theoryto an object made up of conceptual structures. This base thus endows Prolog++ with a second form of object oriented programming. Finally, Prolog++ provides, as predefined methods, a set of conceptual operations for editing and handling CG.