Abstract
A new completion theory for logic programming called strong completion, is introduced. Similar to the Clark's completion, the strong completion can be interpreted either in two-valued or three-valued logic. We show that ⋆Two-valued strong completion specifies the stable semantics. ⋆Three-valued strong completion specifies the well-founded semantics.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
