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

Geometric reasoning on the euclidean traveling salesperson problem in answer set programming

INTELLIGENZA ARTIFICIALE 2024年第1期18卷 139-152页

作者： Bertagnon, Alessandro Gavanelli, Marco Univ Ferrara Dept Environm & Prevent Sci Cso Ercole I DEste 32 Ferrara Italy Univ Ferrara Dept Engn Ferrara Italy

The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. Many instances and real world applications fall into the Euclidean TSP special case, in which each node is identified by its coordinates on the plane and the Euclidean distance is used as cost function. It is worth noting that in the Euclidean TSP more information is available than in the general case;in a previous publication, the use of geometric information has been exploited to speedup TSP solving for Constraint Logic programming (CLP) solvers. In this work, we study the applicability of geometric reasoning to the Euclidean TSP in the context of an ASP computation. We compare experimentally a classical ASP approach to the TSP and the effect of the reasoning based on geometric properties. We also compare the speedup of the additional filtering based on geometric information on an ASP solver and a CLP on Finite Domain (CLP(FD)) solver.

关键词： answer set programming euclidean traveling salesperson problem experimental comparison of ASP and CLP(FD)

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Reconfiguration with answer set programming: Algorithms, Encodings, and Empirical Analysis 1

引用

18th International Conference and Workshops on Algorithms and Computation (WALCOM)

作者： Yamada, Yuya Banbara, Mutsunori Inoue, Katsumi Schaub, Torsten Uehara, Ryuhei Nagoya Univ Nagoya Aichi Japan Natl Inst Informat Tokyo Japan Univ Potsdam Potsdam Germany Japan Adv Inst Sci & Technol Nomi Japan

ISBN: (数字)9789819705665

ISBN: (纸本)9789819705658;9789819705665

We propose an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on answer set programming (ASP). The general task is to study the solution spaces of combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track. In this paper, we present the design and algorithm of bounded combinatorial reconfiguration, and also present ASP encodings of the independent set reconfiguration problem under the token jumping rule that is one of the most studied combinatorial reconfiguration problems. Finally, we present empirical analysis considering all instances of CoRe Challenge 2022.

关键词： Combinatorial Reconfiguration Independent set Reconfiguration answer set programming

来源：评论

学校读者我要写书评

暂无评论

Procedural Level Generation with answer set programming for General Video Game Playing 7

Procedural Level Generation with Answer Set Programming for ...

引用

7th Computer Science and Electronic Engineering Conference (CEEC)

作者： Neufeld, Xenija Mostaghim, Sanaz Perez-Liebana, Diego Univ Magdeburg Inst Knowledge & Language Engn D-39106 Magdeburg Germany Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England

ISBN: (纸本)9781467394819

This paper proposes an automatic way of evolving level generators for arbitrary 2D games, which are described in the Video Game Description Language (VGDL). The process works as follows: a game described in VGDL is interpreted and transformed in a set of rules defined in answer set programming ( ASP), along with other general and customizable rules. Although a set of rules described in ASP can generate multiple levels, not all of them will be playable or well designed. Therefore, an evolutionary process is run to determine the values of the parameters of those customizable rules. The different level generators are evaluated with general video game playing agents, which are able to play any game and level in the framework. The aim is to maximize the difference between their performance in the levels generated, under the assumption that levels are better designed if good skilled players play better than poor agents. This work presents some initial experiments that suggest that it is possible to evolve interesting level generators using this technique, and outlines some lines of future work.

关键词： computer games evolutionary computation logic programming 2D games VGDL Video Game Description Language answer set programming customizable rules evolutionary process general video game playing agents procedural level generation skilled players Avatars Games Generators Portals programming Sprites (computer)

来源：评论

学校读者我要写书评

暂无评论

Reasoning about Trust and Belief in Possibilistic answer set programming 5

Reasoning about Trust and Belief in Possibilistic Answer Set...

引用

5th Brazilian Conference on Intelligent Systems (BRACIS)

作者： Maia, Gabriel Alcantara, Joao Univ Fed Ceara Dept Comp Sci BR-60455760 Fortaleza Ceara Brazil

ISBN: (纸本)9781509035663

The Possibilistic answer set Framework was conceived to deal with not only non monotonic reasoning, but also with uncertainty by associating a certainty level to each piece of knowledge. Here we extend this formalism to a multiagent approach robust enough to manage both the uncertainty about autonomous agents expressed in terms of degrees of trust and the possibilistic uncertainty about their knowledge bases expressed as possibilistic answer set programs. As result, we have a decentralized system able to reason about trust and beliefs in an integrated way. Then we motivate its behavior on an example and highlight how our proposal can be employed to make decisions when the information is distributed, uncertain, potentially contradictory and not necessarily reliable.

关键词： answer set programming Knowledge Representation Possibilistic Reasoning Trust

来源：评论

学校读者我要写书评

暂无评论

Automatic music composition using answer set programming

Automatic music composition using answer set programming

引用

24th International Conference on Logic programming (ICLP)

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

