Abstract
Inspired by the structure and behaviour of living cells, membrane systems are efficient computing models that can solve NP-complete problems in polynomial time. In this study, we use cP systems to perform automated deduction in equational logic. Using a fixed constant number of generic rewriting rules, our cP solution can perform completion and term reduction efficiently. Given a set of k axioms, the cP system can compute all the critical pairs among the axioms in logarithmic time regardless of k. Even when handling equational theories with n-ary operators, the cP solution’s complexity remains the same. We demonstrate the effectiveness of the approach with a case study. In addition to equational logic, the cP solution can also be used as a prototype to construct deduction cP systems for other logics.
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.
