Tabled logic programming: Difference between revisions

Revision as of 14:07, 29 October 2023

Revision as of 12:08, 1 November 2023

Line 8:

== History ==

The adaptation of tabling into a logic programming proof procedure, under the name of Earley deduction, dates from an unpublished note from 1975 by [[David H. D. Warren|David H.D. Warren]].<ref>{{Cite book |last=Pereira |first=Fernando C. N. |title=Prolog and Natural Language Analysis |last2=Shieber |first2=Stuart M. |publisher=[[Center for the Study of Language and Information]] |year=1987 |___location=Stanford |pages=185--210185–210}}</ref> An interpretation method based on tabling was later developed by Tamaki and Sato, modelled as a refinement of SLD-resolution.<ref>{{Citation |last=Tamaki |first=Hisao |title=OLD resolution with tabulation |date=1986 |url=http://dx.doi.org/10.1007/3-540-16492-8_66 |work=Lecture Notes in Computer Science |pages=84–98 |access-date=2023-10-27 |place=Berlin, Heidelberg |publisher=Springer Berlin Heidelberg |isbn=978-3-540-16492-0 |last2=Sato |first2=Taisuke}}</ref>

David S. Warren and his students adopted this technique with the motivation of changing Prolog’s semantics from the completion semantics to the minimal model semantics.

Line 29:

Giovanni Ciatto

}}

[[Category:Logic programming]][[Category:Dynamic programming]]

[[Category:Dynamic programming]]

{{prog-lang-stub}}

[[Category:Logic programming]][[Category:Dynamic programming]]