Music composition used to be a pen and paper activity. These days music is often composed with the aid of computer software, even to the point where the computer composes parts of the score autonomously. The composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. This application paper describes the use of answer set programming to construct an automated system, named Anton, that can compose melodic, harmonic and rhythmic music, diagnose errors in human compositions and serve as a computer-aided composition tool. The combination of harmonic, rhythmic and melodic composition in a single framework makes Anton unique in the growing area of algorithmic composition. With near real-time composition, Anton reaches the point where it can not only be used as a component in an interactive composition tool but also has the potential for live performances and concerts or automatically generated background music in a variety of applications. With the use of a fully declarative language and an "off-the-shelf" reasoning engine, Anton provides the human composer a tool which is significantly simpler, more compact and more versatile than other existing systems.

关键词： answer set programming Applications of ASP Music composition Algorithmic composition Harmonic and melodic composition Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Using answer set programming for HPC Dependency Solving

Using Answer Set Programming for HPC Dependency Solving

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (HPC)

作者： Gamblin, Todd Culpo, Massimiliano Becker, Gregory Shudler, Sergei Lawrence Livermore Natl Lab Livermore CA 94550 USA

ISBN: (纸本)9781665454445

Modern scientific software stacks have become extremely complex, using many programming models and libraries to exploit a growing variety of GPUs and accelerators. Package managers can mitigate this complexity using dependency solvers, but they are reaching their limits. Finding compatible dependency versions is NP-complete, and modeling the semantics of package compatibility modulo build-time options, GPU runtimes, flags, and other parameters is extremely difficult. Within this enormous configuration space, defining a "good" configuration is daunting. We tackle this problem using answer set programming (ASP), a declarative model for combinatorial search problems. We show, using the Spack package manager, that ASP programs can concisely express the compatibility rules of HPC software stacks and provide strong quality-of-solution guarantees. Using ASP, we can mix new builds with preinstalled binaries, and solver performance is acceptable even when considering tens of thousands of packages.

关键词： High performance computing Software packages Package management Logic programming answer set programming Software reusability Dependency management

来源：评论

学校读者我要写书评

暂无评论

Fuzzy answer set programming with literal preferences

Fuzzy answer set programming with literal preferences

引用

Joint World Congress of International-Fuzzy-Systems-Association (IFSA)/European Conference of European-Society-for-Fuzzy-Logic-and-Technology (EUSFLAT)

作者： Janssen, Jeroen Schockaert, Steven Vermeir, Dirk De Cock, Martine Vrije Univ Brussel Dept Comp Sci Brussels Belgium Univ Ghent Dept Appl Math & Comp Sci Ghent Belgium Univ Washington Inst Technol Tacoma WA USA

ISBN: (纸本)9789899507968

In the current approaches to fuzzy answer set programming (FASP) one can state preferences amongst rules to denote their relative importance. However, in many situations we need more complex preferences such as those in the answer set optimization framework proposed by Brewka for crisp answer set programming. Unfortunately, these complex preferences do not readily fit into the current FASP approaches. In this paper we propose a language to state such preferences and show that programs with these preferences can be translated into equivalent general fuzzy answer set programming (gFASP) programs. This not only provides an implementation method, but also shows that this extension can be added as syntactic sugar on top of general fuzzy answer set programming solvers.

关键词： Logic programming Fuzzy Logic answer set programming Preference-based Logic programming

来源：评论

学校读者我要写书评

暂无评论

Legal Reasoning in answer set programming 30

Legal Reasoning in Answer Set Programming

引用

30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Aravanis, Theofanis Demiris, Konstantinos Peppas, Pavlos Univ Patras Dept Business Adm Patras Greece

ISBN: (纸本)9781538674499

answer set programming is a declarative problem solving approach, initially tailored to modelling problems in the area of Knowledge Representation and Reasoning. In this article, we provide a knowledge-based system, capable of representing and reasoning about legal knowledge in the context of answer set programming thus, modelling non-monotonicity that is inherent in legal arguments. The work, although limited to a specific indicative domain, namely, university regulations, has a variety of extensions. The overall approach constitutes a representative implementation of the answer set programming's modelling methodology, as well as an enhancing of the bond between Artificial Intelligence and Legal Science, bringing us a step closer to a successful development of an automated legal reasoning system for real-world applications.

关键词： Legal Reasoning answer set programming Knowledge Representation Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Integrating answer set programming and constraint logic programming

Integrating answer set programming and constraint logic prog...

引用

10th International Symposium on Artificial Intelligence and Mathematics

作者： Mellarkod, Veena S. Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79409 USA

We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) programs. The algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.

关键词： Knowledge representation and reasoning answer set programming Constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Recongo: Bounded Combinatorial Reconfiguration with answer set programming 18th

Recongo: Bounded Combinatorial Reconfiguration with Answer S...

引用

18th European Conference on Logics in Artificial Intelligence (JELIA)

作者： Yamada, Yuya Banbara, Mutsunori Inoue, Katsumi Schaub, Torsten Nagoya Univ Furo ChoChikusa Ku Nagoya 4648601 Japan Natl Inst Informat HitotsubashiChiyoda Ku Tokyo 1018430 Japan Univ Potsdam Bahn 2 D-14476 Potsdam Germany

ISBN: (纸本)9783031436185;9783031436192

We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on answer set programming. The general task is to study the solution spaces of source combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track.

关键词： answer set programming Multi-shot ASP solving Combinatorial Reconfiguration Independent set Reconfiguration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：