Abstract
We propose in this work a mathematical aspect of Constructive Negation for constraint general logic programs. We can then obtain a completion theorem (soundness and completeness) with internal axiomatization of general program, in the classical logic deduction frame: the bivalued models.
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.
