<div class="contents_title"> <div style="float:left">Contents</div> <div class="contentspagination"> <div class="pagination PagedList-pager"><ul><li class="previous PagedList-skipToFirst"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=1" title="Show first page">&laquo;</a></li><li class="PagedList-skipToPrevious"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=3" title="Show previous page">&lsaquo;</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=1" title="Show page 1">1</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=2" title="Show page 2">2</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=3" title="Show page 3">3</a></li><li class="active"><a>4</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=5" title="Show page 5">5</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=6" title="Show page 6">6</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=7" title="Show page 7">7</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=8" title="Show page 8">8</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=9" title="Show page 9">9</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=10" title="Show page 10">10</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=11" title="Show page 11">11</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=12" title="Show page 12">12</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=13" title="Show page 13">13</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=14" title="Show page 14">14</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=15" title="Show page 15">15</a></li><li class="disabled PagedList-ellipses"><a>&#8230;</a></li><li class="PagedList-skipToNext"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=5" title="Show next page">&rsaquo;</a></li><li class="next PagedList-skipToLast"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=17" title="Show last page">&raquo;</a></li></ul></div> </div> </div> <div class="contents" id="volumearticles" start="76"> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54937">Applying the Closed World Assumption to SUMO-Based FOL Ontologies for Effective Commonsense Reasoning</a></div> <label>Authors</label> <div class="value authors">Javier &#193;lvez, Itziar Gonzalez-Dios, German Rigau</div> <label>Pages</label> <div class="value pages">585 - 592</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200142</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Most commonly, the Open World Assumption is adopted as a standard strategy for the design, construction and use of ontologies. This strategy limits the inferencing capabilities of any system because non-asserted statements (missing knowledge) could be assumed to be alternatively true or false. As we will demonstrate, this is especially the case of first-order logic (FOL) ontologies where non-asserted statements is nowadays one of the main obstacles to its practical application in automated commonsense reasoning tasks. In this paper, we investigate the application of the Closed World Assumption (CWA) to enable a better exploitation of FOL ontologies by using state-of-the-art automated theorem provers. To that end, we explore different CWA formulations for the structural knowledge encoded in a FOL translation of the SUMO ontology, discovering that almost 30 % of the structural knowledge is missing. We evaluate these formulations on a practical experimentation using a very large commonsense benchmark obtained from WordNet through its mapping to SUMO. The results show that the competency of the ontology improves more than 50 % when reasoning under the CWA. Thus, applying the CWA automatically to FOL ontologies reduces their ambiguity and more commonsense questions can be answered.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54937" method="post"> <input type="hidden" name="id" value="54937" /> <div id='downloadlink54937' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54937').click(function () { $('form#downloadform54937').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54938">Evaluation of Analogical Arguments by Choquet Integral</a></div> <label>Authors</label> <div class="value authors">Leila Amgoud</div> <label>Pages</label> <div class="value pages">593 - 600</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200143</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Analogical arguments are a special type of inductive arguments, whereby perceived similarities are used as a basis to infer some further similarity that has yet to be observed. Although they are not deductively valid, they may yield conclusions that are very probably true, and may be more cogent than others in persuasive contexts.</p> <p>This paper tackles the question of their evaluation. It starts by discussing their features, how they can be attacked/supported, and key considerations for their evaluation. It argues in particular for the need of semantics that are able to take into account possible interactions (synergies, redundancies) between attackers (respectively supporters) of any analogical argument. It presents principles that serve as guidelines for choosing candidate semantics. Then, it shows that existing (extension, gradual, ranking) semantics are not suitable as they may lead to inaccurate assessments. Finally, it redefines three existing semantics using the well-known Choquet Integral for aggregating attackers/supporter, and discusses their properties.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54938" method="post"> <input type="hidden" name="id" value="54938" /> <div id='downloadlink54938' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54938').click(function () { $('form#downloadform54938').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54939">Modelling Belief-Revision Functions at Extended Languages</a></div> <label>Authors</label> <div class="value authors">Theofanis Aravanis, Pavlos Peppas, Mary-Anne Williams</div> <label>Pages</label> <div class="value pages">601 - 607</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200144</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>The policy of rational belief revision is encoded in the so-called AGM revision functions. Such functions are characterized (both axiomatically and constructively) within the well-known AGM paradigm, proposed by Alchourrón, Gärdenfors and Makinson. In this article, we show that — although not in a straightforward way — a sufficient extension of the underlying language allows for the modelling of any AGM revision function (defined at the initial language), by means of a Hamming-based rule for belief revision introduced by Dalal (defined at the extended language). The established results enrich the applicability of Dalal’s proposal, leading to a conceptual and ontological reduction, as well as open new doors for the construction of any type of revision function in a practical context, given the intuitive appeal and simplicity of Dalal’s construction.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54939" method="post"> <input type="hidden" name="id" value="54939" /> <div id='downloadlink54939' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54939').click(function () { $('form#downloadform54939').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54940">Prioritized Simple Contrapositive Assumption-Based Frameworks</a></div> <label>Authors</label> <div class="value authors">Ofer Arieli, Jesse Heyninck</div> <label>Pages</label> <div class="value pages">608 - 615</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200145</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Simple contrapositive assumption-based frameworks are a general setting for structured argumentation, providing a robust approach to reasoning with arguments and counter-arguments. In this paper we extend these frameworks with priorities and introduce some new results concerning the semantics of the resulting formalisms.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54940" method="post"> <input type="hidden" name="id" value="54940" /> <div id='downloadlink54940' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54940').click(function () { $('form#downloadform54940').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54941">Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints</a></div> <label>Authors</label> <div class="value authors">Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph</div> <label>Pages</label> <div class="value pages">616 - 623</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200146</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We introduce and investigate the expressive description logic (DL) ALCSCC⁺⁺, in which the global and local cardinality constraints introduced in previous papers can be mixed. We prove that the added expressivity does not increase the complexity of satisfiability checking and other standard inference problems. However, reasoning in ALCSCC⁺⁺ becomes undecidable if inverse roles are added or conjunctive query entailment is considered. We prove that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted. In this setting, query entailment can be shown to be EXPTIME-complete and hence not harder than reasoning in ALC.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54941" method="post"> <input type="hidden" name="id" value="54941" /> <div id='downloadlink54941' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54941').click(function () { $('form#downloadform54941').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54942">Reasoning with a Bounded Number of Resources in ATL+</a></div> <label>Authors</label> <div class="value authors">Francesco Belardinelli, St&#233;phane Demri</div> <label>Pages</label> <div class="value pages">624 - 631</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200147</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>The resource-bounded alternating-time temporal logic RB±ATL combines strategic reasoning with reasoning about resources. Its model-checking problem is known to be 2EXPTIME-complete (the same as its proper extension RB±ATL*). Several fragments have been identified to lower the complexity.</p> <p>In this work, we consider the variant RB±ATL⁺ which permits Boolean combinations of path formulae starting with single temporal operators, but restricted to a single resource, providing an interesting trade-off between temporal expressivity and resource analysis. We show that the model-checking problem for RB±ATL⁺ restricted to a single agent and a single resource is Δ<sup arrange="stack">p</sup><sub arrange="stack">2</sub>-complete, hence the same as for CTL⁺. In this case reasoning about resources comes at no extra computational cost. Furthermore, we show that, with an arbitrary number of agents and a fixed number of resources, the problem can be solved in EXPTIME using a Turing reduction to the parity game problem for alternating vector addition systems with states.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54942" method="post"> <input type="hidden" name="id" value="54942" /> <div id='downloadlink54942' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54942').click(function () { $('form#downloadform54942').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54943">Diagnosis of Temporal Faults in Discrete-Event Systems</a></div> <label>Authors</label> <div class="value authors">Nicola Bertoglio, Gianfranco Lamperti, Marina Zanella, Xiangfu Zhao</div> <label>Pages</label> <div class="value pages">632 - 639</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200148</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Model-based diagnosis of discrete-event systems (DESs) generates a set of candidates upon the reception of a temporal observation. In the literature, a candidate is a set of faults produced by a trajectory of the DES that is consistent with the temporal observation. As such, a candidate does not convey any temporal relationship between faults, nor does it account for multiple occurrences of the same fault. To overcome the limitations of this set-oriented approach to diagnosis of DESs, the novel notions of temporal fault and temporal diagnosis are proposed, along with two diagnosis techniques. A temporal fault is the (possibly unbounded) sequence of faults produced by a trajectory. A temporal diagnosis is a (possibly infinite) set of temporal faults. Hence, in this new temporal-oriented approach to diagnosis of DESs, a candidate is a temporal fault. The fact that a temporal diagnosis turns out to be a regular language is key to coping with the infinity of candidates, which can be represented by a regular expression. The diagnosis task can be performed either by restricting the DES space to the trajectories that are consistent with the temporal observation, or by exploiting a temporal diagnoser which allows for fast online diagnosis. The claim of this paper is that the extra temporal information embedded in candidates may be essential in taking critical decisions based on the diagnosis results.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54943" method="post"> <input type="hidden" name="id" value="54943" /> <div id='downloadlink54943' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54943').click(function () { $('form#downloadform54943').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54944">Step-Wise Explanations of Constraint Satisfaction Problems</a></div> <label>Authors</label> <div class="value authors">Bart Bogaerts, Emilio Gamba, Jens Claes, Tias Guns</div> <label>Pages</label> <div class="value pages">640 - 647</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200149</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We explore the problem of step-wise explaining how to solve constraint satisfaction problems, with a use case on logic grid puzzles. More specifically, we study the problem of explaining the inference steps that one can take during propagation, in a way that is easy to interpret for a person. We aim to give the constraint solver explainable agency, which can help in building trust in the solver by being able to understand and even learn from the explanations. The main challenge is that of finding a sequence of simple explanations, where each explanation should aim to be as cognitively easy as possible for a human to verify and understand. This contrasts with the arbitrary combination of facts and constraints that the solver may use when propagating. We propose the use of a cost function to quantify how simple an individual explanation of an inference step is, and identify the explanation-production problem of finding the best sequence of explanations of a CSP. We propose an approach that is agnostic of the underlying constraint propagation mechanisms, and that can provide explanations even for inference steps resulting from combinations of constraints. Our proposed algorithm iteratively constructs the explanation sequence by using an optimistic estimate of the cost function to guide the search for the best explanation at each step. Our experiments on logic grid puzzles show the feasibility of the approach in terms of the quality of the individual explanations and the resulting sequences obtained.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54944" method="post"> <input type="hidden" name="id" value="54944" /> <div id='downloadlink54944' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54944').click(function () { $('form#downloadform54944').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54945">Consolidating Modal Knowledge Bases</a></div> <label>Authors</label> <div class="value authors">Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis, Valentin Montmirail</div> <label>Pages</label> <div class="value pages">648 - 655</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200150</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>This paper introduces a novel approach to the consolidation of knowledge bases represented as modal logic formulae. The objective is to turn the given knowledge base into another knowledge base such that the latter is consistent even when the former is not. Our approach follows a strategy that locally spots and iteratively consolidates inconsistent subformulae of the input knowledge base. Existing methods for consolidating a knowledge base typically consist in selecting some of its maximal consistent subbases. Such methods are suited to the case the input is a (conjunctively-interpreted) set of formulae. However, they are inadequate when the input consists of a single inconsistent modal formula since, in the modal case, a formula cannot always be turned into a conjunction of simpler formulae. Furthermore, such methods consolidate any base consisting of a single inconsistent formula into the empty base. Our approach does not suffer from such limitations and preserves more information in the general case. From a computational point of view, it ensures that the size of the consolidated base is bounded by the size of the input knowledge base. We present some empirical results demonstrating the practical feasibility of our approach.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54945" method="post"> <input type="hidden" name="id" value="54945" /> <div id='downloadlink54945' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54945').click(function () { $('form#downloadform54945').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54946">Implementing Dynamic Answer Set Programming over Finite Traces</a></div> <label>Authors</label> <div class="value authors">Pedro Cabalar, Mart&#237;n Di&#233;guez, Torsten Schaub, Francois Laferriere</div> <label>Pages</label> <div class="value pages">656 - 663</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200151</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications. Starting from logical foundations, provided by dynamic and temporal equilibrium logics over finite linear traces, we develop a translation of dynamic formulas into temporal logic programs. This provides us with a normal form result establishing the strong equivalence of formulas in different logics. Our translation relies on the introduction of auxiliary atoms to guarantee polynomial space complexity and to provide an embedding that is doomed to be impossible over the same language. Finally, the reduction of dynamic formulas to temporal logic programs allows us to extend ASP with both approaches in a uniform way and to implement both extensions via temporal ASP solvers such as telingo.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54946" method="post"> <input type="hidden" name="id" value="54946" /> <div id='downloadlink54946' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54946').click(function () { $('form#downloadform54946').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54947">An ASP Semantics for Constraints Involving Conditional Aggregates</a></div> <label>Authors</label> <div class="value authors">Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko</div> <label>Pages</label> <div class="value pages">664 - 671</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200152</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables. This is achieved by introducing the construct of conditional expressions, which allow for considering two alternatives while evaluating constraints. Which alternative is considered is interpretation-dependent and chosen according to an associated condition. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints. Finally, we introduce a polynomial-size, modular and faithful translation from our framework into regular (condition-free) Constraint ASP, outlining an implementation of conditional aggregates on top of existing hybrid ASP solvers.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54947" method="post"> <input type="hidden" name="id" value="54947" /> <div id='downloadlink54947' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54947').click(function () { $('form#downloadform54947').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54948">Explanations for Ontology-Mediated Query Answering in Description Logics</a></div> <label>Authors</label> <div class="value authors">İsmail İlkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavičius</div> <label>Pages</label> <div class="value pages">672 - 679</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200153</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Ontology-mediated query answering is a paradigm that seeks to exploit the semantic knowledge expressed in terms of ontologies to improve query answers over incomplete data sources. In this paper, we focus on description logic ontologies, and study the problem of explaining why an ontology-mediated query is entailed from a given data source. Specifically, we view explanations as minimal sets of assertions from an ABox, which satisfy the ontology-mediated query. Based on such explanations, we study a variety of problems taken from the recent literature on explanations (studied for existential rules), such as recognizing all minimal explanations. Our results establish tight connections between intractable explanation problems and variants of propositional satisfiability problems. We provide insights on the inherent computational difficulty of deriving explanations for ontology-mediated queries.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54948" method="post"> <input type="hidden" name="id" value="54948" /> <div id='downloadlink54948' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54948').click(function () { $('form#downloadform54948').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54949">A Knowledge-Based System for the Dynamic Generation and Classification of Novel Contents in Multimedia Broadcasting</a></div> <label>Authors</label> <div class="value authors">Eleonora Chiodino, Davide Di Luccio, Antonio Lieto, Alberto Messina, Gian Luca Pozzato, Davide Rubinetti</div> <label>Pages</label> <div class="value pages">680 - 687</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200154</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>In this work we exploit a recently introduced nonmonotonic extension of Description Logics, able to deal with the problem of knowledge invention via commonsense concept combination, to dynamically generate novel editorial contents in the context of a real broadcasting company: RAI – Radiotelevisione Italiana, the Italian public broadcaster. In particular, we introduce the system implementing such logic, i.e. DENOTER: Dynamic gEnerator of NOvel contents in mulTimEdia bRoadcasting (available online at the URL: http://di.unito.it/denoter), that has been applied and tested in the online multimedia platform of RAI (i.e. RaiPlay) as a tool for both the generation/suggestion of novel genres of multimedia on-demand contents and the reclassification of the available items within such new genres. Our system works by extracting the typical properties characterizing the available genres (with a standard information extraction pipeline) and by building novel classes of genres as the result of a creative combination of such extracted representations. We have tested DENOTER (i) by reclassifying the available contents in RaiPlay with respect to the new generated genres (ii) with an evaluation, in the form of a controlled user study experiment, of the feasibility of using the obtained reclassifications as recommended contents (iii) with a qualitative evaluation done with a small group of experts of RAI. The obtained results are encouraging and pave the way to many possible further improvements and research directions.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54949" method="post"> <input type="hidden" name="id" value="54949" /> <div id='downloadlink54949' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54949').click(function () { $('form#downloadform54949').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54950">Minimality of Combined Qualitative Constraint Networks</a></div> <label>Authors</label> <div class="value authors">Quentin Cohen-Solal</div> <label>Pages</label> <div class="value pages">688 - 695</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200155</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We are interested in the minimality problem in the context of combinations of qualitative constraint networks (such as temporal sequences, multiscale networks, and loose integrations). For this, we generalize the minimality problem of the classical framework. This brings us to two distinct and complementary notions of minimality. We then study the complexity of the generalized minimality problem. In addition, we identify conditions ensuring that the algebraic closure computes the generalized minimal network. Based on this result, we prove that the topological temporal sequences of constant-size regions over the subclass SRCC8 check this property. This contrasts with the sequences of convex relations that do not verify it. Moreover, we study the complexity of the satisfiability decision of relations as well as the enumeration of satisfiable basic relations.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54950" method="post"> <input type="hidden" name="id" value="54950" /> <div id='downloadlink54950' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54950').click(function () { $('form#downloadform54950').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54951">An Approach to Fuzzy Modal Logic of Time Intervals</a></div> <label>Authors</label> <div class="value authors">Willem Conradie, Dario Della Monica, Emilio Mu&#241;oz-Velasco, Guido Sciavicco</div> <label>Pages</label> <div class="value pages">696 - 703</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200156</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Temporal reasoning based on intervals is nowadays ubiquitous in artificial intelligence, and the most representative interval temporal logic, called HS, was introduced by Halpern and Shoham in the eighties. There has been a great effort in the past in studying the expressive power and computational properties of the satisfiability problem for HS and its fragments, but only recently HS has been proposed as a suitable formalism for artificial intelligence applications. Such applications highlighted some of the intrinsic limits of HS: sometimes, when dealing with real-life data one is not able to express temporal relations and propositional labels in a definite, crisp way. In this paper, following the seminal ideas of Fitting and Zadeh, among others, we present a fuzzy generalization of HS that partially solves such problems of expressive power, and we prove that, as in the crisp case, its satisfiability problem is generally undecidable.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54951" method="post"> <input type="hidden" name="id" value="54951" /> <div id='downloadlink54951' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54951').click(function () { $('form#downloadform54951').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54952">Towards Inconsistency Measurement in Business Rule Bases</a></div> <label>Authors</label> <div class="value authors">Carl Corea, Matthias Thimm</div> <label>Pages</label> <div class="value pages">704 - 711</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200157</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We investigate the application of inconsistency measures to the problem of analysing business rule bases. Due to some intricacies of the domain of business rule bases, a straightforward application is not feasible. We therefore develop some new rationality postulates for this setting as well as adapt and modify existing inconsistency measures. We further adapt the notion of inconsistency values (or culpability measures) for this setting and give a comprehensive feasibility study.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54952" method="post"> <input type="hidden" name="id" value="54952" /> <div id='downloadlink54952' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54952').click(function () { $('form#downloadform54952').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54953">On the Reasons Behind Decisions</a></div> <label>Authors</label> <div class="value authors">Adnan Darwiche, Auguste Hirth</div> <label>Pages</label> <div class="value pages">712 - 720</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200158</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Recent work has shown that some common machine learning classifiers can be compiled into Boolean circuits that have the same input-output behavior. We present a theory for unveiling the reasons behind the decisions made by Boolean classifiers and study some of its theoretical and practical implications. We define notions such as sufficient, necessary and complete reasons behind decisions, in addition to classifier and decision bias. We show how these notions can be used to evaluate counterfactual statements such as “a decision will stick even if … because … .” We present efficient algorithms for computing these notions, which are based on new advances on tractable Boolean circuits, and illustrate them using a case study.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54953" method="post"> <input type="hidden" name="id" value="54953" /> <div id='downloadlink54953' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54953').click(function () { $('form#downloadform54953').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54954">On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks</a></div> <label>Authors</label> <div class="value authors">Wolfgang Dvoř&#225;k, Anna Rapberger, Stefan Woltran</div> <label>Pages</label> <div class="value pages">721 - 728</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200159</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>Dung’s abstract argumentation frameworks (AFs) are a popular conceptual tool to define semantics for advanced argumentation formalisms. Hereby, arguments representing a possible inference of a claim are constructed and an attack relation between arguments indicates certain conflicts between the claim of one argument and the inference of another. Based on this abstract model, sets of jointly acceptable arguments are then gathered and finally interpreted in terms of their claims. Argumentation formalisms following this type of instantiating Dung AFs naturally produce several arguments with the same claim. This causes several issues and challenges for argumentation systems: on the one hand, the relation between claims remains implicit and, on the other hand, determining the acceptance of claims requires additional computations on top of argument acceptance. An instantiation that avoids this situation could provide additional insights and advantages, thus complementing the standard instantiation process via Dung AFs. Consequently, the research question we tackle is as follows: Can one combine different arguments sharing the same claim to a single abstract argument without affecting the overall results (and which abstract formalisms can serve such a purpose)? As a main result we show that a certain class of frameworks, where arguments with the same claim have the same outgoing attacks, can be equivalently (for all standard semantics) represented as argumentation frameworks with collective attacks where each claim occurs in exactly one argument. We further identify a class of frameworks where one even obtains an equivalent Dung AF with just one argument per claim.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54954" method="post"> <input type="hidden" name="id" value="54954" /> <div id='downloadlink54954' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54954').click(function () { $('form#downloadform54954').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54955">Weighted LARS for Quantitative Stream Reasoning</a></div> <label>Authors</label> <div class="value authors">Thomas Eiter, Rafael Kiesel</div> <label>Pages</label> <div class="value pages">729 - 736</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200160</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We extend LARS, which is a recent stream reasoning framework based on ASP, to weighted LARS (wLARS), where formulae are interpreted as algebraic expressions over semirings. This adds the ability to express quantitative measures of many different natures and to approach respective reasoning problems such as probabilistic reasoning, preferential reasoning and quantitative queries in a uniform manner. Notably, well-known quantitative ASP extensions can be formalized using wLARS, thus lifting them to the streaming setting. We identify a relevant wLARS fragment that is equivalent to weighted automata, which consequently gives us a rule-based language for expressing behaviors of such automata. Furthermore, we analyze evaluating wLARS formulae, showing that brave preferential reasoning is PSPACE- resp. Σ<sup arrange="stack">p</sup><sub arrange="stack">3</sub>-complete in relevant settings.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54955" method="post"> <input type="hidden" name="id" value="54955" /> <div id='downloadlink54955' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54955').click(function () { $('form#downloadform54955').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54956">Embedding the Trust Degrees of Agents in Abstract Argumentation</a></div> <label>Authors</label> <div class="value authors">Bettina Fazzinga, Sergio Flesca, Filippo Furfaro</div> <label>Pages</label> <div class="value pages">737 - 744</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200161</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We propose a new paradigm for reasoning over abstract argumentation frameworks where the trustworthiness of the agents is taken into account. In particular, we study the problems of computing the minimum trust degree τ^* such that, if we discard the arguments said only by agents whose trust degree is not greater than τ^*, a given set of arguments S (resp., argument a), that is not necessarily an extension (resp., (credulously) accepted) over the original argumentation framework, becomes an extension (resp., (credulously) accepted). Solving these problems helps reason on how the robustness of sets of arguments and single arguments depends on what is considered trustworthy or not. We thoroughly characterize the computational complexity of the considered problems, along with some variants where a different aggregation mechanism is used to decide the arguments to discard.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54956" method="post"> <input type="hidden" name="id" value="54956" /> <div id='downloadlink54956' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54956').click(function () { $('form#downloadform54956').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54957">Ontology Focusing: Knowledge-Enriched Databases on Demand</a></div> <label>Authors</label> <div class="value authors">Tomasz Gogacz, V&#237;ctor Guti&#233;rrez-Basulto, Yazm&#237;n Ib&#225;&#241;ez-Garc&#237;a, Filip Murlak, Magdalena Ortiz, Mantas Šimkus</div> <label>Pages</label> <div class="value pages">745 - 752</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200162</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We propose a novel use of ontologies to aid the on-demand design of data-centric systems. By means of a process that we call focusing, a schema for a (possibly knowledge-enriched) database can be obtained semi-automatically from an existing ontology and a specification of the scope of the desired system. We formalize the inputs and outputs of focusing, and identify relevant computational problems: finding a schema via focusing, testing its consistency, and answering queries in the knowledge-enriched databases it produces. These definitions are independent from the ontology language. We then study focusing for selected description logics as ontology languages, and popular classes of queries for specifying the scope of the system. For several representative combinations, we study the decidability and complexity of the identified computational problems. As a by-product, we isolate (and solve) mixed variants of the classical satisfiability and entailment problems, where selected predicates are required to have finite extension, as well as the nullability problem, which is closely related to query emptiness.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54957" method="post"> <input type="hidden" name="id" value="54957" /> <div id='downloadlink54957' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54957').click(function () { $('form#downloadform54957').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54958">A Logic of Explicit and Implicit Distributed Belief</a></div> <label>Authors</label> <div class="value authors">Andreas Herzig, Emiliano Lorini, Elise Perrotin, Fabi&#225;n Romero, Fran&#231;ois Schwarzentruber</div> <label>Pages</label> <div class="value pages">753 - 760</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200163</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>We present a new logic of explicit and implicit distributed belief with a formal semantics exploiting the notion of belief base. A coalition’s distributed belief of explicit type corresponds to a piece of information contained in the collective belief base of the coalition, which is obtained by pooling together the individual belief bases of its members. A coalition’s distributed belief of implicit type corresponds to a piece of information that is derivable from the collective belief base of the coalition. We study axiomatic aspects of our logic as well as complexity of model checking. As distributed belief can be inconsistent (contrary to distributed knowledge), we also study a consistency-preserving variant of distributed belief inspired by the literature on belief merging.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54958" method="post"> <input type="hidden" name="id" value="54958" /> <div id='downloadlink54958' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54958').click(function () { $('form#downloadform54958').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54959">Macro Operator Synthesis for ADL Domains</a></div> <label>Authors</label> <div class="value authors">Till Hofmann, Tim Niemueller, Gerhard Lakemeyer</div> <label>Pages</label> <div class="value pages">761 - 768</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200164</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>A macro operator is a planning operator that is generated from a sequence of actions. Macros have mostly been used for macro planning, where the planner considers the macro as a single action and expands it into the original sequence during execution, but they can also be applied to other problems, such as maintaining a plan library. There are several approaches to macro operator generation, which differ in restrictions on the original actions and in the way they represent macros. However, all existing approaches are either restricted to STRIPS domains, only work on grounded actions, or they do not synthesize macros but consider the original sequence instead. We study the synthesis of macro operators for ADL domains. We describe how to compute the parameterized preconditions and effects of a macro operator such that they are equivalent to the preconditions and effects of the respective action sequence and prove the correctness of the synthesized macro operators based on a Situation Calculus semantics for ADL. We use the synthesis method for ADL macro planning and evaluate it on a number of domains from the IPC. As a second application, we describe how macro operator synthesis can be useful for maintaining a plan library by computing the precondition and effects of the parameterized library plans.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54959" method="post"> <input type="hidden" name="id" value="54959" /> <div id='downloadlink54959' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54959').click(function () { $('form#downloadform54959').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54960">Generating Instantiated Argument Graphs from Probabilistic Information</a></div> <label>Authors</label> <div class="value authors">Anthony Hunter</div> <label>Pages</label> <div class="value pages">769 - 776</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200165</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>The epistemic approach to probabilistic argumentation assigns belief to arguments. To better understand this approach, we consider structured arguments. Our approach is to start with a probability distribution, and generate an argument graph containing structured arguments with a probability assignment. We construct arguments directly from the probability distribution, rather than a knowledgebase, and then consider methods for selecting the arguments and counterarguments to present in the argument graph. This provides mechanisms for managing uncertainty in argumentation, and for argument-based explanations of probability distributions (that might come from data or from beliefs of an agent).</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54960" method="post"> <input type="hidden" name="id" value="54960" /> <div id='downloadlink54960' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54960').click(function () { $('form#downloadform54960').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> <div class="bookseriesvolumearticlelistitem"> <div class="content"> <div class="cover"></div> <div class="metadata"> <div class="expandable"> <div class="value title"><a href="/volumearticle/54961">Gradual Semantics for Logic-Based Bipolar Graphs Using T-(Co)norms</a></div> <label>Authors</label> <div class="value authors">Martin Jedwabny, Madalina Croitoru, Pierre Bisquert</div> <label>Pages</label> <div class="value pages">777 - 783</div> <label>DOI</label> <div class="value doi">10.3233/FAIA200166</div> <label>Category</label> <div class="value category">Research Article</div> <div class="abstract"> <b>Abstract</b><br /> <section> <p>In this paper we consider a bipolar graph structure encoding conflicting knowledge with logic formulas. Gradual semantics provide a way to assign strength values in the unit interval to nodes (i.e. logical inference steps) in the bipolar graph. Here, we introduce a new class of semantics based on the notions of T-norms and T-conorms and show that they handle circular reasoning and satisfy desirable properties such as provability and rewriting.</p> </section> </div> </div><div class="expandbuttons"><div class="expand">&darr; more</div><div class="collapse">&uarr; less</div></div> </div> <div class="actions"> <form action="/Download/Pdf" id="downloadform54961" method="post"> <input type="hidden" name="id" value="54961" /> <div id='downloadlink54961' class="button getpdf">Download </div> </form> <script type="text/javascript"> $(function () { $('div#downloadlink54961').click(function () { $('form#downloadform54961').submit(); }); }); </script> <div class="button openaccesslicense"> <a rel="license" target="_blank" title="This work is licensed under a Creative Commons License" href="https://creativecommons.org/licenses/by-nc/4.0/deed.en_US"> <img alt="Creative Commons License" style="border-width: 0" src="https://i.creativecommons.org/l/by-nc/4.0/80x15.png" /></a></div> </div> </div> </div> </div> <div class="contentspagination bottom"> <div class="pagination PagedList-pager"><ul><li class="previous PagedList-skipToFirst"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=1" title="Show first page">&laquo;</a></li><li class="PagedList-skipToPrevious"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=3" title="Show previous page">&lsaquo;</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=1" title="Show page 1">1</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=2" title="Show page 2">2</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=3" title="Show page 3">3</a></li><li class="active"><a>4</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=5" title="Show page 5">5</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=6" title="Show page 6">6</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=7" title="Show page 7">7</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=8" title="Show page 8">8</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=9" title="Show page 9">9</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=10" title="Show page 10">10</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=11" title="Show page 11">11</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=12" title="Show page 12">12</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=13" title="Show page 13">13</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=14" title="Show page 14">14</a></li><li><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=15" title="Show page 15">15</a></li><li class="disabled PagedList-ellipses"><a>&#8230;</a></li><li class="PagedList-skipToNext"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=5" title="Show next page">&rsaquo;</a></li><li class="next PagedList-skipToLast"><a data-ajax="true" data-ajax-method="get" data-ajax-mode="replace" data-ajax-update="#unobtrusive" href="/Publication/Descendants/54861?page=17" title="Show last page">&raquo;</a></li></ul></div> </div> <script type="text/javascript"> initExpandBoxesById("volumearticles", 10); </script>