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

Exploiting Game theory for Analysing Justifications

thEORY AND PRACTICE OF logic programming 2020年第6期20卷 880-894页

作者： MARYNISSEN, S. I. M. O. N. BOGAERTS, B. A. R. T. DENECKER, M. A. R. C. Katholieke Univ Leuven Leuven Belgium Vrije Univ Brussel Brussels Belgium

Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning;its most central concept is a justification: an explanation why a property holds (or does not hold) in a model. In this paper, we continue the study of justification theory by means of three major contributions. the first is studying the relation between justification theory and game theory. We show that justification frameworks can be seen as a special type of games. the established connection provides the theoretical foundations for our next two contributions. the second contribution is studying under which condition two different dialects of justification theory (graphs as explanations vs trees as explanations) coincide. the third contribution is establishing a precise criterion of when a semantics induced by justification theory yields consistent results. In the past proving that such semantics were consistent took cumbersome and elaborate proofs. We show that these criteria are indeed satisfied for all common semantics of logic programming.

关键词： justification theory positional games logic programming non-monotonic logic

来源：评论

学校读者我要写书评

暂无评论

White-box Induction From SVM Models: Explainable AI with logic programming

White-box Induction From SVM Models: Explainable AI with Log...

引用

36th international conference on logic programming (iclp)

作者： Shakerin, Farhad Gupta, Gopal Univ Texas Dallas Richardson TX 75083 USA

We focus on the problem of inducing logic programs that explain models learned by the support vector machine (SVM) algorithm. the top-down sequential covering inductive logic programming (ILP) algorithms (e.g., FOIL) apply hill-climbing search using heuristics from information theory. A major issue with this class of algorithms is getting stuck in local optima. In our new approach, however, the data-dependent hill-climbing search is replaced with a model-dependent search where a globally optimal SVM model is trained first, then the algorithm looks into support vectors as the most influential data points in the model, and induces a clause that would cover the support vector and points that are most similar to that support vector. Instead of defining a fixed hypothesis search space, our algorithm makes use of SHAP, an example-specific interpreter in explainable AI, to determine a relevant set of features. this approach yields an algorithm that captures the SVM model's underlying logic and outperforms other ILP algorithms in terms of the number of induced clauses and classification evaluation metrics.

关键词： Explainable AI Data Mining Inductive logic programming Machine Learning

来源：评论

学校读者我要写书评

暂无评论

MAP Inference for Probabilistic logic programming

MAP Inference for Probabilistic Logic Programming

引用

36th international conference on logic programming (iclp)

作者： Bellodi, Elena Alberti, Marco Riguzzi, Fabrizio Zese, Riccardo Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy

In Probabilistic logic programming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP setting: the Maximum-A-Posteriori (MAP) inference task, which determines the most likely values for a subset of the random variables given evidence on other variables, and the Most Probable Explanation (MPE) task, the instance of MAP where the query variables are the complement of the evidence variables. We present a novel algorithm, included in the PITA reasoner, which tackles these tasks by representing each problem as a Binary Decision Diagram and applying a dynamic programming procedure on it. We compare our algorithm with the version of ProbLog that admits annotated disjunctions and can perform MAP and MPE inference. Experiments on several synthetic datasets show that PITA outperforms ProbLog in many cases.

关键词： Probabilistic logics Binary decision diagrams Computer circuits Dynamic programming Inference engines logic programming MAP inferences Marginal probability Maximum a posteriori Most likely Most probable explanation Novel algorithm Query variables Synthetic datasets

来源：评论

学校读者我要写书评

暂无评论

Incremental maintenance of overgrounded logic programs with tailored simplifications

引用

thEORY AND PRACTICE OF logic programming 2020年第5期20卷 719-734页

作者： Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

the repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. the proposedovergrounded programs with tailoring(OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, ourtailored simplificationtechnique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance.

关键词： Knowledge Representation and Reasoning Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

Flexible coinductive logic programming

Flexible coinductive logic programming

引用

36th international conference on logic programming (iclp)

作者： DAGNINO, F. R. A. N. C. E. S. C. O. ANCONA, D. A. V. I. D. E. ZUCCA, E. L. E. N. A. Univ Genoa DIBRIS Genoa Italy

Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, calledflexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to get the correct meaning. We provide a detailed formal account of an extension of logic programming supporting flexible coinduction. Syntactically, programs are enriched bycoclauses, clauses with a special meaning used to tune the interpretation of predicates. As usual, the declarative semantics can be expressed as a fixed point which, however, is not necessarily the least, nor the greatest one, but is determined by the coclauses. Correspondingly, the operational semantics is a combination of standard SLD resolution and coSLD resolution. We prove that the operational semantics is sound and complete with respect to declarative semantics restricted to finite comodels.

关键词： coinduction operational semantics declarative semantics soundness completeness

来源：评论

学校读者我要写书评

暂无评论

eclingo : A Solver for Epistemic logic Programs

eclingo : A Solver for Epistemic Logic Programs

引用

36th international conference on logic programming (iclp)

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten Univ A Coruna La Coruna Spain Univ Potsdam 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.

关键词： Answer Set programming Epistemic logic Programs Non-Monotonic Reasoning Conformant Planning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Linear Algebraic Computation of logic Programs Using Sparse Representation 36

Enhancing Linear Algebraic Computation of Logic Programs Usi...

引用

36th international conference on logic programming (iclp)

作者： Quoc, Tuan Nguyen Inoue, Katsumi Sakama, Chiaki Natl Inst Informat Tokyo Japan Grad Univ Adv Studies SOKENDAI Hayama Kanagawa Japan Wakayama Univ Wakayama Japan

Algebraic characterization of logic programs has received increasing attention in recent years. Researchers attempt to exploit connections between linear algebraic computation and symbolic computation in order to perform logical inference in large scale knowledge bases. this paper proposes further improvement by using sparse matrices to embed logic programs in vector spaces. We show its great power of computation in reaching the fixpoint of the immediate consequence operator from the initial vector. In particular, performance for computing the least models of definite programs is dramatically improved in this way. We also apply the method to the computation of stable models of normal programs, in which the guesses are associated with initial matrices, and verify its effect when there are small numbers of negation. these results show good enhancement in terms of performance for computing consequences of programs and depict the potential power of tensorized logic programs.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Exploiting Game theory for Analysing Justifications

Exploiting Game Theory for Analysing Justifications

引用

36th international conference on logic programming (iclp)

作者： MARYNISSEN, S. I. M. O. N. BOGAERTS, B. A. R. T. DENECKER, M. A. R. C. Katholieke Univ Leuven Leuven Belgium Vrije Univ Brussel Brussels Belgium

关键词： justification theory positional games logic programming non-monotonic logic

来源：评论

学校读者我要写书评

暂无评论

Incremental maintenance of overgrounded logic programs with tailored simplifications

Incremental maintenance of overgrounded logic programs with ...

引用

36th international conference on logic programming (iclp)

作者： Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

关键词： Knowledge Representation and Reasoning Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

An analysis of lightning deaths in Brazil 2010-2020 36

An analysis of lightning deaths in Brazil 2010-2020

引用

36th international conference on Lightning Protection (iclp)

作者： de Souza, Danilo Ferreira Sueta, Helio Eiji Tatizawa, Hedio Martins Junior, Walter Aguiar Martinho, Edson Univ Sao Paulo Inst Energy & Environm IEE Sao Paulo Brazil Univ Fed Mato Grosso Cuiaba Brazil Brazilian Assoc Awareness Elect Hazards ABRACOPEL Salto Brazil

ISBN: (数字)9781665490245

ISBN: (纸本)9781665490245

Lightning is one of the leading causes of weather-related mortality worldwide. Brazil has the highest number of deaths caused by lightning, and no recent studies present these data. the Department of Informatics of the Unified Health System in Brazil - DATASUS has the Official data on all origins of deaths. thus, this work analyzed the 781 cases of deaths that occurred between 2010 and 2020, considering death primary caused by lightning. Currently, the states in the northern region of Brazil, due to the greater volume of rainfall and the more exposed work in open areas, have the highest number of deaths. the work also presents an analysis of the trend of reduction in the numbers of deaths that occurred in recent years that may continue. Data from DATASUS showed that most deaths from lightning (24%) occurred in rural areas, affecting agricultural workers (outdoors), but (22%) of the deaths occurred inside homes, and men represent more than 80% of the death victims.

关键词： lightning deaths Brazil DATASUS

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：