首页/论文/1908.05737

arXiv 1908.057372019-08-14cs.AIcs.LOcs.MA

Applications of Linear Defeasible Logic: combining resource consumption and exceptions to energy management and business processes

Data61, CSIRO（联邦科学与工业研究组织数据61所）；University of Verona（维罗纳大学）

Francesco Olivieri, Guido Governatori, Claudio Tomazzoli, Matteo Cristani

备注：: In Proceedings DICE-FOPARA 2019, arXiv:1908.04478. arXiv admin note: substantial text overlap with arXiv:1809.03656
发表信息：: EPTCS 298, 2019, pp. 1-14
DOI：: 10.4204/EPTCS.298.1

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

Linear Logic and Defeasible Logic have been adopted to formalise different features of knowledge representation: consumption of resources, and non monotonic reasoning in particular to represent exceptions. Recently, a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects to handle potentially conflicting information, has been discussed in literature, by some of the authors. Two applications emerged that are very relevant: energy management and business process management. We illustrate a set of guide lines to determine how to apply linear defeasible logic to those contexts.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility in ASP

Fondazione Bruno Kessler（布鲁诺·凯斯勒基金会）；Technische Universität Wien（维也纳工业大学）

Reasoning on defeasible knowledge is a topic of interest in the area of description logics, as it is related to the need of representing exceptional instances in knowledge bases. In this direction, in our previous works we presented a framework for representing (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms: reasoning in such framework is realized by a translation into ASP programs. The resulting reasoning process for OWL RL, however, introduces a complex encoding in order to capture reasoning on the negative information needed for reasoning …

2021-06-30cs.AIcs.LO

A Note on Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility

Fondazione Bruno Kessler（布鲁诺·凯斯勒基金会）；Technische Universität Wien（维也纳工业大学）

Representation of defeasible information is of interest in description logics, as it is related to the need of accommodating exceptional instances in knowledge bases. In this direction, in our previous works we presented a datalog translation for reasoning on (contextualized) OWL RL knowledge bases with a notion of justified exceptions on defeasible axioms. While it covers a relevant fragment of OWL, the resulting reasoning process needs a complex encoding in order to capture reasoning on negative information. In this paper, we consider the case of knowledge bases in $\textit{DL-Lite}_{\cal R}…

2019-05-22cs.AIcs.LO

面向命题型KLM风格可废止立场逻辑

Towards Propositional KLM-Style Defeasible Standpoint Logics

University of Cape Town（开普敦大学）；CAIR（计算与人工智能研究所）；Technische Universität Dresden（德累斯顿工业大学）；Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig（德累斯顿/莱比锡可扩展数据分析与人工智能中心）

本文提出可废止受限立场逻辑DRSL，整合排序解释与立场结构构建其语义，将KLM的理性闭包扩展到该逻辑并给出等价的算法与语义刻画，验证其蕴涵检验复杂度与命题KLM一致。

2024-10-05cs.AI

Resource-driven Substructural Defeasible Logic

Data61 CSIRO（联邦科学与工业研究组织数据61所）；University of Verona（维罗纳大学）

Linear Logic and Defeasible Logic have been adopted to formalise different features relevant to agents: consumption of resources, and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects, and we discuss the design choices for the framework.

2018-09-11cs.AIcs.LOcs.MA

Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure

Università del Piemonte Orientale（东皮埃蒙特大学）；Università di Torino（都灵大学）

Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational closure. The rational closure has the merit of providing a simple and efficient approach for reasoning with exceptions, but it does not allow independent handling of the inheritance of different defeasible properties of concepts. In this work we outline a possible solution to this problem by introducing a variant of the lexicographical closure, that we call skep…

2018-07-08cs.AI

了解你的例外：面向知识表示中的例外本体研究

Know your exceptions: Towards an Ontology of Exceptions in Knowledge Representation

Free University of Bozen-Bolzano（波尔扎诺自由大学）；Fondazione Bruno Kessler（布鲁诺·凯塞勒基金会）

针对可废止推理形式化体系的本体论适配选择难题，研究提出基于例外性与可废止性的比较框架，通过对四种系统的对比验证了框架可揭示不同体系的本体论差异。

2024-03-05cs.AI

更多相关论文收起更多论文

An Update Semantics for Defeasible Obligations

Erasmus University Rotterdam（鹿特丹伊拉斯姆斯大学）

The deontic logic DUS is a Deontic Update Semantics for prescriptive obligations based on the update semantics of Veltman. In DUS the definition of logical validity of obligations is not based on static truth values but on dynamic action transitions. In this paper prescriptive defeasible obligations are formalized in update semantics and the diagnostic problem of defeasible deontic logic is discussed. Assume a defeasible obligation `normally A ought to be (done)' together withthe fact `A is not (done).' Is this an exception of the normality claim, or is it a violation of the obligation? In thi…

2013-01-23cs.AIcs.LO

Computing Strong and Weak Permissions in Defeasible Logic

NICTA（澳大利亚国家信息与通信技术研究院）；University of Verona（维罗纳大学）；Griffith University（格里菲斯大学）；University of Bologna（博洛尼亚大学）

In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite obligations. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permiss…

2012-12-01cs.AIcs.LO

使用大型语言模型对可废止推理进行基准测试——初步实验与未来方向

Benchmarking Defeasible Reasoning with Large Language Models -- Initial Experiments and Future Directions

School of Computing and Engineering, University of Huddersfield（哈德斯菲尔德大学计算与工程学院）；Hellenic Mediterranean University（希腊地中海大学）；Leeds Beckett University（利兹贝克特大学）

本文提出一个可废止基于规则推理的基准，通过将可废止逻辑规则转化为文本，使用ChatGPT进行非单调推理初步实验并比较其推理模式。

2024-10-16cs.AI

从法规到控制流：基于跨度义务树的可废止范围解析

From Statute to Control Flow: Span-Grounded Deontic Trees for Defeasible Scope Parsing

The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；Sun Yat-Sen University（中山大学）

提出NormBench基准和跨度义务树（SG-DT）中间表示，用于诊断和缓解规则遵循模型中的静默范围遗漏（SSO）问题，揭示递归衰减和可审计性陷阱两种病理，并通过约束输出改善树结构保真度。

2026-06-08cs.AIcs.CEcs.CL

DAOnt：欧盟数据法案合规性的形式本体

DAOnt: A Formal Ontology for EU Data Act Compliance

Universidad Politécnica de Madrid（西班牙马德里理工大学）

本文提出DAOnt本体，通过机器可读表示支持数据共享协议的推理，复用LKIF-Core、ODRL和DPV本体元素，实现数据法案合规性检查。

2026-03-27cs.AIcs.CYcs.DB

LOGicalThought：面向高可信推理的大语言模型基于逻辑的本体奠基方法

LOGicalThought: Logic-Based Ontological Grounding of LLMs for High-Assurance Reasoning

针对关键领域高可信推理需求，提出神经符号架构LOGicalThought，结合逻辑语言、推理器与大语言模型构建双重上下文，将长文本推理转化为紧凑评估，在多基准上显著提升三类逻辑推理性能。

2025-10-02cs.AI

Probabilistic and Non-Monotonic Inference

University of Rochester（罗切斯特大学）

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is not rational of me to believe S. These seem a perfectly ordinary, common sense, pair of situations. Generally and vaguely, I take them to embody what I shall call probabilistic inference. This form of inference is clearly non-monotonic. Relatively few people have taken this form of inference, based on high probability, to serve as a foundation for non-monoton…

2013-03-27cs.AI

一种用于上下文感知规范性流程监控的创新数据驱动与自适应强化学习方法

An Innovative Data-Driven and Adaptive Reinforcement Learning Approach for Context-Aware Prescriptive Process Monitoring

Faculty of Engineering and Computer Science, University of Victoria, BC, Canada（工程与计算机科学学院，维多利亚大学）；Computer Science, Irving K. Barber Faculty of Science, University of British Columbia, BC, Canada（计算机科学，不列颠哥伦比亚大学理学院）

提出FORLAPS框架，结合强化学习与状态相关奖励塑形机制识别业务流程最优执行路径，并引入流程感知数据增强技术，实验证明其在多行业场景中显著节省资源与时间，优于现有方法。

2025-05-27cs.AIcs.LG