Possibilistic ASP Base Revision by Certain Input

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Éric Würbel

IJCAI 2018 pp. 1824-1830

doi:10.24963/IJCAI.2018/252 /ijcai/2018/garcia2018ijcai-possibilistic/

Abstract

Belief base revision has been studied within the answer set programming framework. We go a step further by introducing uncertainty and studying belief base revision when beliefs are represented by possibilistic logic programs under possibilistic answer set semantics and revised by certain input. The paper proposes two approaches of rule-based revision operators and presents their semantic characterization in terms of possibilistic distribution. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.

PDF IJCAI Semantic Scholar

Cite

Text

Garcia et al. "Possibilistic ASP Base Revision by Certain Input." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/252

Markdown

[Garcia et al. "Possibilistic ASP Base Revision by Certain Input." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/garcia2018ijcai-possibilistic/) doi:10.24963/IJCAI.2018/252

BibTeX

@inproceedings{garcia2018ijcai-possibilistic,
  title     = {{Possibilistic ASP Base Revision by Certain Input}},
  author    = {Garcia, Laurent and Lefèvre, Claire and Papini, Odile and Stéphan, Igor and Würbel, Éric},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {1824-1830},
  doi       = {10.24963/IJCAI.2018/252},
  url       = {https://mlanthology.org/ijcai/2018/garcia2018ijcai-possibilistic/}
}