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

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Böhl, Elisa Gaggl, Sarah Alice Rusovac, Dominik Logic Programming and Argumentation Group Tu Dresden Germany

ISBN: (纸本)9781643684369

Answer set programming (ASP) is a popular problem solving paradigm with applications in planning and configuration. In practice, the number of answer sets can be overwhelmingly high, which naturally causes interest in a concise characterisation of the solution space in terms of representative answer sets. We establish a notion of representativeness that refers to the entropy of specified target atoms within a collection of answer sets. Accordingly, we propose different approaches for collecting such representative answer sets, based on answer set navigation. Finally, we conduct experiments using our prototypical implementation, which reveals promising results. © 2023 The Authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Winning Snake: Design Choices in Multi-Shot ASP

引用

THEORY AND PRACTICE OF logic programming 2024年第4期24卷 772-789页

作者： Boehl, Elisa Ellmauthaler, Stefan Gaggl, Sarah alice Tech Univ Dresden Logic Programming & Argumentat Dresden Germany Tech Univ Dresden ScaDS AI Cfaed Knowledge Based Syst Grp Dresden Germany

Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game's progress.

关键词： answer set programming multi-shot Hamiltonian cycles snakes

来源：评论

学校读者我要写书评

暂无评论

Strategies in Flexible Dispute Derivations for Assumption-based Argumentation 4

Strategies in Flexible Dispute Derivations for Assumption-ba...

引用

4th International Workshop on Systems and Algorithms for Formal Argumentation, SAFA 2022

作者： Diller, Martin Gaggl, Sarah Alice Gorczyca, Piotr Logic Programming and Argumentation Group TU Dresden Germany

We put forward and provide an empirical evaluation of strategies for fully automatic flexible dispute derivations for assumption-based argumentation (ABA). These being a novel dialectical means of judging claims in the context of ABA. Central among our findings is that our naive direct implementation of flexible disputes outperforms the current state-of-the-art system for ABA disputes (acceptance of claims, admissible semantics) especially when allowing forward moves from premisses to claims in addition to backwards from conclusions to premisses. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Constraint logic programming for resolution of relative time expressions

引用

10th Conference on Computability in Europe, CiE 2014

作者： Christiansen, Henning Research Group PLIS: Programming Logic and Intelligent Systems Department of Communication Business and Information Technologies Roskilde University Denmark

ISBN: (纸本)9783319080185

Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced, and it can give meaningful output also when no exact reference time is available. © 2014 Springer International Publishing.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Rushing and Strolling among Answer Sets - Navigation Made Easy 38

Rushing and Strolling among Answer Sets - Navigation Made Ea...

引用

38th International Conference on logic programming, ICLP 2022

作者： Fichte, Johannes Klaus Gaggl, Sarah Alice Rusovac, Dominik Research Unit Database and Artificial Intelligence TU Wien Austria Logic Programming and Argumentation Group TU Dresden Germany

来源：评论

学校读者我要写书评

暂无评论

IASCAR: Incremental Answer Set Counting by Anytime Refinement

arXiv

引用

arXiv 2023年

作者： Fichte, Johannes K. Gaggl, Sarah Alice Hecher, Markus Rusovac, Dominik Sweden TU Dresden Logic Programming and Argumentation Group Germany Massachusetts Institute of Technology United States

Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have many answer sets that cannot be enumerated in practice, but counting still allows quantifying solution spaces. If one counts under assumptions on literals, one obtains a tool to comprehend parts of the solution space, so-called answer set navigation. However, navigating through parts of the solution space requires counting many times, which is expensive in theory. Knowledge compilation compiles instances into representations on which counting works in polynomial time. However, these techniques exist only for CNF formulas, and compiling ASP programs into CNF formulas can introduce an exponential overhead. This paper introduces a technique to iteratively count answer sets under assumptions on knowledge compilations of CNFs that encode supported models. Our anytime technique uses the inclusion-exclusion principle to improve bounds by over- and undercounting systematically. In a preliminary empirical analysis, we demonstrate promising results. After compiling the input (offline phase), our approach quickly (re)counts. Copyright © 2023, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Farewell to Harms: Risk Management for Medical Devices via the Riskman Ontology & Shapes

arXiv

引用

arXiv 2024年

作者： Gorczyca, Piotr Arndt, Dörthe Diller, Martin Kettmann, Pascal Mennicke, Stephan Strass, Hannes Computational Logic Group Institute of Artificial Intelligence Germany Logic Programming and Argumentation Group Institute of Artificial Intelligence Germany Knowledge-Based Systems Group Institute for Theoretical Computer Science Germany Faculty of Computer Science TU Dresden Germany

