A theoretical foundation for solving “no-solution” problems by abstraction
✍ Scribed by Kiyoshi Akama; Hiroshi Mabuchi; Eiichi Miyamoto
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 305 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
✦ Synopsis
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.