APA (7th ed.) Citation

Charalambidis, A., Rondogiannis, P., & Symeonidou, I. (2017). Equivalence of two fixed-point semantics for definitional higher-order logic programs. Theoretical computer science, 668, 27-42. https://doi.org/10.1016/j.tcs.2017.01.005

Chicago Style (17th ed.) Citation

Charalambidis, Angelos, Panos Rondogiannis, and Ioanna Symeonidou. "Equivalence of Two Fixed-point Semantics for Definitional Higher-order Logic Programs." Theoretical Computer Science 668 (2017): 27-42. https://doi.org/10.1016/j.tcs.2017.01.005.

MLA (9th ed.) Citation

Charalambidis, Angelos, et al. "Equivalence of Two Fixed-point Semantics for Definitional Higher-order Logic Programs." Theoretical Computer Science, vol. 668, 2017, pp. 27-42, https://doi.org/10.1016/j.tcs.2017.01.005.