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

17th European conference on Multi-Agent Systems (EUMAS) / 7th international conference on Agreement Technologies (AT)

作者： Yazdanpanah, Vahid Dastani, Mehdi Fatima, Shaheen Jennings, Nicholas R. Yazan, Devrim M. Zijm, Henk Univ Southampton Southampton England Univ Utrecht Utrecht Netherlands Loughborough Univ Loughborough England Imperial Coll London London England Univ Twente Enschede Netherlands

ISBN: (纸本)9783030664114;9783030664121

In this work, we present a dynamic Task Coordination framework (TasCore) for multiagent systems. Here task coordination refers to a twofold problem where an exogenously imposed state of affairs should be satisfied by a multiagent system. To address this problem the involved agents or agent groups need to be assigned tasks to fulfill (task allocation) and the behavior of these agents needs to be monitored to evaluate whether their tasks are fulfilled so that responsibility for dismissing tasks can be determined (task responsibility). We believe the allocation of tasks should regard both the strategic abilities of agents and their epistemic limitations. To date, however, existing work on the application of logical strategic reasoning for task allocation assumes perfect information for agents (dismissing imperfect information settings) and allocates tasks to individual agents (dismissing task allocation to agent groups). In TasCore, we address this gap by modeling task allocation using imperfect information semantics for strategic reasoning and integrate it with a notion of task responsibility. We formally verify properties of TasCore: on validity as well as stability of task allocations and fairness as well as non-monotonicity of task responsibilities.

关键词： Multiagent systems Task coordination Responsibility and accountability Strategic reasoning Temporal and modal logic

来源：评论

学校读者我要写书评

暂无评论

the Seventh Answer Set programming Competition: Design and Results

arXiv

引用

arXiv 2019年

作者： Gebser, Martin Maratea, Marco Ricca, Francesco Institute for Computer Science University of Potsdam Germany DIBRIS University of Genova Italy Dipartimento di Matematica e Informatica Università della Calabria Italy

Answer Set programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th international conference on logic programming and non-monotonic reasoning (LPNMR 2017). (Under consideration foracceptance in TPLP). Copyright © 2019, the Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Modality Definitions and a theorem Prover for Epistemic Intuitionistic logic 30th

Synthesis of Modality Definitions and a Theorem Prover for E...

引用

30th international conference on logic-Based Program Synthesis and Transformation (LOPSTR)

作者： Tarau, Paul Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9783030684457;9783030684464

We propose a mechanism for automating discovery of definitions, that, when added to a logic system for which we have a theorem prover, extends it to support an embedding of a new logic system into it. As a result, the synthesized definitions, when added to the prover, implement a prover for the new logic. As an instance of the proposed mechanism, we derive a Prolog theorem prover for an interesting but unconventional epistemic logic by starting from the sequent calculus G4IP that we extend with operator definitions to obtain an embedding in intuitionistic propositional logic (IPC). With help of a candidate definition formula generator, we discover epistemic operators for which axioms and theorems of Artemov and Protopopescu's Intuitionistic Epistemic logic (IEL) hold and formulas expected to be non-theorems fail. We compare the embedding of IEL in IPC with a similarly discovered successful embedding of Dosen's double negation modality, judged inadequate as an epistemic operator. Finally, we discuss the failure of the necessitation rule for an otherwise successful S4 embedding and share our thoughts about the intuitions explaining these differences between epistemic and alethic modalities in the context of the Brouwer-Heyting-Kolmogorov semantics of intuitionistic reasoning and knowledge acquisition.

关键词： Automatic synthesis of logic systems Deriving new theorem provers via program synthesis Epistemic intuitionistic logic Propositional intuitionistic logic Prolog-based theorem provers Embedding of modal logics into intuitionistic logic

来源：评论

学校读者我要写书评

暂无评论

ParaLog e: a paraconsistent evidential logic programming language

ParaLog e: a paraconsistent evidential logic programming lan...

引用

Computer Science Society (SCCC) international conference Chilean FLAGGED

作者： B.C. Avila J.M. Abe J.P. de Almeida Prado Department of Informatics Pontifical Catholic University of Parana UEPG IEA Curitiba Parana Brazil Department of Informatics Paulista University Sao Paulo Brazil

Inconsistency is a natural phenomenon arising from the description of the real world. this phenomenon may be encountered in several situations. Nevertheless, human beings are capable of reasoning adequately. the automation of such reasoning requires the development of formal theories. ParaLog (Paraconsistent logic) was proposed by N.C.A. da Costa et al. (1995) to provide tools to reason about inconsistencies. this paper describes an extension of the ParaLog logic programming language, called ParaLog e, that allows direct handling of inconsistency. Languages such as ParaLog e, which are capable of merging classical logic programming concepts with those of inconsistency, widen the scope of logic programming applications in environments presenting conflicting beliefs and contradictory information.

关键词： logic programming Animals Birds Strontium Decision making Cancer programming environments Employment

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Artificial General Intelligence, AGI 2024

17th International Conference on Artificial General Intellig...

引用

17th international conference on Artificial General Intelligence, AGI 2024

ISBN: (纸本)9783031655715

