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

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Bryan Garreau Martin Dieguez Lodeiro Eric Monfroy Igor Stéphan Université d'Angers Angers France

ISBN: (数字)9798331527235

ISBN: (纸本)9798331527242

Constraint answer set programming (CASP) combines answer set programming (ASP) and Constraint programming (CP) to offer a powerful framework for solving complex problems. While there exists various ways to represent CASP problems, fusing both in a way that benefits both communities remains difficult to this day. To address this, we propose to extend the Well Founded Semantics (WFS) to propositional constraint logic programs. To this end, we present an iterative process involving elementary rewriting transformations to simplify the program iteratively. Our method aims to give a better description of the interactions between ASP and CP inside of a constraint logic program.

关键词： Constraint handling Semantics answer set programming Logic Iterative methods Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Synthesis of CNOT minimal quantum circuits with topological constraints through ASP

Synthesis of CNOT minimal quantum circuits with topological ...

引用

2023 International Workshop on AI for Quantum and Quantum for AI, AIQxQIA 2023

作者： Piazza, Carla Romanello, Riccardo Dipartimento di Scienze Matematiche Informatiche e Fisiche Università degli Studi di Udine Italy

Although with some yet severe limitations, Physical working Quantum Computers are becoming available for end users. Such devices are based on the rules of Quantum Mechanics, which state that physical systems evolve through unitary transformations. However, as in the classical case, in order to have a model of computation, such unitary evolutions are expressed/approximated inside Quantum Computers in terms of a finite set of one/two qubit operations (i.e., through a universal set of gates). Single qubit gates are fault-tolerant, while the same cannot be said for two qubit gates. Hence, unitary matrices adopted in Quantum Algorithms must be synthesized in terms of this universal set of operations to obtain a quantum circuit. In such synthesis procedure we prefer circuits with minimum number of qubits and with minimum circuit depth. Clifford+T universal set is one of the most adopted in the literature for synthesis. In such set we have 3 single qubit gates and the CNOT, which is a two qubit gate. Many efforts have been directed to devise algorithms that synthesize general unitary matrices into Clifford+T circuits. These algorithms usually tend to optimize circuit depth or eventually the number of T gates. Since two qubit gates are not fault tolerant, in this work we propose an ASP based technique to minimize the number of CNOT gates inside a Clifford+T circuit. Moreover, in real world quantum computers, qubit are usually connected to each other according to some particular topology, thus providing further constraints. Two qubit gates —hence, CNOT gate— can be directly applied only to pair of gates that are connected. Such constraint has to be taken into account during the synthesis of CNOT minimal circuits. We propose an ASP model to solve the problem of synthesizing CNOT minimal circuits under topological constraints. We provide experimental evidence of the scalability of our proposal. © 2023 Copyright for this paper by its authors. Use permitted under Creative Common

关键词： answer set programming Clifford+T Synthesis CNOT Minimization Quantum Circuit Synthesis Topological Constraint

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Pick and Delivery with Capacities: Action Planning Vs Path Finding 24th

Multi-agent Pick and Delivery with Capacities: Action Plan...

引用

24th International Conference on Practical Aspects of Declarative Languages, PADL 2022

作者： Tajelipirbazari, Nima Yildirimoglu, Cagri Uluc Sabuncu, Orkunt Arici, Ali Can Ozen, Idil Helin Patoglu, Volkan Erdem, Esra Department of Computer Engineering TED University Ankara Turkey Faculty of Engineering and Natural Sciences Sabanci University Istanbul Turkey Ekol Logistics Istanbul Turkey

ISBN: (纸本)9783030944780

Motivated by autonomous warehouse applications in the real world, we study a variant of Multi-Agent Path Finding (MAPF) problem where robots also need to pick and deliver some items on their way to their destination. We call this variant the Multi-Agent Pick and Delivery with Capacities (MAPDC) problem. In addition to the challenges of MAPF (i.e., finding collision-free plans for each robot from an initial location to a destination while minimizing the maximum makespan), MAPDC asks also for the allocation of the pick and deliver tasks among robots while taking into account their capacities (i.e., the maximum number of items one robot can carry at a time). We study this problem with two different approaches, action planning vs path finding, using answer set programming with two different computation modes, single-shot vs multi-shot. © 2022, Springer Nature Switzerland AG.

关键词： Action planning answer set programming Multi-agent path finding Pick and delivery with capacities

来源：评论

学校读者我要写书评

暂无评论

Temporal ASP: From Logical Foundations to Practical Use with telingo 17th

Temporal ASP: From Logical Foundations to Practical Use with...

引用

17th Reasoning Web International Summer School, Reasoning Web 2021

