Handling uncertainty in answer set programming

6Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

We present a probabilistic extension of logic programs under the stable model semantics, inspired by the concept of Markov Logic Networks. The proposed language takes advantage of both formalisms in a single framework, allowing us to represent commonsense reasoning problems that require both logical and probabilistic reasoning in an intuitive and elaboration tolerant way.

Cite

CITATION STYLE

APA

Wang, Y., & Lee, J. (2015). Handling uncertainty in answer set programming. In Proceedings of the National Conference on Artificial Intelligence (Vol. 6, pp. 4218–4219). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9726

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free