Abstract
The Tarski algebra of relations offers a bridge between logic programming and algorithmic programming because it captures the semantics of both brands of programming. In this article we discuss the application to logic programming of heuristics designed to develop algorithmic programs. Not only did these heuristics prove applicable to logic programs, they proved in fact to be more easily applicable to logic programs than to algorithmic programs in the following sense: some steps of the program construction process, which are carried out by hand in the construction of an algorithmic program, are automated in logic programming. This automation is made possible by the ability of logic programming to represent relations and operations on relations.
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.
