2013
DOI: 10.1007/978-3-642-45284-0_6
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: We describe the portable and efficient implementation of coinductive logic programming found in Logtalk, discussing its features and limitations. As Logtalk uses as a back-end compiler a compatible Prolog system, we also discuss the status of key Prolog features for an efficient and usable implementation of coinduction.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…In the area of coinduction, we find similarities in the work of (Simon et al 2007;Gupta et al 2007;Moura 2013) that makes clear the importance of tabling for coinduction. (Ancona 2013) presents an alternative approach to coinduction where tabling is not required, still this approach may hurt readability of the coinductive predicate definitions.…”
Section: Conclusion Related and Future Workmentioning
confidence: 66%
See 2 more Smart Citations
“…In the area of coinduction, we find similarities in the work of (Simon et al 2007;Gupta et al 2007;Moura 2013) that makes clear the importance of tabling for coinduction. (Ancona 2013) presents an alternative approach to coinduction where tabling is not required, still this approach may hurt readability of the coinductive predicate definitions.…”
Section: Conclusion Related and Future Workmentioning
confidence: 66%
“…In this section, we describe a modified tabling strategy that instead of computing the least fixed point of a logic program, computes the greatest fixed point. In order to compute the greatest fixed point of a logic program, it is customary to either define a program transformation (Simon et al 2007;Gupta et al 2007;Moura 2013) or implement a meta-interpreter (Ancona 2013) that solves the logic program. Both approaches have been presented in the past and, to the best of our knowledge, there is no previous implementation that computes the greatest fix point within the WAM.…”
Section: A Tabling Based Approach To Coinductionmentioning
confidence: 99%
See 1 more Smart Citation
“…CoLP has been initially proposed by Simon et al (2006;2006;2007) as a convenient subparadigm of logic programming to model circularity; it was soon recognized the limitation of its expressive power that does not allow mutually recursive inductive and coinductive predicates, or predicates whose correct interpretation is neither the least, nor the greatest fixed point. Moura et al (2013;2014) and Ancona (2013) have proposed implementations of coLP based on refinements of the Simon's original proposal with the main aim of making them more portable and flexible. Ancona has extended coLP by introducing a finally clause, allowing the user to define the specific behavior of a predicate when solved by coinductive hypothesis.…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…Two papers have been recently published in the time spanning the period between the appearance of the conference version and the completion of the revision of the journal version of this work, witnessing the interest toward this sub-paradigm of Logic Programming. Moura [24] presents a portable implementation of co-LP very close to [2] (both based on refinements of the Simon's original proposal [31]), which has been embedded in a tabled Prolog [20], exploiting tabling for storing hypothesis. The work of Moura relates to the implementation of Logtalk, an open source object-oriented logic programming language supporting co-LP; both [20] and [2] propose a more flexible implementation than that provided in [31], with similar mechanisms to allow the user to specify customized behavior in case of the application of the coinductive rule.…”
Section: Implementation Notesmentioning
confidence: 99%