Paper Info
Title
A controlling scheme for Prolog through count terms
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) is provided. We analyze the possible meanings one might associate with the count term. The possible replacement of cut and fail by the count term is presented. The ease of analysis of programs with count terms is discussed.
Year
DOI
Venue
1993
10.1016/0096-0551(93)90009-P
Comput. Lang.
Keywords
DocType
Volume
controlling scheme,Warren Abstract Machine,count term,possible replacement,programming languages,Prolog program,Prolog control,database query language,cut,execution behavior,Prolog execution,implementation strategy,greater flexibility,possible meaning
Journal
19
Issue
ISSN
Citations 
4
Computer Languages
0
PageRank 
References 
Authors
0.34
12
2
Name
Order
Citations
PageRank
Young K. Nam100.68
Lawrence J. Henschen2478280.94