DBA*: Solving Combinatorial Problems with Deductive Databases.
Helmut SchmidtWerner KießlingUlrich GüntzerRudolf BayerPublished in: BTW (1989)
Keyphrases
- deductive databases
- combinatorial problems
- combinatorial optimization
- solving hard
- graph coloring
- constraint programming
- metaheuristic
- integrity constraints
- combinatorial search
- traveling salesman problem
- logic programming
- constraint satisfaction problems
- semantic query optimization
- fixpoint
- constraint satisfaction
- disjunctive deductive databases
- phase transition
- satisfiability problem
- sat encodings
- branch and bound algorithm
- query evaluation
- finite domain
- global constraints
- datalog programs
- closed world assumption
- search algorithm
- genetic algorithm
- constraint propagation
- database design
- simulated annealing
- special case
- branch and bound
- stochastic local search
- query processing
- search space