Abstract
Constraint diagrams are a visual notation designed for use by software engineers to formally specify information systems. In this paper we formalize a fragment of the constraint diagram language. A set of reasoning rules are defined and we prove that this set is both sound and complete. Given constraint diagrams D1 and D2 such that D2 is a semantic consequence of D1, to prove completeness we construct a proof of D2 from D1. A decision procedure can be extracted from this proof construction process and it follows that the system is decidable.
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.
