Sökning: L773:0888 613X OR L773:1873 4731 >
Rough set reasoning...
-
Doherty, Patrick,1957-Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska fakulteten,School of Intelligent Systems and Engineering, Jinan University (Zhuhai Campus), Zhuhai, China
(författare)
Rough set reasoning using answer set programs
- Artikel/kapitelEngelska2021
Förlag, utgivningsår, omfång ...
-
Elsevier,2021
-
electronicrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:liu-172791
-
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-172791URI
-
https://doi.org/10.1016/j.ijar.2020.12.010DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
Funding: ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF(Smart Systems Project) [RIT15-0097]; Jinan University (Zhuhai Campus); National Science Centre PolandNational Science Centre, Poland [2017/27/B/ST6/02018]
-
Reasoning about uncertainty is one of the main cornerstones of Knowledge Representation. Formal representations of uncertainty are numerous and highly varied due to different types of uncertainty intended to be modeled such as vagueness, imprecision and incompleteness. There is a rich body of theoretical results that has been generated for many of these approaches. It is often the case though, that pragmatic tools for reasoning with uncertainty lag behind this rich body of theoretical results. Rough set theory is one such approach for modeling incompleteness and imprecision based on indiscernibility and its generalizations. In this paper, we provide a pragmatic tool for constructively reasoning with generalized rough set approximations that is based on the use of Answer Set Programming (Asp). We provide an interpretation of answer sets as (generalized) approximations of crisp sets (when possible) and show how to use Asp solvers as a tool for reasoning about (generalized) rough set approximations situated in realistic knowledge bases. The paper includes generic Asp templates for doing this and also provides a case study showing how these techniques can be used to generate reducts for incomplete information systems. Complete, ready to run clingo Asp code is provided in the Appendix, for all programs considered. These can be executed for validation purposes in the clingo Asp solver.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Szalas, Andrzej,Professor,1956-Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska fakulteten,Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland(Swepub:liu)andsz77
(författare)
-
Linköpings universitetArtificiell intelligens och integrerade datorsystem
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:International Journal of Approximate Reasoning: Elsevier130:March, s. 126-1490888-613X1873-4731
Internetlänk
Hitta via bibliotek
Till lärosätets databas