{"type":"ScholarlyArticle","title":"Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs","authors":[{"name":"Shamim A. Naqvi","slug":"shamim-a-naqvi","given":"Shamim A.","family":"Naqvi","affiliation":""},{"name":"Lawrence J. Henschen","slug":"lawrence-j-henschen","given":"Lawrence J.","family":"Henschen","affiliation":""}],"abstract":"An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a non-recursive iterative program. By augmenting a relational system with this algorithm, least fixed point queries can be handled automatically, and there is no need to proceduralize relational algebra for such queries.","doi":null,"url":"https://ijcai.org/proceedings/1983/5","pdf":"https://ijcai.org/proceedings/1983/0005.pdf","markdown":"https://ijcai.org/proceedings/1983/5.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/5","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automatic Programming","track":"Automatic Programming","number":5,"pages":{"first":25,"last":27},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}