Skip to main content Accessibility help
×
Home

Characterizing and extending answer set semantics using possibility theory

  • KIM BAUTERS (a1), STEVEN SCHOCKAERT (a2), MARTINE DE COCK (a3) and DIRK VERMEIR (a4)

Abstract

Answer Set Programming (ASP) is a popular framework for modelling combinatorial problems. However, ASP cannot be used easily for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, whereas this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Characterizing and extending answer set semantics using possibility theory
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Characterizing and extending answer set semantics using possibility theory
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Characterizing and extending answer set semantics using possibility theory
      Available formats
      ×

Copyright

References

Hide All
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, 135173.
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, 259276.
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, 293321.
Buccafurri, F., Leone, N. and Rullo, P. 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12, 5, 845860.
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, 12321252.
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, 439513.
Dubois, D. and Prade, H. 1991. Epistemic entrenchment and possibilistic logic. Artificial Intelligence 50, 2, 223239.
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, 295324.
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, 115128.
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, 365385.
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, 355393.
Marek, W. and Truszczyński, M. 1991. Autoepistemic logic. Journal of the ACM 38, 587618.
Moore, R. 1985. Semantical considerations on non-monotonic logic. Artificial Intelligence 29, 1, 7594.
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, 139181.
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, 3370.
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, 145172.
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, 315333.
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.

Keywords

Related content

Powered by UNSILO
Type Description Title
PDF
Supplementary materials

Bauters Supplementary Material
Appendix

 PDF (328 KB)
328 KB

Characterizing and extending answer set semantics using possibility theory

  • KIM BAUTERS (a1), STEVEN SCHOCKAERT (a2), MARTINE DE COCK (a3) and DIRK VERMEIR (a4)

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.