A complex benchmark for logic programming and deductive databases, or who can beat the N-queens?

Authors:
Werner Kießling
Affiliations:
-
Venue:
ACM SIGMOD Record
Year:
1992

Citing 5
Cited 1

The art of Prolog: advanced programming techniques

The art of Prolog: advanced programming techniques
A logical language for data and knowledge bases

A logical language for data and knowledge bases
Inference of monotonicity constraints in datalog programs

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A dynamic programming solution to the n-queens problem

Information Processing Letters
On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration

Proceedings of the Third International Conference on Data Engineering

DECLARE and SDS: early efforts to commercialize deductive database technology

The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The N-queens problem with its long history and inherent complexity is a challenging benchmark target. We present our solution and performance results, hoping that this will stimulate a sort of benchmark competition for tough problems.