Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs

Naqvi, Shamim A.; Henschen, Lawrence J.

Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 25-27.

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.

Shamim A. Naqvi, and Lawrence J. Henschen. 1983. Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 25–27. https://ijcai.org/proceedings/1983/5

@inproceedings{ijcai1983p5,
  title     = {Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs},
  author    = {Naqvi, Shamim A. and Henschen, Lawrence J.},
  booktitle = {Proceedings of the Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-83}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Alan Bundy},
  pages     = {25--27},
  year      = {1983},
  note      = {Automatic Programming},
  url       = {https://ijcai.org/proceedings/1983/5},
}

TY  - CPAPER
TI  - Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs
AU  - Naqvi, Shamim A.
AU  - Henschen, Lawrence J.
T2  - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1983
SP  - 25
EP  - 27
UR  - https://ijcai.org/proceedings/1983/5
ER  -