
## References

Antoniou, G., 1997, Nonmonotonic Reasoning**, MIT Press.** Bayardo, R. Jr., and Pehoushek, J., 2000, Counting models using connected components, Proceedings of 17th AAAI**, Austin TX, 157-162.**

Bidoit, N., and Hull, R., 1986, Positivism vs. minimalism in **deductive**
databases, Proceedings of ACM SIGACT-SIGMOD Symposium on Principles of Database Systems**, Cambridge, MA, 123-132.**
Birnbaum, E., and Lozinskii, E., 1999, The good old Davis-Putnam procedure helps counting models, Journal of Artificial Intelligence Research, 10**, 457-**
477.

Brewka, G., Niemela, I., and Truszczynski, M., 2007, Nonmonotonic Reasoning, In V. Lifschitz, B. Porter, and F. van Harmelen (eds) **Handbook of Knowledge**
Representation**, Elsevier, 239-284.**
Cook, S., 1971, The complexity of theorem proving procedures, **Proceedings of**
3rd ACM STOC**, 151-158.**
Davis, M., Logemann, G., and Loveland, D., 1962, A machine program for theorem proving, Communications of the ACM, 5 **(7): 394-397.**

Gelfond, M., and Lifschitz, V., 1988, The stable model semantics for logic programming, **Proceedings of 5th International Conference and Symposium**
on Logic Programming**, Seattle, WA, 1070-1080.**
Gomes, C., Sabharwal, A., and Selman, B., 2006, Model counting: A new strategy for obtaining good bounds, Proceedings of 21st AAAI**, Boston, MA,** 54-61.
Lozinskii, E., 1992, Counting propositional models, Information Processing Letters, 41**, 327-332.** Lozinskii, E., 1994, Information and evidence in logic systems, Journal of Experimental and Theoretical Artificial Intelligence, 6**, 163-193.**
Lozinskii, E., 1997, Approximate reasoning with credible subsets, **Journal of**
Experimental and Theoretical Artificial Intelligence, 9**, 543-562.**
Lozinskii, E., 2006, Impurity: Another phase transition of SAT, **Journal of**
Satisfiability, Boolean Modeling and Computation, 1 **(2), 123-141.**
McCarthy, J., 1980, Circumscription - a form of non-monotonic reasoning, Artificial Intelligence, 13**: 27-39.**
Minker, J., 1982, On indefinite databases and the closed world assumption, Lecture Notes in Computer Science, 138**, Springer-Verlag, Berlin, 292-308.**