|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1009
|
editors. Foundations of Databases
– Abiteboul, Hull, et al.
- 1995
|
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
683
|
Circumscription - a form of nonmonotonic reasoning
– McCarthy
- 1980
|
|
615
|
The semantics of Predicate Logic as a Programming Language
– Emden, Kowalski
- 1976
|
|
557
|
Towards a theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
277
|
Pointwise circumscription
– Lifschitz
- 1987
|
|
243
|
Structure and complexity of relational queries
– Chandra, Harel
- 1982
|
|
221
|
Boosting combinatorial search through randomization
– Gomes, Selman, et al.
- 1998
|
|
212
|
Principles of Database and
– Ullman
- 1989
|
|
211
|
KIDS: A semiautomatic program development system
– Smith
- 1990
|
|
189
|
Logic programs with stable model semantics as a constraint programming paradigm
– Niemela
- 1999
|
|
122
|
Experimental Results on the Crossover Point in Random 3SAT
– Crawford, Auton
- 1996
|
|
110
|
A survey of automated timetabling
– Schaerf
- 1999
|
|
102
|
The KR System dlv: Progress Report, Comparisons and Benchmarks
– Eiter, Leone, et al.
- 1998
|
|
95
|
introduction to Timetabling
– Werra
- 1985
|
|
94
|
Computable Queries for Relational Databases
– Chandra, Harel
- 1980
|
|
94
|
Heuristics based on unit propagation for satisfiability problems
– Li, Anbulagan
- 1997
|
|
83
|
Report on a SAT competition
– Buro, Buning
- 1992
|
|
76
|
Generating hard satisfiability problems
– Selman, Mitchell, et al.
- 1996
|
|
59
|
Automatically configuring constraint satisfaction programs: A case study
– Minton
- 1996
|
|
40
|
based on unit propagation for satisfiability problems
– Heuristics
- 1997
|
|
22
|
Circumscribing datalog: expressive power and complexity
– Cadoli, Palipoli
- 1998
|
|
20
|
Strategies for Incorporating Formal Specifications in Software Development
– Fraser, Kumar, et al.
- 1994
|
|
17
|
Compiling problem specifications into SAT
– Cadoli, Schaerf
|
|
7
|
M.: Spill – a Logic Language for Writing Testable Requirement Specifications
– Kluzniak, Milkowska
- 1997
|
|
3
|
et al. ECL i PS e User Manual (Version 4.0). IC-Parc
– Aggoun
- 1998
|
|
2
|
An introduction to timetabling", European
– Werra
- 1985
|
|
2
|
and et al, ECL i PS e User Manual (Version 4.0
– Aggoun
- 1998
|
|
2
|
ECL i PS e User Manual (Version 4.0). IC-Parc
– Aggoun
- 1998
|
|
2
|
The Satisfiability Library. http://www.informatik.tu-darmstadt.de/ AI/SATLIB
– SATLIB
|
|
2
|
optimization suite --- white paper. Available at www.ilog.com
– ILOG
- 1998
|
|
1
|
Miros/lawa Mi/lkowska, "Spill -- a logic language for writing testable requirements specifications
– Klu`zniak
- 1997
|
|
1
|
Computer program available at www.informatik.uni-koeln.de/lsjuenger/staff/boehm/src.html
– solver
- 1992
|