the proceedings contain 25 papers. the special focus in this conference is on Artificial General Intelligence. the topics include: Computational Dualism and Objective Superintelligence;Human-AGI Gemeinschaft as a Solution to the Alignment Problem;towards a Process Algebra and Operator theory for Learning System Objects;autonomous Intelligent Reinforcement Inferred Symbolism;decoding Chess Mastery: A Mechanistic Analysis of a Chess Language Transformer Model;argument-Driven Planning and Autonomous Explanation Generation;Beneficial AGI: Care and Collaboration Are All You Need;from Manifestations to Cognitive Architectures: A Scalable Framework;mirabile Dictu: Language Acquisition in the non-Axiomatic reasoning System;a Collective Intelligence Approach to Safe Artificial General Intelligence;category theory for Artificial General Intelligence;thinking as an Action;a Universal Intelligence Measure for Arithmetical Uncomputable Environments;semantic Primes-Inspired Tacit Knowledge Dataset for Simulating Basic Perception Capabilities of Cognitive Architectures;Simulation of non-Primate Intelligence vs Human Intelligence vs Superhuman AGI vs Alien-Like AGI;causal Generalization via Goal-Driven Analogy;Clipping the Risks: Integrating Consciousness in AGI to Avoid Existential Crises;declarative Rules and Rule-Based Systems;a theory of Foundational Meaning Generation in Autonomous Systems, Natural and Artificial;Causal Inference in NARS;AGI from the Perspectives of Categorical logic and Algebraic Geometry;human-Robot Trust in the Age of Artificial General Intelligence: the Case of Care Robots;From Artificial General Intelligence to Artificial General Universe: Metaverse Ethics as an Amplification of AI/AGI Ethics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

reasoning based on imperfect context data in adaptive security 15

Reasoning based on imperfect context data in adaptive securi...

引用

Proceedings of the 37th international conference on Software Engineering - Volume 2

作者： Sara Sartoli Akbar Siami Namin Texas Tech University Lubbock TX

Enabling software systems to adjust their protection in continuously changing environments with imperfect context information is a grand challenging problem. the issue of uncertain reasoning based on imperfect information has been overlooked in traditional logic programming with classical negation when applied to dynamic systems. this paper sketches a non-monotonic approach based on Answer Set programming to reason with imperfect context data in adaptive security where there is little or no knowledge about certainty of the actions and events.

关键词： non-monotonic logic imperfect data adaptive security

来源：评论

学校读者我要写书评

暂无评论

A program logic for resource verification

引用

17th international conference on theorem Proving in Higher Order logics, TPHOLs 2004

作者： Aspinall, David Beringer, Lennart Hofmann, Martin Loidl, Hans-Wolfgang Momigliano, Alberto Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh EdinburghEH9 3JZ United Kingdom Institut für Informatik Ludwig-Maximilians Universität MünchenD-80538 Germany

ISBN: (纸本)3540230173

We present a program logic for reasoning about resource consumption of programs written in Grail, an abstract fragment of the Java Virtual Machine Language. Serving as the target logic of a certifying compiler, the logic exploits Grail's dual nature of combining a functional interpretation with object-oriented features and a cost model for the JVM. We present the resource-aware operational semantics of Grail, the program logic, and prove soundness and completeness. All of the work described has been formalised in the theorem prover Isabelle/HOL, which provides us with an implementation of the logic as well as confidence in the results. We conclude with examples of using the logic for proving resource bounds on code resulting from compiling high-level functional programs. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Efficient defeasible reasoning systems

Efficient defeasible reasoning systems

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： M.J. Maher A. Rock G. Antoniou D. Billington T. Miller School of Computing & Information Technology Griffith University QLD Australia

For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.

关键词： logic programming Computational complexity Information technology Australia NP-hard problem Electronic commerce Query processing

来源：评论

学校读者我要写书评

暂无评论

Local and symbolic bisimulation using tabled constraint logic programming 17

引用

17th international conference on logic programming, ICLP 2001

作者： Basu, Samik Mukund, Madhavan Ramakrishnan, C.R. Ramakrishnan, I.V. Verma, Rakesh Department of Computer Science State University of New York at Stony Brook Stony BrookNY United States Chennai Mathematical Institute Chennai India Department of Computer Science University of Houston TX United States

ISBN: (纸本)9783540429357

Bisimulation is a fundamental notion that characterizes behavioral equivalence of concurrent systems. In this paper, we study the problem of encoding efficient bisimulation checkers for finite- as well as infinite-state systems as logic programs. We begin with a straightforward and short (less than 10 lines) encoding of finite-state bisimulation checker as a tabled logic program. In a goal-directedsystem like XSB, this encoding yields a local bisimulation checker: one where state space exploration is done only until a dissimilarity is revealed. More importantly, the logic programming formulation of local bisimulation can be extended to do symbolic bisimulation for checking the equivalence of infinite-state concurrent systems represented by symbolic transition systems. We show how the two variants of symbolic bisimulation (late and early equivalences) can be formulated as a tabled constraint logic program in a way that precisely brings out their differences. Finally, we show that our symbolic bisimulation checker actually outperforms non-symbolic checkers even for relatively small finite-state systems. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Forward and backward chaining in constraint programming (INVITED TALK)

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1997年 1265卷 1-1页

作者： Jaffar, Joxan Liu, Bing Yap, Roland H. C. Dept. of Information Systems and Computer Science National University of Singapore 10 Kent Ridge Crescent 119260 Singapore

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：