Abstract
A procedure for deciding the validity of ground formulas in a theory of directed graphs is described. The procedure, which decides equality and containment relations for vertex, edge and graph terms, is based on the method of congruence closure and involves the formation of equivalence classes and their representatives. An interesting aspect of the procedure is its use of maximal, rather than minimal, normal forms as equivalence class representatives. The correctness, efficiency, and limitations of the procedure are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.