Catálogo de publicaciones - libros

Frames, i.e., recursive attribute-value structures, are a general format for the decomposition of lexical concepts. Attributes assign unique values to objects and thus describe functional relations. Concepts can be classified into four groups: sortal, individual, relational and functional concepts. The classification is reflected by different grammatical roles of the corresponding nouns. The paper aims at a cognitively adequate decomposition, particularly, of sortal concepts by means of frames. Using typed feature structures, an explicit formalism for the characterization of cognitive frames is developed. The frame model can be extended to account for typicality effects. Applying the paradigm of object-related neural synchronization, furthermore, a biologically motivated model for the cortical implementation of frames is developed. Cortically distributed synchronization patterns may be regarded as the fingerprints of concepts.

The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precise: As Peirce wanted to develop a logic of (i.e., relations), existential graphs correspond to first order logic with relations and identity, but without constants or functions. In contemporary elaborations of first order logic, constants and functions are usually employed. In this paper, it is described how the syntax, semantics and calculus for Peirce’s existential graphs has to be extended in order to encompass constants and functions as well.

In unpublished manuscripts from Peirce”s last decade, he emphasizes his dialogic and interactive view of logic-as-semeotic, exemplified by the Existential Graphs. Recently published research of these manuscripts solidly supports the project of creating a game for instituting his pragmatic methodology to demonstrate his full semeotic logic. Revelator is my conception of that game, to pursue Peirce”s ideas for . Revelator”s design somewhat resembles many well-known games, such as bridge, chess, crossword puzzles, and even poker, but its core purpose is to reveal complex relations among the conditional propositions, by which players represent their conjectures as plays in the game. The game design invites the application and evolution of Conceptual Structures technology to aggregate, integrate, and display the of these propositions. Plays are treated as rule-defined agents that can adapt in complex conceptual environments to form multi-agents, promoting the emergence of collaboratively formulated and selected models of possible knowledge (or robust hypotheses). Peirce”s full vision of a dynamic logic continues to challenge Conceptual Structures to become an engine of inquiry.

We identify a lucid way of conveying complex information to users in a highly visual, easy to follow form. As explanation, we describe several ideas about system user instructions. Several key ideas are clarified using diagrams. A direction for exploration is offered, with the view that ICCS conferees will be aware of a simple, diagrammatic way to explain use of systems dealing with very complex real world problems.

is a field of research which shares abstract concepts and interests with recent work on knowledge representation for the Semantic Web. However, while the latter is an area of research and development which is rapidly expanding in recent years, the former fails to participate in these developments on a large scale. In this paper, we attempt to stimulate the Conceptual Structures community to catch the Semantic Web train.

Requirements inconsistencies, caught early in a software lifecycle, prevents unnecessary work later in that lifecycle. Testing requirements for consistency early and automatically is a key to catching errors. This paper will share an experience with a mature software project that involved translating software requirements with overlapping definitions into a conceptual graph and recommends the use of several new actors to help automatically test a requirements consistency graph.

The query language is a W3C candidate recommendation for asking and answering queries against RDF data. It offers capabilities for querying by and retrieval of solutions is based on . This paper is dedicated to the implementation of the query language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.

We use Conceptual Graphs (CGs) to model web content extraction rules (CG-Wrappers). The approach presented incorporates all major existing extraction techniques and allows the definition of synergies of cooperative wrappers for handling complex extraction task, without requiring programming.

We propose a mechanism for annotating and querying document collections based on the semantic modeling of the context of a search. We model on the one hand the topics concerned by the content of the document and on the other hand the metadata associated with the documents, by means of two ontologies expressed in the conceptual graph model. The semantic annotating mechanism is done by automatically building conceptual graphs.

Representation of knowledge is used to store and retrieve informational data in a machine. Since cannot be directly stored in the computer; this work proposes a series of levels of representation. The meaning of the data is transformed to a format that the machine can use to store and retrieve knowledge. These levels are designed to transform the knowledge from an abstract definition to a machine representation without loosing any meaning.