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

17th international conference on logic programming and Non-monotonic reasoning

作者： Chiariello, Francesco Ielo, Antonio Tarzariol, Alice Univ Toulouse IRIT ANITI Toulouse France Univ Calabria Arcavacata Di Rende Italy Univ Klagenfurt Klagenfurt Austria

ISBN: (纸本)9783031742088;9783031742095

Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Process Mining, thanks to their formal semantics that enables automated analysis techniques. In this context, model repair is the task of aligning a process model with actual executions of the process. Current solutions to model repair do not allow for embedding domain knowledge, providing guarantees of rigor, and enforcing structural requirements at the same time. In this paper, we fill this gap by proposing an approach based on the Inductive logic programming system ILASP. We then implement our approach and perform an experimental evaluation, showing both its expressiveness and feasibility.

关键词： Petri nets Process Mining Model Repair Answer Set programming Inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

A Semantical Approach to Abstraction in Answer Set programming and Assumption-Based Argumentation 17th

A Semantical Approach to Abstraction in Answer Set Programmi...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Apostolakis, Iosif Saribatur, Zeynep G. Wallner, Johannes P. Graz Univ Technol Graz Austria TU Wien Vienna Austria

ISBN: (纸本)9783031742088;9783031742095

Recently forms of abstraction have been proposed for both logic programs (LPs) under the answer set semantics (ASP) and for the related formalism of assumption-based argumentation (ABA), e.g., via clustering of atoms or assumptions, in order to simplify a given LP or ABA framework. In both approaches after clustering the original answer sets and assumption sets are over-approximated, with the aim of avoiding spuriousness. In contrast, in ASP a given LP is syntactically modified to achieve over-approximation, while on ABA the framework is minimally modified and the semantics is abstracted. In this work we follow the latter approach and provide a novel semantical abstraction for LPs and for ABA frameworks corresponding to LPs.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

Semantic-Based Arguments Using logic programming Rewriting Systems 17th

Semantic-Based Arguments Using Logic Programming Rewriting S...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Guerrero, Esteban Nieves, Juan Carlos Umea Univ Dept Comp Sci Umea Sweden

ISBN: (纸本)9783031742088;9783031742095

Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize the role of investigating general frameworks that can also provide a consistent and well-defined justification for a conclusion that cannot be inferred and there is certainty about it, which we call here NAF-arguments, which have been less explored in the formal argumentation theory, despite its potential use in practical applications for building nuanced well-structured explanations and justifications. this article introduces the so-called semantic argumentation guaranteeing well-known principles for quality in structured argumentation, and with the ability to generate two types of arguments, those where the conclusion atoms are semantically interpreted as true, and those where the conclusion is assumed to be false, we call them here semantic and NAF-arguments respectively. this framework is defined on the set of all logic programs in terms of rewriting systems based on a confluent set of transformation rules, the so-called Confluent logic programming Systems, making this approach a general framework. Additionally, we introduce a method for building such arguments using the program's strata through partial interpretations. We implement our framework named semantic argumentation solver available open source.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Bridging Deep Learning and logic programming for Explainability through ILP 40

Bridging Deep Learning and Logic Programming for Explainabil...

引用

40th international conference on logic programming (ICLP)

作者： Dreossi, Talissa Univ Udine Udine Italy

My research explores integrating deep learning and logic programming to set the basis for a new generation of AI systems. By combining neural networks with Inductive logic programming (ILP), the goal is to construct systems that make accurate predictions and generate comprehensible rules to validate these predictions. Deep learning models process and analyze complex data, while ILP techniques derive logical rules to prove the network's conclusions. Explainable AI methods, like eXplainable Answer Set programming (XASP), elucidate the reasoning behind these rules and decisions. the focus is on applying ILP frameworks, specifically ILASP and FastLAS, to enhance explainability in various domains. My test cases span weather prediction, the legal field, and image recognition. In weather forecasting, the system will predict events and provides explanations using FastLAS, with plans to integrate recurrent neural networks in the future. In the legal domain, the research focuses on interpreting vague decisions and assisting legal professionals by encoding Italian legal articles and learning reasoning patterns from Court of Cassation decisions using ILASP. For biological laboratories, we will collaborate with a research group to automate spermatozoa morphology classification for Bull Breeding Soundness Evaluation using YOLO networks and ILP to explain classification outcomes. this hybrid approach aims to bridge the gap between the high performance of deep learning models and the transparency of symbolic reasoning, advancing AI by providing interpretable and trustworthy applications.

关键词： Weather forecasting

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Issue on the international Joint conference on Rules and reasoning, RuleML+RR 2019

引用

thEORY AND PRACTICE OF logic programming 2022年第2期22卷 158-161页

作者： Fodor, Paul Montali, Marco SUNY Stony Brook Stony Brook NY 11794 USA Free Univ Bozen Bolzano Bolzano Italy

this special issue of theory and Practice of logic programming consists of extended versions of five selected papers from the 3rd international Joint conference on Rules and reasoning (RuleML+RR 2019). RuleML+RR 2019 was held in conjunction with the 5th Global conference on artificial intelligence, GCAI 2019, as part of the Bolzano Rules and artificial intelligence Summit in Bolzano, Italy, from 17 to 19 of September 2019.

关键词： RuleML RR rules and reasoning

来源：评论

学校读者我要写书评

暂无评论

Modelling Dialogues in a Concurrent Language for Argumentation 17th

Modelling Dialogues in a Concurrent Language for Argumentati...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Bistarelli, Stefano Chiara, Maria M. Taticchi, Carlo Univ Perugia Perugia Italy Univ G dAnnunzio Chieti Italy

ISBN: (纸本)9783031742088;9783031742095

