Evaluation of declarative n-queens recursion: A deductive database approach

Jiawei Han, Ling Liu, Tong Lu

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)69-100
Number of pages32
JournalInformation Sciences
Issue number1-4
StatePublished - Mar 1998
Externally publishedYes


  • Constraint-based processing
  • Declarative programming
  • Deductive database
  • Implementation techniques
  • Logic programming
  • Query evaluation
  • Search

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Control and Systems Engineering
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence


Dive into the research topics of 'Evaluation of declarative n-queens recursion: A deductive database approach'. Together they form a unique fingerprint.

Cite this