Abstract
In answer set programming, an extended logic program may have no answer set, or only one trivial answer set. In this paper, we propose a new stable model semantics based on the restricted four-valued logic to overcome both inconsistences and incoherences in answer set programming. Our stable models coincide with classical answer sets when reasoning on consistent and coherent logic programs, and can be solved by transformation in existing ASP solvers. We also show the connection between our stable models and the extensions of default logic.
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.