Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)
release_vr6hppwfqfeshjirtkc6nhstmm
by
Yi-Dong Shen, Thomas Eiter
2017 p5060-5064
Abstract
Epistemic negation 'not' along with default negation 'neg' plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing approaches behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M ( K F and M F are shorthands for (neg not F) and (not neg F), respectively). In this paper we present a general approach to epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were introduced by Gelfond 1991 over two decades ago.
In application/xml+jats
format
Archived Files and Locations
application/pdf 107.2 kB
file_y3whmosgunbcxoveuhtkuqesae
|
web.archive.org (webarchive) www.ijcai.org (web) |
paper-conference
Stage
published
Year 2017
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar