Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJuly 2018
Possibilistic ASP base revision by certain input
IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial IntelligencePages 1824–1830Belief 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 ...
- ArticleJuly 2018
Exploiting justifications for lazy grounding of answer set programs
IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial IntelligencePages 1737–1745Answer set programming (ASP) is an established knowledge representation formalism. Lazy grounding avoids the so-called grounding bottleneck of ASP by interleaving grounding and solving; this technique was recently extended to work with conflict-driven ...
- ArticleJuly 2018
Single-shot epistemic logic program solving
IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial IntelligencePages 1714–1720Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making ...
- ArticleJuly 2018
Query answering in propositional circumscription
IJCAI'18: Proceedings of the 27th International Joint Conference on Artificial IntelligencePages 1669–1675Propositional circumscription defines a preference relation over the models of a propositional theory, so that models being subset-minimal on the interpretation of a set of objective atoms are preferred. The complexity of several computational tasks ...