检索结果-内蒙古大学图书馆

An ASP-Based Approach to Counterfactual Explanations for Classification

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Bertossi, Leopoldo Universidad Adolfo Ibáñez ✶ RelationalAI’s Academic Network Millenium Institute on Foundations of Data UAI Faculty Eng. & Sciences Santiago Chile

We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. They can be applied with black-box models and models that can be specified as logic programs, such as rule-based classifiers. The main focus in on the specification and computation of maximum responsibility causal explanations. The use of additional semantic knowledge is investigated. Copyright © 2020, The Authors. All rights reserved.

关键词： logic programming

Fixed Point Semantics for Stream Reasoning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Antić, Christian Institute of Discrete Mathematics and Geometry Vienna University of Technology Wiedner Hauptstraße 8-10 ViennaA-1040 Austria

Reasoning over streams of input data is an essential part of human intelligence. During the last decade stream reasoning has emerged as a research area within the AI-community with many potential applications. In fact, the increased availability of streaming data via services like Google and Facebook has raised the need for reasoning engines coping with data that changes at high rate. Recently, the rule-based formalism LARS for non-monotonic stream reasoning under the answer set semantics has been introduced. Syntactically, LARS programs are logic programs with negation incorporating operators for temporal reasoning, most notably window operators for selecting relevant time points. Unfortunately, by preselecting fixed intervals for the semantic evaluation of programs, the rigid semantics of LARS programs is not flexible enough to constructively cope with rapidly changing data dependencies. Moreover, we show that defining the answer set semantics of LARS in terms of FLP reducts leads to undesirable circular justifications similar to other ASP extensions. This paper fixes all of the aforementioned shortcomings of LARS. More precisely, we contribute to the foundations of stream reasoning by providing an operational fixed point semantics for a fully flexible variant of LARS and we show that our semantics is sound and constructive in the sense that answer sets are derivable bottom-up and free of circular justifications. Copyright © 2020, The Authors. All rights reserved.

关键词： logic programming

Toward a concept of derivation for Prolog 32

学校读者我要写书评

暂无评论

Toward a concept of derivation for Prolog

32. Workshops fur (Constraint) Logische Programmierung, WCLP 2018 - 32nd Workshop on (Constraint) logic programming, WCLP 2018

作者： Kulaš, Marija FernUniversität Hagen Wissensbasierte Systeme Hagen58084 Germany

In logic programming, derivations are dependant on two kinds of implicit parameters: history of a derivation step, and (in case of implementation) also algorithms, which restrict the freedom of derivation and generate backtracking. On that basis, we propose a concept of derivation including backtracking and aggregation of steps. © Deklarative Ansatze zur Kunstlichen Intelligenz - Punktuelle Beitrage - Post-Proceedings des 32. Workshops fur (Constraint) Logische Programmierung, WCLP 2018. All rights reserved.

关键词： logic programming

Defeasible disjunctive datalog

学校读者我要写书评

暂无评论

Defeasible disjunctive datalog

2019 South African Forum for Artificial Intelligence Research, FAIR 2019

作者： Morris, Matthew Ross, Tala Meyer, Thomas University of Cape Town Cape Town South Africa CAIR South Africa

Datalog is a declarative logic programming language that uses classical logical reasoning as its basic form of reasoning. Defeasible reasoning is a form of non-classical reasoning that is able to deal with exceptions to general assertions in a formal manner. The KLM approach to defeasible reasoning is an axiomatic approach based on the concept of plausible inference. Since Datalog uses classical reasoning, it is currently not able to handle defeasible implications and exceptions. We aim to extend the expressivity of Datalog by incorporating KLM-style defeasible reasoning into classical Datalog. We present a systematic approach to extending the KLM properties and a well-known form of defeasible entailment: Rational Closure. We conclude by exploring Datalog extensions of less conservative forms of defeasible entailment: Relevant and Lexicographic Closure. Copyright © 2019 for this paper by its authors.

关键词： logic programming

SOS Rules for Equivalences of Reaction Systems

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Brodo, Linda Bruni, Roberto Falaschi, Moreno Dipartimento di Scienze economiche e aziendali Università di Sassari Italy Dipartimento di Informatica Università di Pisa Italy Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche Università di Siena Italy

Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by reactions. Entities can also be provided by an external context. RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities, a rewrite step consists of the application of all and only the enabled reactions. In this paper we define, for the first time, a labelled transition system for RSs in the structural operational semantics (SOS) style. This is achieved by distilling a signature whose operators directly correspond to the ingredients of RSs and by defining some simple SOS inference rules for any such operator to define the behaviour of the RS in a compositional way. The rich information recorded in the labels allows us to define an assertion language to tailor behavioural equivalences on some specific properties or entities. The SOS approach is suited to drive additional enhancements of RSs along features such as quantitative measurements of entities and communication between RSs. The SOS rules have been also exploited to design a prototype implementation in logic *** Codes 68N15 (Primary) 68N30 (Secondary) Copyright © 2020, The Authors. All rights reserved.

关键词： logic programming

Debugging of answer set programs using paracoherent reasoning 34

学校读者我要写书评

暂无评论

Debugging of answer set programs using paracoherent reasonin...

34th Italian Conference on Computational logic, CILC 2019

作者： Cuteri, Bernardo Dodaro, Carmine Ricca, Francesco University of Calabria Italy University of Genoa Italy

Answer Set programming is a well-known declarative programming paradigm proposed in the area of logic programming and non-monotonic reasoning. Although ASP features a simple syntax and an intuitive semantics, errors are common during the development of ASP programs. In this paper we propose a novel debugging approach based on paracoherent reasoning, which allows a user to identify bugs when they are related to wrong constraints. The approach has been implemented in a tool called paradebug, that is made freely available. © 2019 CEUR-WS. All rights reserved.

关键词： logic programming

Incremental reasoning for fleet management 19

学校读者我要写书评

暂无评论

Incremental reasoning for fleet management

13th ACM International Conference on Distributed and Event-Based Systems, DEBS 2019

作者： Tsilionis, Efthimis Artikis, Alexander Paliouras, Georgios NCSR Demokritos Greece University of Piraeus Greece

ISBN: (纸本)9781450367943

We propose RTECinc, an incremental version of RTEC, a composite event recognition engine with formal, declarative semantics, that has been shown to scale to several real-world data streams. RTEC deals with delayed arrival of events by computing at each query time everything from scratch. This is often not efficient since it results to redundant computations. Instead, RTECinc deals with delays in a more efficient way, by updating only the affected events. We compare RTECinc and RTEC experimentally using a real-world dataset with position signals of vehicles. © 2019 Authors.

关键词： logic programming

selp: A Single-Shot Epistemic logic Program Solver

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Bichler, Manuel Morak, Michael Woltran, Stefan TU Wien Vienna Austria

Epistemic 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 multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system "selp", which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances. Copyright © 2020, The Authors. All rights reserved.

关键词： logic programming

eclingo: A solver for Epistemic logic Programs∗

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten University of Corunna Spain University of Potsdam Germany

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo’s efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results. Copyright © 2020, The Authors. All rights reserved.

关键词： logic programming