1. Krzysztof Apt, Howard Blair,and Adrian Walker.Towards a theory of declarative knowledge. In Jack Minker,editor,Foundations of Deductive Databases and Logic Programming,pages 89–148.Morgan Kaufmann, San Mateo,CA,1988.
2. Yuliya Babovich, Esra Erdem,and Vladimir Lifschitz. Fages’ theorem and answer set programming. In Proc. NMR-2000, 2000.
3. Roberto Bayardo and Robert Schrag.Using CSP look-back techniques to solve realworld SAT instances. In Proc. IJCAI-97,pages 203–208,1997.
4. Keith Clark.Negation as failure. In Herve Gallaire and Jack Minker,editors,Logic and Data Bases,pages 293–322.Plenum Press, New York,1978.
5. Marc Denecker and Bert Van Nuffelen.Experiments for integration CLP and abduction.10 In Krysztof R. Apt, Antonios C. Kakas, Eric Monfroy,and Francesca Rossi, editors,Proceedings of the 1999 ERCIM/COMPULOG workshop on Constraints, pages 1–15,1999.