Abstract
This paper gives the extensional semantics definitions associated with simple conceptual graphs (CG) under a simple paradigm closely related to relational database (RDB) theory. We believe that by providing such definitions, the implementation of a CG system using this paradigm would be greatly facilitated. Considering the nature of CGs, existentially quantified assertions, the use of a RDB at the implementation level becomes attractive for applications with huge volume of data (like with deductive databases). Furthermore, RDB theory provides years of experience, stability and on-going support of the many tools that the industry offers today. These advantages become prerequisite when choosing a technological platform for a large scale industrial project. This paper provides a formal basis for understanding the deep semantics of the CG notation, including the compositional semantics of the canonical formation operators. It also provides a simple procedure that performs model c hecking of graphs in a CG system.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
