Doxastic Group Reasoning via Multiple Belief Shadowing

Dunin-Keplicz, Barbara; Rüb, Inga; Szałas, Andrzej

doi:10.1007/978-3-030-33792-6_17

Cited by 3 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is intended to mean that the value of ∼q is hypothesized to be true and the value of ∼p is hypothesized to be false. Hence, (22) results in {p}, confirming the hypotheses. On the other hand, consider:…”

supporting

confidence: 79%

“…While the ontology may be huge, the inconsistency affects only literals involving ns(.). Some Further Use-Cases Due to a limited space let us only indicate some further use cases being directly relevant to the current paper: 3 actions in potentially inconsistent/incomplete environments [14]; belief fusion and shadowing [13,22]; argumentation [23,24]; approximate reasoning [59].…”

Section: Selected Use-casesmentioning

confidence: 99%

See 1 more Smart Citation

A Paraconsistent ASP-like Language with Tractable Model Generation

Szalas

2019

Preprint

View full text Add to dashboard Cite

Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set remains intractable. The goal of this research is to define a new ASP-like rule language, 4SP, with tractable model generation. The language combines ideas of ASP and a paraconsistent rule language 4QL. Though 4SP shares the syntax of ASP and for each program all its answer sets are among 4SP models, the new language differs from ASP in its logical foundations, the intended methodology of its use and complexity of computing models. As we show in the paper, 4QL can be seen as a paraconsistent counterpart of ASP programs stratified with respect to default negation. Although model generation of well-supported models for 4QL programs is tractable, dropping stratification makes both 4QL and ASP intractable. To retain tractability while allowing non-stratified programs, in 4SP we introduce trial expressions interlacing programs with hypotheses as to the truth values of default negations. This allows us to develop a model generation algorithm with deterministic polynomial time complexity. We also show relationships among 4SP, ASP and 4QL.

show abstract

supporting

confidence: 79%