作者： Cabalar, Pedro University of Corunna A Coruña Spain

ISBN: (纸本)9783030954802

This document contains some lecture notes for a seminar on Temporal Equilibrium Logic (TEL) and its application to answer set programming (ASP) inside the 17th Reasoning Web Summer School (RW 2021). TEL is a temporal extension of ASP that introduces temporal modal operators as those from Linear-Time Temporal Logic. We present the basic definitions and intuitions for Equilibrium Logic and then extend these notions to the temporal case. We also introduce several examples using the temporal ASP tool telingo. © 2022, Springer Nature Switzerland AG.

关键词： answer set programming Equilibrium Logic Linear Temporal Logic Temporal Equilibrium Logic

来源：评论

学校读者我要写书评

暂无评论

Inductive definitions in constraint programming 13

Inductive definitions in constraint programming

引用

Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135

作者： Rehan Abdul Aziz Peter J. Stuckey Zoltan Somogyi The University of Melbourne and National ICT Australia (NICTA)

ISBN: (纸本)9781921770203

Constraint programming (CP) and answer set programming (ASP) are two declarative paradigms used to solve combinatorial problems. Many modern solvers for both these paradigms rely on partial or complete Boolean representations of the problem to exploit the extremely efficient techniques that have been developed for solving propositional satisfiability problems. This convergence on a common representation makes it possible to incorporate useful features of CP into ASP and vice versa. There has been significant effort in recent years to integrate CP into ASP, primarily to overcome the grounding bottleneck in traditional ASP solvers that exists due to their inability to handle integer variables efficiently. On the other hand, ASP solvers are more efficient than CP systems on problems that involve inductive definitions, such as reachability in a graph. Besides efficiency, ASP syntax is more natural and closer to the mathematical definitions of such concepts. In this paper, we describe an approach that adds support for answer set rules to a CP system, namely the lazy clause generation solver chuffed. This integration also naturally avoids the grounding bottleneck of ASP since constraint solvers natively support finite domain variables. We demonstrate the usefulness of our approach by comparing our new system against two competitors: the state-of-the-art ASP solver clasp, and clingcon, a system that extends clasp with CP capabilities.

关键词： answer set programming stable model semantics inductive definitions constraint programming

来源：评论

学校读者我要写书评

暂无评论

Mining and modelling interaction networks for systems biology

Mining and modelling interaction networks for systems biolog...

引用

作者： Fayruzov, Timur Ghent University

学位级别：master

The advances in biological research in the last two decades have provided many new insights on the functioning principles of living organisms. This resulted in the proposal of new methods to study the development of living organisms. One of the most significant advances is the development of microarrays and of high-throughput techniques that allow a biologist to collect a massive amount of experimental information about a particular biological process, which can be used for different purposes such as explanation of a living organism behaviour or drug design. The development of new experimental methods and rapid growth of biolog- ical data repositories have contributed to building biological network models that are aimed at reconstructing real biological processes in silico. On the other hand, advances in experimental techniques have led to a rapid increase of re- ports that describe new biological discoveries. Clearly, processing large amounts of information calls for automated methods that (partially) remove the burden of manual data processing from the shoulders of biologists. These two aspects of effective biological data utilization, namely automated text processing for information extraction and constructing and analyzing bio- logical network models, have attracted a lot of attention in computer science. In this thesis we have presented our contributions to these problems by studying both information extraction and modelling aspects. In the first part of the thesis, that comprises Chapters 2 and 3, we have dis- cussed the problem of information extraction from biological article abstracts, and in particular the problem of protein-protein interaction extraction. In Chap- ter 2 we have introduced the basic notions necessary to perform the interaction extraction task; we have discussed the natural language processing techniques and the machine learning setting for this task. Further, we have described the annotated corpora used for machine learning training and ev

关键词： Technology and Engineering Computer Science Bioinformatics Modelling Regulatory Networks Machine Learning answer set programming Text Mining

来源：评论

学校读者我要写书评

暂无评论

On updates of logic programs:: A properties-based approach

On updates of logic programs:: A properties-based approach

引用

3rd International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2004)

作者： Osorio, M Zacarías, F Univ Americas Puebla CENTIA Cholula 72820 Mexico

ISBN: (纸本)3540209654

We have studied the update operator circle plus defined in [4] without tautologies and we have observed that satisfies an interesting property. This property is similar to one postulate proposed by AGM but, in this case for nonmonotonic logic and that we called WIS. Also, we consider other five additional basic properties about update programs and we show that circle plus satisfies them. So, this work continues the analysis about the AGM postulates with respect to operator circle plus under the refinated view that includes knowledge and beliefs that we began in a recent previous paper and that satisfies the WIS property for closed programs under tautologies.

