Banerjee, M. and Dubois, D.
2009. A simple modal logic for reasoning about revealed beliefs. In Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'09), 805–816.
Baral, C.
2003. Knowledge, Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK.
Bauters, K., Schockaert, S., De Cock, M. and Vermeir, D.
2010. Possibilistic answer set programming revisited. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI).
Bauters, K., Schockaert, S., De Cock, M. and Vermeir, D.
2011. Weak and strong disjunction in possibilistic ASP. In Proceedings of the 11th International Conference on Scalable Uncertainty Management (SUM).
Benferhat, S., Dubois, D., Garcia, L. and Prade, H.
2002. On the transformation between possibilistic logic bases and possibilistic causal networks. International Journal of Approximate Reasoning
29, 2, 135–173.
Benferhat, S., Dubois, D. and Prade, H.
1992. Representing default rules in possibilistic logic. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR), 673–684.
Benferhat, S., Dubois, D. and Prade, H.
1997. Nonmonotonic reasoning, conditional objects and possibility theory. Artificial Intelligence
92, 1–2, 259–276.
Brewka, G.
2002. Logic programming with ordered disjunction. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), 100–105.
Buccafurri, F., Faber, W. and Leone, N.
2002. Disjunctive logic programs with inheritance. Theory and Practice of Logic Programming
2, 3, 293–321.
Buccafurri, F., Leone, N. and Rullo, P.
2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering
12, 5, 845–860.
Cai, J.-Y., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K. and Wechsung, G.
1988. The Boolean hierarchy I: Structural properties. SIAM Journal on Computing
17, 6, 1232–1252.
Damásio, C. V. and Pereira, L. M.
2001. Monotonic and residuated logic programs. In Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU '01), 748–759.
Dubois, D., Lang, J. and Prade, H.
1991. Towards possibilistic logic programming. In Proceedings of the 8th International Conference on Logic Programming (ICLP), 581–595.
Dubois, D., Lang, J. and Prade, H.
1994. Possibilistic logic. In Handbook of Logic for Artificial Intelligence and Logic Programming, Gabbay, D. M., Hogger, C. J. and Robinson, J. A., Eds. Vol. 3. Oxford University Press, Oxford, UK, 439–513.
Dubois, D. and Prade, H.
1991. Epistemic entrenchment and possibilistic logic. Artificial Intelligence
50, 2, 223–239.
Dubois, D. and Prade, H.
1997. A synthetic view of belief revision with uncertain inputs in the framework of possibility theory. International Journal of Approximate Reasoning
17, 2–3, 295–324.
Dubois, D., Prade, H. and Schockaert, S.
2012. Stable models in generalized possibilistic logic. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 519–529.
Eiter, T. and Gottlob, G.
1993. Complexity results for disjunctive logic programming and application to non-monotonic logics. In Proceedings of the 1993 International Logic Programming Symposium (ILPS), 266–278.
Faber, W. and Woltran, S.
2009. Manifold answer-set programs for meta-reasoning. In LPNMR, Lecture Notes in Computer Science, Vol. 5753, Springer, New York, NY, 115–128.
Gelfond, M.
1987. On stratified autoepistemic theories. In Proceedings of the 6th National Conference on Artificial Intelligence (AAAI), 207–211.
Gelfond, M.
1991. Strong introspection. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI'91), 386–391.
Gelfond, M. and Lifschitz, V.
1991. Classical negation in logic programs and disjunctive databases. New Generation Computing
9, 365–385.
Gelfond, M. and Lifzchitz, V.
1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming (ICLP), 1081–1086.
Huth, M. and Ryan, M.
2004. Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press, Cambridge, UK.
Jaynes, E.
2003. Probability Theory: The Logic of Science. Cambridge University Press, Cambridge, UK.
Lifschitz, V.
2010. Thirteen definitions of a stable model. In Fields of Logic and Computation, Lecture Notes in Computer Science, Vol. 6300, 488–503.
Lifschitz, V. and Schwarz, G.
1993. Extended logic programs as autoepistemic theories. In Proceedings of the 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning, 101–114.
Loyer, Y. and Straccia, U.
2006. Epistemic foundation of stable model semantics. Theory and Practice of Logic Programming
6, 4, 355–393.
Marek, W. and Truszczyński, M.
1991. Autoepistemic logic. Journal of the ACM
38, 587–618.
Moore, R.
1985. Semantical considerations on non-monotonic logic. Artificial Intelligence
29, 1, 75–94.
Nguyen, L. A.
2005. On the complexity of fragments of modal logics. In Proceedings of the 5th International Conference on Advances in Modal Logic (AiML'05), 249–268.
Nicolas, P., Garcia, L., Stéphan, I. and Lefèvre, C.
2006. Possibilistic uncertainty handling for answer set programming. Annals of Mathematics and Artificial Intelligence
47, 1–2, 139–181.
Nieves, J. C. and Lindgren, H.
2012. Possibilistic nested logic programs. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), 267–276.
Nieves, J. C., Osorio, M. and Cortés, U.
2013. Semantics for possibilistic disjunctive programs. Theory and Practice of Logic Programming
13, 1, 33–70.
Papadimitriou, C.
1994. Computational Complexity. Addison-Wesley, Boston, MA.
Pearce, D.
1997. A new logical characterization of stable models and answer sets. In Proceedings of the 2nd International Workshop on Non-Monotonic Extensions of Logic Programming (NMELP), Lecture Notes in Artificial Intelligence, Vol. 1216, 57–70.
Sakama, C. and Inoue, K.
1994. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning
13, 1, 145–172.
Truszczyński, M.
2011. Revisiting epistemic specifications. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, Lecture Notes in Computer Science, Vol. 6565. Springer, Berlin, Germany, 315–333.
Vennekens, J., Verbaeten, S. and Bruynooghe, M.
2004. Logic programs with annotated disjunctions. In Proceedings of the 20th International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, Vol. 3132, 431–445.
Vlaeminck, H., Vennekens, J., Bruynooghe, M. and Denecker, M.
2012. Ordered epistemic logic: Semantics, complexity and applications. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR'12).
Zadeh, L.
1992. Fuzzy logic and the calculus of fuzzy if-then rules. In Proceedings of the 22nd IEEE International Symposium on Multiple-Valued Logic (ISMVL), 480–480.