We introduce the Riskman ontology & shapes for representing and analysing information about risk management for medical devices. Risk management is concerned with taking necessary precautions so a medical device does not cause harms for users or the environment. To date, risk management documentation is submitted to notified bodies (for certification) in the form of semi-structured natural language text. We propose to use classes from the Riskman ontology to logically model risk management documentation, and to use the included SHACL constraints to check for syntactic completeness and conformity to relevant standards. In particular, the ontology is modelled after ISO 14971 and the recently published VDE Spec 90025. Our proposed methodology has the potential to save many person-hours for both manufacturers (when creating risk management documentation) as well as notified bodies (when assessing submitted applications for certification), and thus offers considerable benefits for healthcare and, by extension, society as a whole. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

A Profunctorial Semantics for Quantum Supermaps

arXiv

引用

arXiv 2024年

作者： Hefford, James Wilson, Matt Université Paris-Saclay CNRS ENS Paris-Saclay Inria Laboratoire Méthodes Formelles Gif-sur-Yvette91190 France Programming Principles Logic and Verification Group University College London London United Kingdom

We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of copresheaves on concrete networks. This enables the first construction of abstract logical connectives such as tensor products and negations for supermaps in a totally theory-independent setting. These logical connectives are found to be all that is needed to abstractly model the key structural features of the quantum theory of supermaps: black-box indefinite causal order, black-box definite causal order, and the factorisation of definitely causally ordered supermaps into concrete circuit diagrams. We demonstrate that at the heart of these factorisation theorems lies the Yoneda lemma and the notion of representability. © 2024, CC BY.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Epistemic Multiagent Reasoning with Collaborative Robots 37

Epistemic Multiagent Reasoning with Collaborative Robots

引用

37th Italian Conference on Computational logic, CILC 2022

作者： Soldà, Davide Fabiano, Francesco Dovier, Agostino Constraint and Logic Programming Lab University of Udine Udine33100 Italy Embedding System Unit of Fondazione Bruno Kessler Trento38123 Italy Department of Mathematical Physical and Computer Sciences University of Parma Parma43124 Italy Department of Mathematics Computer Science and Physics University of Udine Udine33100 Italy

Over the last few years, the fields of Artificial Intelligence, Robotics and IoT have gained a lot of attention. This increasing interest has brought, among other things, to the development of autonomous multi-agent systems where robotic entities may interact with each other. As for all the other autonomous settings, also these systems require arbitration. Our work tries to address this problem by presenting a framework that embeds both a classical and a multi-agent epistemic (epistemic, for brevity) planner in a robotic control architecture. The idea is to combine the (i) classical and the (ii) epistemic solvers to model efficiently the interaction with: the (i) physical world and the (ii) information flows, respectively. In particular, the presented architecture starts by planning on the "epistemic level" refining then single-agent world-altering actions thanks to the classical planner. To further optimize the solving process, we also introduce the concept of macros in epistemic planning. Macros, in fact, have been successfully employed in classical planning as they allow for opportune aggregations of actions that may lead to a reduction of plans' length. Finally, the overall framework is exemplified and validated with two Franka Emika manipulators. This allowed us to empirically justify how the combination of the two planning approaches (classical and epistemic), and the introduction of macros, reduce the computational time required by the orchestrating phase. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Towards Unranked Fuzzy Theory 2

Towards Unranked Fuzzy Theory

引用

2nd IEEE International Conference on System Analysis and Intelligent Computing, SAIC 2020

作者： Bishara, Anriette Rukhaia, Mikheil International Black Sea University Faculty of Business and Technologies Tbilisi Georgia Tbilisi State University Laboratory of Applied Logic and Programming Institute of Applied Mathematics Georgia

ISBN: (数字)9781728190839

ISBN: (纸本)9781728190822

One of the main tools in knowledge representation is ontology, which is a collection of logic-based formal language sentences. These sentences are used by automated reasoning programs to extract new knowledge and answer to the given questions. Although ontology languages are standardized by W3C, there are still many problems remaining. One of the most important problems is related to, so called, fuzzy ontologies. These are ontologies, where information is vague and imprecise. Fuzzy ontologies are obtained by integrating fuzzy logic with ontologies. Such kind of ontologies have applications in many different fields, such as medicine, biology, e-commerce and the like. In this paper, we develop an unranked fuzzy logic and study some of its properties. The novelty of our approach is that we will extend many-valued logics with sequence variables and flexiblearity function and predicate symbols. To the best of our knowledge, such formalisms are not yet studied in the literature. The unranked fuzzy language will broaden the knowledge engineering capabilities in different fields. © 2020 IEEE.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：