C. Baral, . Kraus-s, and J. Minker, Combining multiple knowledge bases, IEEE Transactions on Knowledge and Data Engineering, vol.3, issue.2, pp.208-220, 1991.

C. Baral, . Kraus-s, J. Minker, and V. S. Subrahmanian, Combining knowledge bases consisting of first-order theories, Computational Intelligence, vol.8, issue.1, pp.45-71, 1992.

N. D. Belnap, A useful four-valued logic, Modern Uses of Multiple-Valued Logic, pp.8-37, 1977.

. Benferhat-s, C. Cayrol, . Dubois-d, J. Lang, and H. Prade, Inconsistency management and prioritized syntax-based entailment, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp.640-645, 1993.

. Benferhat-s, . Dubois-d, and H. Prade, How to infer from inconsistent beliefs without revising ?, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp.1449-1455, 1995.

. Benferhat-s, . Dubois-d, and H. Prade, An overview of inconsistency-tolerant inferences in prioritized knowledge bases, Fuzzy Sets, Logics and Reasoning About Knowledge, vol.15, pp.395-418, 1999.

. Borgida-a and . Imielinski-t, Decision making in committees: A framework for dealing with inconsistency and nonmonotonicity, Non-Monotonic Reasoning Workshop, pp.21-32, 1984.

. Brewka-g, Preferred subtheories: An extended logical framework for default reasoning, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp.1043-1048, 1989.

M. Cadoli and M. Schaerf, On the complexity of entailment in propositional multivalued logics, Annals of Mathematics and Artificial Intelligence, vol.18, issue.1, pp.29-50, 1996.

C. Cayrol and . C. Lagasquie-schiex-m, Nonmonotonic reasoning: from complexity to algorithms, Annals of Mathematics and Artificial Intelligence, vol.22, pp.207-236, 1998.

C. J. Kuipers-b, Towards a theory of access-limited logic for knowledge representation, Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, pp.67-78, 1989.

. Dalal-m, Anytime clausal reasoning, Annals of Mathematics and Artificial Intelligence, vol.22, issue.3-4, pp.297-318, 1998.

. Dean-t and M. Boddy, An analysis of time-dependent planning, Proceedings of the Seventh National Conference on Artificial Intelligence, pp.49-54, 1988.

. Dechter-r and . Rish-i, Directional resolution: The Davis-Putnam procedure, revisited, Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, pp.134-145, 1994.

. Elvang-gøransson-m and . Hunter-a, Argumentative logics: Reasoning with classical inconsistent information, IEEE Transactions on Data and Knowledge Engineering, vol.16, pp.125-145, 1995.

. Fagin-r, J. D. Ullman, and M. Y. Vardi, On the semantics of updates in databases, Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp.352-365, 1983.

. Fagin-r, J. Y. Halpern, and M. Y. Vardi, A nonstandard approach to the logical omniscience problem, Artificial Intelligence, vol.79, issue.2, pp.203-240, 1995.

. L. Ginsberg-m and . Counterfactuals, Artificial Intelligence, vol.30, issue.1, pp.35-79, 1986.

. Hunter-h.-;-gabbay-d, . Smets-p, and . Eds, Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp.11-36, 1998.

. Koriche-f, . Dix-j, U. Furbach, and D. Cerro-l, A logic for anytime deduction and anytime compilation, Logics in Artificial Intelligence, vol.1489, pp.324-342, 1998.

. Koriche-f.-;-fribourg-l and . Ed, A logic for approximate first-order reasoning, Lecture Notes in Computer Science, vol.2142, pp.247-261, 2001.

. Lakemeyer-g, Limited reasoning in first-order knowledge bases, Artificial Intelligence, vol.71, pp.213-255, 1994.

. Lehmann-d, Another perspective on default reasoning, Annals of mathematics and artificial intelligence, vol.15, pp.61-82, 1995.

H. Levesque, A logic of implicit and explicit belief, Proceedings of the Sixth National Conference on Artificial Intelligence, pp.198-202, 1984.

L. J. , Frameworks for dealing with conflicting information and applications, 1995.

M. P. Porquet-n, Resource-bounded inference from inconsistent belief bases, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pp.103-108, 2001.

. Massacci-f, Anytime approximate modal reasoning, Proceedings of the Fifteenth National Conference on Artificial Intelligence and of the Tenth Conference on Innovative Applications of Artificial Intelligence, pp.274-279, 1998.

. Nebel-b, Belief revision and default reasoning: Syntax-based approaches, Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, pp.417-428, 1991.

. Nebel-b, How hard is it to revise a belief base?, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol.3, pp.77-145, 1998.

. Perlis-d, Sources of, and exploiting, inconsistency: preliminary report, Journal of Applied Non-Classical Logics, vol.7, pp.25-75, 1997.

G. Pinkas and . P. Loui-r, Reasoning from inconsistency: A taxonomy of principles for resolving conflict, Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pp.709-719, 1992.

. Rescher-n and . Manor-r, On inference from inconsistent premises, Theory and Decision, vol.1, pp.179-217, 1970.

. Rymon-r, Search through systematic set enumeration, Proceedings of the Third International Conference in Principles of Knowledge Representation and Reasoning, pp.539-550, 1992.

M. Schaerf and M. Cadoli, Tractable reasoning via approximation, Artificial Intelligence, vol.74, pp.249-310, 1995.

. Schuurmans-d and . Southey-f, Local search characteristics of incomplete SAT procedures, Artificial Intelligence, vol.132, issue.2, pp.121-150, 2001.

. Selman-b and H. A. Kautz, Knowledge compilation and theory approximation, Journal of the ACM, vol.43, issue.2, pp.193-224, 1996.

H. Zhang and M. E. Stickel, Implementing the Davis-Putnam method, Journal of Automated Reasoning, vol.24, pp.277-296, 2000.

. Zilberstein-s, Using anytime algorithms in intelligent systems, vol.17, pp.73-83, 1996.