Abstract
Complicated problems are often solved by simplification into more manageable abstract problems, the solution of which yields information about the original problem. The proposed theory lays a foundation for such a technique to solve “no-solution” problems in logic programming. The new theory is based on the concept of a homomorphism, which maps a concrete logic program into an abstract one. A homomorphism theorem establishes a relationship between the declarative semantics of such programs, which is used to prove the correctness of the proposed abstraction method for “no-solution” problems. © 1999 Scripta Technica, Syst Comp Jpn, 31(1): 1–10, 2000
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.
