Abstract
The purpose of this paper is twofold: 1) to show that automated deduction techniques can be applied to Charles S. Peirce's system of existential graphs (EG-resolution), and 2) to look at Sowa's canonical formation rules of conceptual structures as existential graphs deductions. The system of existential graphs reduces all logical inference to two basic operations: writing and erasing graphs from a sheet of assertions. These basic operations can be used to implement automated deduction techniques such as the resolution principle. The system of existential graphs also permits to draw a parallel between the canonical formation rules and logical operations on existential graphs. This parallel is possible when the type hierarchy of concepts is expressed by conceptual structures and not as a lexicon feature. Although, the restriction rule can only be analyzed as a deduction when the existence of an arbitrary individual of a relevant type is assumed. An existential graphs deduction of the restriction rule with the necessary assumption is given.
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.