In the fast-growing area of artificial intelligence (AI), the ability of autonomous agents to engage in complex debates is crucial for consensus building on beliefs, actions, or goals and forms the basis for applications in decision-making, planning, opinion polling, and negotiation. In this paper, we leverage the Timed Concurrent Language for Argumentation, a modelling language derived from concurrent programming paradigms and Argumentation theory, to introduce well-known high-level propositions (claim, counter, why, argue, concede, and retract) to model various debate forms, making it a powerful tool for agent interaction. the obtained constructs, specifically designed for multi-agent reasoning and the facilitation of argumentation, define the dialogue language DICLA (DIalogic Concurrent Language for Argumentation) that enables domain experts to employ advanced computational argumentation tools without needing programming skills, bridging the gap between theoretical argumentation models and practical, real-world applications.

关键词： Computational Argumentation Debates Concurrency Multi-agent reasoning

来源：评论

学校读者我要写书评

暂无评论

LTLf2ASP: LTLf Bounded Satisfiability in ASP 17th

LTLf2ASP: LTLf Bounded Satisfiability in ASP

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Fionda, Valeria Ielo, Antonio Ricca, Francesco Univ Calabria Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031742088;9783031742095

Finite variant of Linear Temporal logic (LTLf) is increasingly popular in artificial intelligence (AI).Indeed, several AI applications rely on checking the satisfiability of temporal specifications expressed in LTLf (e.g., planning, and model-checking). this paper describes ltlf2asp, an ASP-based system for bounded satisfiability checking of LTLf formulae. the approach is based on a natural encoding in ASP of temporal operators that is inspired to SAT-based approaches. Experiments show that our system compares favourably to the state-ofthe-art, and shows the ASP technology stack is a suitable alternative to SAT/SMT solvers for bounded satisfiability checking of LTLf formulae.

关键词： Linear Temporal logic over Finite Traces ASP

来源：评论

学校读者我要写书评

暂无评论

Adding Concurrency to Quantum Dynamic logic 4th

Adding Concurrency to Quantum Dynamic Logic

引用

4th international conference on artificial intelligence logic and Applications

作者： Jain, Manisha Fernandes, Vitor Madeira, Alexandre Univ Aveiro Dept Math CIDMA Aveiro Portugal Int Iberian Nanotechnol Lab INL Braga Portugal INESC TEC Porto Portugal Univ Minho Braga Portugal

ISBN: (纸本)9789819603534;9789819603541

this work focuses on quantum programming language and logics for quantum programs. We extend the standard quantum programming language with a parallel operator and an await command. Our extended quantum dynamic logic provides a more robust framework for reasoning about the behaviors and properties of quantum programs that utilize these new constructs. these new features enhance the language's capability to handle concurrent quantum operations and synchronization, enabling more advanced and efficient quantum computations.

关键词： Quantum dynamic logic Concurrent quantum programs Formal methods to quantum programming

来源：评论

学校读者我要写书评

暂无评论

Exploring Stanislavskian Performance for Agent-based Nonplayer Characters through Defeasible logic 24

Exploring Stanislavskian Performance for Agent-based Nonplay...

引用

24th international conference on Intelligent Virtual Agents

作者： Mitchell, Kyle Mccoy, Joshua Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9798400706257

Common approaches to behavioral artificial intelligence, like behavior trees, utility-based approaches, and machine learning are often lacking with regards to expressivity of the decision-making process. Behavior trees are too rigid;utility-based approaches are focused on outcomes, not process;and machine learned agents seek only to maximize reward and minimize loss. A combination of AI approaches, however, may provide more nuanced, visible, and coherent processes that can be realized through the performance of character behaviors. In this extended abstract, we present Viv: a system that blends defeasible logic programming with dynamic behavior trees. To our knowledge, no extant works have bridged the gap between defeasible reasoning and action, particularly in regards to the performances of virtual nonplayer characters. We begin by explaining the design of our system, which was heavily influenced by the Stanislavski method of acting. We then describe the technical implementation of our system. Finally, we describe future directions of research that could provide benefit to, or benefit from, our system.

关键词： computational performance defeasible logic logic programming nonplayer characters video games

来源：评论

学校读者我要写书评

暂无评论

Consequence Operators of Characterization logics - the Case of Abstract Argumentation 17th

Consequence Operators of Characterization Logics - The Case ...

引用

17th international conference on logic programming and Non-monotonic reasoning

作者： Baurnann, Ringo Strass, Hannes Univ Leipzig Leipzig Germany Ctr Scalable Data Analyt & Artificial Intelligenc Dresden Germany Tech Univ Dresden Dresden Germany

ISBN: (纸本)9783031742088;9783031742095

the analysis of properties of consequence operators has been a very active field in the formative years of non-monotonic reasoning. One possible approach to do this is to start with a model-theoretic semantics and then to study the logical consequence relation induced by that semantics. In this paper we follow that approach and analyse resulting consequence operators of so-called characterization logics. Roughly speaking, a characterization logic characterizes, via its own notion of ordinary equivalence, another logic's notion of strong equivalence. For example, the logic of here and there is a characterization logic for answer set programs, because strong equivalence of the latter is characterized by ordinary equivalence of the former. In previous work, we showed that the consideration of finite knowledge bases only - a common assumption in the field of knowledge representation - guarantees the existence (and uniqueness) of characterization logics. In this paper, we apply this existence result to the field of abstract argumentation. We show that the associated consequence operator outputs a so-called reverse kernel, a useful construct that received comparably little attention in the literature so far. As an aside, we clarify that for several well-known logics, their canonical characterization consequence operators are well-behaved.

关键词： Characterization logic Strong Equivalence Abstract Argumentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：