Abstract

Conceptual Graph (CG) knowledge bases can be queried only by means of goals. We show that some conventional operators (projection, selection, union, cartesian product) cannot be expressed unless a set of rules is added to the knowledge base prior to the inference, which is highly inconvenient. Therefore, we propose an algebra and a declarative SQL-like language for the CG model, which permits the expression of complex queries with the above four operators, leaving the knowledge base unchanged. We prove that CG-SQL is complete with respect to safe sets of rules and that queries are decidable if no unsafe rules are present in the knowledge base.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call