An Efficient Method for Controlling the Number of Proofs in Prolog


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 6, pp. 1557-1564, Jun. 1997
10.3745/KIPSTE.1997.4.6.1557,   PDF Download:

Abstract

We propose an extension to Prolog called the count term for controlling Prolog execution. The purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog programs and for limiting the number of answers or proofs retrieved when Prolog is used as a database query language. Both syntax and operational semantics of the count term are defined. An implementation strategy based on WAM (Warren Abstract Machine) by modifying instructions related to backtracking behavior has been suggested.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
N. Y. Kwang, "An Efficient Method for Controlling the Number of Proofs in Prolog," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 6, pp. 1557-1564, 1997. DOI: 10.3745/KIPSTE.1997.4.6.1557.

[ACM Style]
Nam Young Kwang. 1997. An Efficient Method for Controlling the Number of Proofs in Prolog. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 6, (1997), 1557-1564. DOI: 10.3745/KIPSTE.1997.4.6.1557.