关键词： answer set programming Nelson logic update programs strong negation AGM postulates properties

来源：评论

学校读者我要写书评

暂无评论

Using Metaprogramming Techniques to Enhance Eclingo Performance Through the Reification Format

Using Metaprogramming Techniques to Enhance Eclingo Performa...

引用

作者： Lillo Portero, Eleuterio Juan University of Nebraska at Omaha

学位级别：M.S., Master of Science/Master of Surgery

answer set programming is an automated reasoning technology that has become a prime candidate for solving knowledge-intense search and optimization problems. One of the main reasons of its success is the availability of highly effective solvers that can go toe-to-toe with Satisfiability Solvers while dealing with a high-level human understandable language. Epistemic logic programs are an extension of answer set programming with subjective literals that allow to succinctly represent several problems that cannot be represented using the standard language of answer set programming. eclingo is a solver developed to solve problems described in the language of Epistemic Logic Programs. This research aims to enhance the efficiency of such solver. The focus of the research will be aimed at the use of the metaprogramming capabilities of answer set programming solver clingo. This will allow us to enhance the solver with new inference rules expressed in the answer set programming language. This will reduce the search space and, in principle, improve solver performance.

关键词： answer set programming Complexity Epistemic logic Logic programming Optimization Satisfiability

来源：评论

学校读者我要写书评

暂无评论

Logic programming and Interactive Applications

引用

ORGANON F 2013年第SUPPL.2期20卷 187-205页

作者： Simko, Alexander Siska, Jozef Comenius Univ Dept Appl Informat Fac Math Phys & Informat Bratislava 84248 Slovakia

answer set programming (ASP) is a logic programming based, truly declarative formalism for general purpose problem solving. Its declarative nature allows users to solve problems by defining what the solutions are instead of how to find them. Complete lack of an imperative component in ASP makes creation of end user applications or integration with other systems demanding. External tools that can process and interpret the output of ASP solvers are needed. To address this issue in the case of simple applications with an input - output interaction loop we introduce a framework for iterative logic applications. Such applications consist of a core logic program that is used to evaluate user actions w.r.t. their current state and to derive a new state of the application. We take care to define the framework in a way that allows it to be used also with other formalism, especially SAT solvers. We also present a web based implementation of such framework for ASP.

关键词： answer set programming Declarative Problem Solving Interactive Applications Logic programming

来源：评论

学校读者我要写书评

暂无评论

Paracoherent answer set computation

引用

ARTIFICIAL INTELLIGENCE 2021年 299卷 103519-103519页

作者： Amendola, Giovanni Dodaro, Carmine Faber, Wolfgang Ricca, Francesco Univ Calabria Dept Math & Comp Sci Calabria Italy Univ Genoa Dept Informat Bioengn Robot & Syst Engn Genoa Italy Alpen Adria Univ Klagenfurt Dept Appl Informat Klagenfurt Austria Univ Huddersfield Sch Comp & Engn Huddersfield W Yorkshire England

answer set programming (ASP) is a well-established paradigm for declarative programming and nonmonotonic reasoning. ASP allows for flexible modeling using rules. ASP rules induce a set of intended models called answer sets. Incoherence, the non-existence of answer sets, is therefore a feature of ASP, indicating that the rules admit no intended models. However, this feature can also be problematic in certain circumstances: errors that cause incoherence are notoriously difficult to debug, and query answering will not provide any meaningful answers for incoherent programs. Paracoherent semantics have been suggested as a remedy. They extend the classical notion of answer sets to draw meaningful conclusions also from incoherent programs. However, paracoherent semantics have essentially been inapplicable in practice, due to the lack of efficient algorithms and implementations. In this paper, this lack is addressed, and several different algorithms to compute semi-stable and semi-equilibrium models are proposed and implemented within an answer set solving framework. A key role in the framework is played by syntactic program transformations that allow for characterizing paracoherent semantics in terms of the answer sets of transformed programs. Apart from existing transformations from the literature, a novel transformation is also proposed, which provides an alternative characterization of paracoherent semantics in terms of (extended) externally supported models. Notably, the new transformation is more compact than the existing ones, and brings performance benefits. An extensive empirical performance comparison among the algorithms on benchmarks from ASP competitions and a real-world use case is given as well. It shows not only that the methods developed in this paper lead to practically effective systems, but also show a clear advantage of the methods that rely on (extended) externally supported models. (C) 2021 Elsevier B.V. All rights reserved.

关键词： answer set programming Paracoherent reasoning Semi-equilibrium models Semi-stable models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：