Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Polynomial Algorithms for Projection and Matching
Proceedings of the 7th Annual Workshop on Conceptual Structures: Theory and Implementation
Conceptual Graphs for Relational Databases
ICCS '93 Proceedings on Conceptual Graphs for Knowledge Representation
A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Interfacing a relational database using conceptual graphs
DEXA '96 Proceedings of the 7th International Workshop on Database and Expert Systems Applications
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A content-search information retrieval process based on conceptual graphs
Knowledge and Information Systems
Formal and graphical annotations for digital objects
SADPI '07 Proceedings of the 2007 international workshop on Semantically aware document processing and indexing
Conceptual graphs for a data base interface
IBM Journal of Research and Development
RDF entailment as a graph homomorphism
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Conceptual graphs for semantic web applications
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
Distinguishing Answers in Conceptual Graph Knowledge Bases
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
| Hi-index | 0.01 |
Conceptual graphs are a good choice for constructing and exploiting a knowledge base. In several of our projects (semantic portal for e-tourism, exploitation of digital object corpus, etc.), we have to query such bases. So it is natural to consider queries and bases as simple graphs and to compute the set of all projections from a query to a base. However, there is a problem of the return of this set of projections to the user. More generally, the main issue is about the definition of the notion of answers in an query-answering system made of knowledge bases formalized by graphs (Conceptual Graphs, RDF (Resource Description Framework) , Topic Maps, etc.). In this paper, we study several notions of answers and some of their characterizations. We distinguish between notions of answers by subgraphs of the base and answers by creation of result graphs. For the last type of answers, we define completeness, non-redundancy and minimality criteria of the answer sets and propose several notions of answers w.r.t these criteria.