Academic Bibliography

 Search 200 years of publications by Ghent University researchers.
Advanced search
1 file | 434.08 KB
Add to list
  1. Search results
  2. Answer set programs with optional rul...

Answer set programs with optional rules: a possibilistic approach

Kim Bauters (UGent) , Steven Schockaert (UGent) , Martine De Cock (UGent) and Dirk Vermeir
(2013) Working papers of the IJCAI-2013 workshop on weighted logics for artificial intelligence WL4AI-2013. p.2-9
Author
Organization
Abstract
Many problems in artificial intelligence can be encoded as answer set programs (ASP) in which some rules are uncertain. ASP programs with incorrect rules may have erroneous conclusions, but due to the non-monotonic nature of ASP, omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program, we thus need to consider all situations in which some, none, or all of the least certain rules are omitted. This corresponds to treating some rules as optional and reasoning about which conclusions remain valid regardless of the inclusion of these optional rules. While a version of possibilistic ASP (PASP) based on this view has recently been introduced, no implementation is currently available. In this paper we propose a simulation of the main reasoning tasks in PASP using (disjunctive) ASP programs, allowing us to take advantage of state-of-the-art ASP solvers. Furthermore, we identify how several interesting AI problems can be naturally seen as special cases of the considered reasoning tasks, including cautious abductive reasoning and conformant planning. As such, the proposed simulation enables us to solve instances of the latter problem types that are more general than what current solvers can handle.

Downloads

  • Download
    wl4ai2013.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 434.08 KB

Citation

Please use this url to cite or link to this publication:

MLA
Bauters, Kim, et al. “Answer Set Programs with Optional Rules: A Possibilistic Approach.” Working Papers of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence WL4AI-2013, 2013, pp. 2–9.
APA
Bauters, K., Schockaert, S., De Cock, M., & Vermeir, D. (2013). Answer set programs with optional rules: a possibilistic approach. Working Papers of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence WL4AI-2013, 2–9.
Chicago author-date
Bauters, Kim, Steven Schockaert, Martine De Cock, and Dirk Vermeir. 2013. “Answer Set Programs with Optional Rules: A Possibilistic Approach.” In Working Papers of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence WL4AI-2013, 2–9.
Chicago author-date (all authors)
Bauters, Kim, Steven Schockaert, Martine De Cock, and Dirk Vermeir. 2013. “Answer Set Programs with Optional Rules: A Possibilistic Approach.” In Working Papers of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence WL4AI-2013, 2–9.
Vancouver
1.
Bauters K, Schockaert S, De Cock M, Vermeir D. Answer set programs with optional rules: a possibilistic approach. In: Working papers of the IJCAI-2013 workshop on weighted logics for artificial intelligence WL4AI-2013. 2013. p. 2–9.
IEEE
[1]
K. Bauters, S. Schockaert, M. De Cock, and D. Vermeir, “Answer set programs with optional rules: a possibilistic approach,” in Working papers of the IJCAI-2013 workshop on weighted logics for artificial intelligence WL4AI-2013, Beijing, PR China, 2013, pp. 2–9.
@inproceedings{4123811,
  abstract     = {{Many problems in artificial intelligence can be encoded as answer set programs (ASP) in which some rules are uncertain. ASP programs with incorrect rules may have erroneous conclusions, but due to the non-monotonic nature of ASP, omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program, we thus need to consider all situations in which some, none, or all of the least certain rules are omitted. This corresponds to treating some rules as optional and reasoning about which conclusions remain valid regardless of the inclusion of these optional rules. While a version of possibilistic ASP (PASP) based on this view has recently been introduced, no implementation is currently available. In this paper we propose a simulation of the main reasoning tasks in PASP using (disjunctive) ASP programs, allowing us to take advantage of state-of-the-art ASP solvers. Furthermore, we identify how several interesting AI problems can be naturally seen as special cases of the considered reasoning tasks, including cautious abductive reasoning and conformant planning. As such, the proposed simulation enables us to solve instances of the latter problem types that are more general than what current solvers can handle.}},
  author       = {{Bauters, Kim and Schockaert, Steven and De Cock, Martine and Vermeir, Dirk}},
  booktitle    = {{Working papers of the IJCAI-2013 workshop on weighted logics for artificial intelligence WL4AI-2013}},
  language     = {{eng}},
  location     = {{Beijing, PR China}},
  pages        = {{2--9}},
  title        = {{Answer set programs with optional rules: a possibilistic approach}},
  url          = {{http://www.iiia.csic.es/wl4ai/files/wl4ai-2013-working-papers-last.pdf}},
  year         = {{2013}},
}