A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Polynomial Algorithms for Projection and Matching
Proceedings of the 7th Annual Workshop on Conceptual Structures: Theory and Implementation
Knowledge Querying in the Conceptual Graph Model: The RAP Modula (Research Note)
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Knowledge Representation and Reasonings Based on Graph Homomorphism
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
A Conceptual Graph Model for W3C Resource Description Framework
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
A diagrammatic reasoning system for the description logic ALC
Journal of Visual Languages and Computing
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Query-Answering CG Knowledge Bases
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
The Advent of Formal Diagrammatic Reasoning Systems
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
Translations between RDF(S) and conceptual graphs
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Foundations of Semantic Web databases
Journal of Computer and System Sciences
An efficient light solver for querying the semantic web
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Introducing graph-based reasoning into a knowledge management tool: an industrial case study
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Preserving information content in RDF using bounded homomorphisms
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Castor: a constraint-based SPARQL engine with active filter processing
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
| Hi-index | 0.00 |
Semantic consequence (entailment) in RDF is ususally computed using Pat Hayes Interpolation Lemma. In this paper, we reformulate this mechanism as a graph homomorphism known as projection in the conceptual graphs community. Though most of the paper is devoted to a detailed proof of this result, we discuss the immediate benefits of this reformulation: it is now easy to translate results from different communities (e.g. conceptual graphs, constraint programming, ...) to obtain new polynomial cases for the NP-complete RDF entailment problem, as well as numerous algorithmic optimizations.