ICLP Technical Communications最新文献_第2页

Fixpoint Semantics for Recursive SHACL 递归SHACL的定点语义

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.14

B. Bogaerts, Maxim Jakubowski

引用次数: 8

Refining the Semantics of Epistemic Specifications 提炼认知规范的语义

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.25

Ezgi Iraz Su

{"title":"Refining the Semantics of Epistemic Specifications","authors":"Ezgi Iraz Su","doi":"10.4204/EPTCS.345.25","DOIUrl":"https://doi.org/10.4204/EPTCS.345.25","url":null,"abstract":"Answer set programming (ASP) is a problem-solving approach, which has been strongly supported both scientifically and technologically by several solvers, ongoing active research, and implementations in many different fields. However, although researchers acknowledged long ago the necessity of epistemic operators in the language of ASP for better introspective reasoning, this research venue did not attract much attention until recently. Moreover, the existing epistemic extensions of ASP in the literature are not widely approved either, due to the fact that some propose unintended results even for some simple acyclic epistemic programs, new unexpected results may possibly be found, and more importantly, researchers have different reasonings for some critical programs. To that end, Cabalar et al. have recently identified some structural properties of epistemic programs to formally support a possible semantics proposal of such programs and standardise their results. Nonetheless, the soundness of these properties is still under debate, and they are not widely accepted either by the ASP community. Thus, it seems that there is still time to really understand the paradigm, have a mature formalism, and determine the principles providing formal justification of their understandable models. In this paper, we mainly focus on the existing semantics approaches, the criteria that a satisfactory semantics is supposed to satisfy, and the ways to improve them. We also extend some well-known propositions of here-and-there logic (HT) into epistemic HT so as to reveal the real behaviour of programs. Finally, we propose a slightly novel semantics for epistemic ASP, which can be considered as a reflexive extension of Cabalar et al.’s recent formalism called autoepistemic ASP.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125030997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat 在Picat中使用sat编码的可达性约束建模和解决图合成问题

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.30

Neng-Fa Zhou

引用次数: 2

Automata Techniques for Temporal Answer Set Programming 时间答案集编程的自动机技术

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.42

Susana Hahn

引用次数: 0

How to Split a Logic Program 如何分割逻辑程序

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.13

R. Ben-Eliyahu-Zohary

引用次数: 0

DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles 具有障碍物的多智能体寻径问题的分散式和分布式求解器

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.24

Poom Pianpak, Tran Cao Son

{"title":"DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles","authors":"Poom Pianpak, Tran Cao Son","doi":"10.4204/EPTCS.345.24","DOIUrl":"https://doi.org/10.4204/EPTCS.345.24","url":null,"abstract":"Multi-Agent Path Finding (MAPF) is a problem of finding a sequence of movements for agents to reach their assigned location without collision. Centralized algorithms usually give optimal solutions, but have difficulties to scale without employing various techniques - usually with a sacrifice of optimality; but solving MAPF problems with the number of agents greater than a thousand remains a challenge nevertheless. To tackle the scalability issue, we present DMAPF - a decentralized and distributed MAPF solver, which is a continuation of our recently published work, ros-dmapf. We address the issues of ros-dmapf where it (i) only works in maps without obstacles; and (ii) has a low success rate with dense maps. Given a MAPF problem, both ros-dmapf and DMAPF divide the map spatially into subproblems, but the latter further divides each subproblem into disconnected regions called areas. Each subproblem is assigned to a distributed solver, which then individually creates an abstract plan - a sequence of areas that an agent needs to visit - for each agent in it, and interleaves agent migration with movement planning. Answer Set Programming, which is known for its performance in small but complex problems, is used in many parts including problem division, abstract planning, border assignment for the migration, and movement planning. Robot Operating System is used to facilitate communication between the solvers and to enable the opportunity to integrate with robotic systems. DMAPF introduces a new interaction protocol between the solvers, and mechanisms that together result in a higher success rate and better solution quality without sacrificing much of the performance. We implement and experimentally validate DMAPF by comparing it with other state-of-the-art MAPF solvers and the results show that our system achieves better scalability.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115876816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Weighted Conditional EL⊥ Knowledge Bases with Integer Weights: an ASP Approach 整数权的加权条件EL⊥知识库:一种ASP方法

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.19

Laura Giordano, Daniele Theseider Dupr'e

引用次数: 7

Compilation of Aggregates in ASP ASP中聚合的编译

ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.45

G. Mazzotta

引用次数: 0

Generating Concurrent Programs From Sequential Data Structure Knowledge 从顺序数据结构知识生成并发程序

ICLP Technical Communications Pub Date : 2020-11-08 DOI: 10.4204/EPTCS.345.36

S. Varanasi, N. Mittal, G. Gupta

{"title":"Generating Concurrent Programs From Sequential Data Structure Knowledge","authors":"S. Varanasi, N. Mittal, G. Gupta","doi":"10.4204/EPTCS.345.36","DOIUrl":"https://doi.org/10.4204/EPTCS.345.36","url":null,"abstract":"In this paper we tackle the problem of automatically designing concurrent data structure operations given a sequential data structure specification and knowledge about concurrent behavior. Designing concurrent code is a non-trivial task even in simplest of cases. Humans often design concurrent data structure operations by transforming sequential versions into their respective concurrent versions. This requires an understanding of the data structure, its sequential behavior, thread interactions during concurrent execution and shared memory synchronization primitives. We mechanize this design process using automated commonsense reasoning. We assume that the data structure description is provided as axioms alongside the sequential code of its algebraic operations. This information is used to automatically derive concurrent code for that data structure, such as dictionary operations for linked lists and binary search trees. Knowledge in our case is expressed using Answer Set Programming (ASP), and we employ deduction, induction and abduction---just as humans do---in the reasoning involved. ASP allows for succinct modeling of first order theories of pointer data structures, run-time thread interactions and shared memory synchronization. Our reasoner can systematically make the same judgments as a human reasoner while constructing provably safe concurrent code. We present several reasoning challenges involved in transforming the sequential data structure into its equivalent concurrent version. All the reasoning tasks are encoded in ASP and our reasoner can make sound judgments to transform sequential code into concurrent code. To the best of our knowledge, our work is the first one to use commonsense reasoning to automatically transform sequential programs into concurrent code.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information 利用几何信息进行路线规划的约束规划算法

ICLP Technical Communications Pub Date : 2020-09-22 DOI: 10.4204/EPTCS.325.38

A. Bertagnon

{"title":"Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information","authors":"A. Bertagnon","doi":"10.4204/EPTCS.325.38","DOIUrl":"https://doi.org/10.4204/EPTCS.325.38","url":null,"abstract":"Problems affecting the transport of people or goods are plentiful in industry and commerce and they also appear to be at the origin of much more complex problems. In recent years, the logistics and transport sector keeps growing supported by technological progress, i.e. companies to be competitive are resorting to innovative technologies aimed at efficiency and effectiveness. This is why companies are increasingly using technologies such as Artificial Intelligence (AI), Blockchain and Internet of Things (IoT). Artificial intelligence, in particular, is often used to solve optimization problems in order to provide users with the most efficient ways to exploit available resources. In this work we present an overview of our current research activities concerning the development of new algorithms, based on CLP techniques, for route planning problems exploiting the geometric information intrinsically present in many of them or in some of their variants. The research so far has focused in particular on the Euclidean Traveling Salesperson Problem (Euclidean TSP) with the aim to exploit the results obtained also to other problems of the same category, such as the Euclidean Vehicle Routing Problem (Euclidean VRP), in the future.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129296158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0