Davide Ancona
2013
Regular corecursion in Prolog
Computer Languages, Systems & Structures
39
4
142–162
10.1016/j.cl.2013.05.001
Davide Ancona
Andrea Corradi
Giovanni Lagorio
Ferruccio Damiani
2010
Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?
Formal Verification of Object-Oriented Software - International Conference, FoVeOOS 2010, Paris, France, June 28-30, 2010, Revised Selected Papers
31–45
10.1007/978-3-642-18070-5_3
Davide Ancona
Agostino Dovier
2015
A Theoretical Perspective of Coinductive Logic Programming
Fundam. Inform.
140
3-4
221–246
10.3233/FI-2015-1252
K.L. Clark
1980
Predicate Logic as a Computational Formalism
Research monograph / Department of Computing, Imperial College of Science and Technology, University of London
https://www.doc.ic.ac.uk/~klc/monograph.html
Alain Colmerauer
1985
Prolog in 10 Figures
Commun. ACM
28
12
1296–1310
10.1145/214956.214958
Bruno Courcelle
1983
Fundamental properties of infinite trees
Theoretical Computer Science
25
2
95 – 169
10.1016/0304-3975(83)90059-2
M.H. van Emden
J.W. Lloyd
1984
A logical reconstruction of Prolog II
The Journal of Logic Programming
1
2
143 – 149
10.1016/0743-1066(84)90001-3
Jörg Endrullis
Clemens Grabmayer
Dimitri Hendriks
Ariya Isihara
Jan Willem Klop
2010
Productivity of Stream Definitions
Theor. Comput. Sci.
411
4-5
765–782
10.1016/j.tcs.2009.10.014
Gopal Gupta
Ajay Bansal
Richard Min
Luke Simon
Ajay Mallya
2007
Coinductive Logic Programming and Its Applications
27–44
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1007/978-3-540-74610-2_4
Joxan Jaffar
Peter J. Stuckey
1986
Semantics of Infinite Tree Logic Programming
Theor. Comput. Sci.
46
2-3
141–158
10.1016/0304-3975(86)90027-7
Patricia Johann
Ekaterina Komendantskaya
Vladimir Komendantskiy
2015
Structural Resolution for Logic Programming
Tech. Commu. of ICLP' 15
Ekaterina Komendantskaya
2017
Personal communication
Ekaterina Komendantskaya
Patricia Johann
2015
Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
CoRR
abs/1511.07865
http://arxiv.org/abs/1511.07865
Ekaterina Komendantskaya
Patricia Johann
Martin Schmidt
2016
A Productivity Checker for Logic Programming
LOPSTR'16
http://arxiv.org/abs/1608.04415
Ekaterina Komendantskaya
John Power
Martin Schmidt
2016
Coalgebraic logic programming: from Semantics to Implementation
Journal of Logic and Computation
26
2
745
10.1093/logcom/exu026
Yue Li
2016
Comparative Study of Search Strategies for Term-Matching and Unification Based Resolution in Prolog
http://www.macs.hw.ac.uk/~yl55/CoALP_Report_Dec16.pdf
Unpublished
J. W. Lloyd
1987
Foundations of Logic Programming; (2Nd Extended Ed.)
Springer-Verlag New York, Inc.
New York, NY, USA
10.1007/978-3-642-83189-8
Alberto Martelli
Ugo Montanari
1982
An Efficient Unification Algorithm
ACM Trans. Program. Lang. Syst.
4
2
258–282
10.1145/357162.357169
Ben A. Sijtsma
1989
On the Productivity of Recursive List Definitions
ACM Trans. Program. Lang. Syst.
11
4
633–649
10.1145/69558.69563
Luke Simon
2006
Extending Logic Programming with Coinduction
The University of Texas at Dallas
http://www.utdallas.edu/~gupta/lukethesis.pdf
Luke Simon
Ajay Mallya
Ajay Bansal
Gopal Gupta
2006
Coinductive Logic Programming
330–345
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1007/11799573_25
M. H. Van Emden
R. A. Kowalski
1976
The Semantics of Predicate Logic As a Programming Language
J. ACM
23
4
733–742
10.1145/321978.321991
W. P. Weijland
1988
Semantics for logic programs without occur check
710–726
Springer Berlin Heidelberg
Berlin, Heidelberg
10.1016/0304-3975(90)90194-M