TY - JOUR
T1 - Evaluation of declarative n-queens recursion
T2 - A deductive database approach
AU - Han, Jiawei
AU - Liu, Ling
AU - Lu, Tong
N1 - Funding Information:
1 The work was supported in part by the Natural Sciences and Engineering Research Council of Canada under the grant OPG-3723 and a research grant from the Centre for Systems Science of Simon Fraser IJniversity. The method and the examples described in the paper have been implemented in the LogicBase system (by J. Han, L. Liu, and Z. Xie) and demonstrated in the Workshop on "Prograrrmaing with Logic Databases" associated with 1993 International Logic Programming Symposium. The LogicBasc system, including the examples described here, can be tested on-line with the URL: http://db.cs.sfu.ca/l.ogicBase.
PY - 1998/3
Y1 - 1998/3
N2 - Can we evaluate a logic program declaratively? That is, can a logic program be evaluated correctly and efficiently, independent of query modes and rule/predicate ordering, finding a complete set of answers, and terminating properly? the answer could be "yes", at least for a good subclass of logic programs, based on our investigation and experimentation using a deductive database approach. In this paper, an n-queens problem, a classical logic program, is used as a running example to demonstrate the methodology. Our analysis shows that binding analysis and constraint exploration are two essential issues in the realization of declarative logic programming. The limitations of our methodology are also discussed in the paper.
AB - Can we evaluate a logic program declaratively? That is, can a logic program be evaluated correctly and efficiently, independent of query modes and rule/predicate ordering, finding a complete set of answers, and terminating properly? the answer could be "yes", at least for a good subclass of logic programs, based on our investigation and experimentation using a deductive database approach. In this paper, an n-queens problem, a classical logic program, is used as a running example to demonstrate the methodology. Our analysis shows that binding analysis and constraint exploration are two essential issues in the realization of declarative logic programming. The limitations of our methodology are also discussed in the paper.
KW - Constraint-based processing
KW - Declarative programming
KW - Deductive database
KW - Implementation techniques
KW - Logic programming
KW - Query evaluation
KW - Search
UR - http://www.scopus.com/inward/record.url?scp=0032017572&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032017572&partnerID=8YFLogxK
U2 - 10.1016/S0020-0255(97)10019-6
DO - 10.1016/S0020-0255(97)10019-6
M3 - Article
AN - SCOPUS:0032017572
SN - 0020-0255
VL - 105
SP - 69
EP - 100
JO - Information Sciences
JF - Information Sciences
IS - 1-4
ER -