发布求助
文献互助 智能选刊 最新文献

ICLP Technical Communications最新文献

筛选
英文 中文
Comprehensive Multi-Agent Epistemic Planning 综合多智能体认知规划
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.41
F. Fabiano
{"title":"Comprehensive Multi-Agent Epistemic Planning","authors":"F. Fabiano","doi":"10.4204/EPTCS.345.41","DOIUrl":"https://doi.org/10.4204/EPTCS.345.41","url":null,"abstract":"Over the last few years, the concept of Artificial Intelligence has become central in different tasks concerning both our daily life and several working scenarios. Among these tasks automated planning has always been central in the AI research community. In particular, this manuscript is focused on a specialized kind of planning known as Multi-agent Epistemic Planning (MEP). Epistemic Planning (EP) refers to an automated planning setting where the agent reasons in the space of knowledge/beliefs states and tries to find a plan to reach a desirable state from a starting one. Its general form, the MEP problem, involves multiple agents who need to reason about both the state of the world and the information flows between agents. To tackle the MEP problem several tools have been developed and, while the diversity of approaches has led to a deeper understanding of the problem space, each proposed tool lacks some abilities and does not allow for a comprehensive investigation of the information flows. That is why, the objective of our work is to formalize an environment where a complete characterization of the agents’ knowledge/beliefs interaction and update is possible. In particular, we aim to achieve such goal by defining a new action-based language for multi-agent epistemic planning and to implement an epistemic planner based on it. This solver should provide a tool flexible enough to reason on different domains, e.g., economy, security, justice and politics, where considering others’ knowledge/beliefs could lead to winning strategies.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"1 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":"130111667","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
Quantitative and Stream Extensions of Answer Set Programming 答案集规划的定量和流扩展
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.43
Rafael Kiesel
{"title":"Quantitative and Stream Extensions of Answer Set Programming","authors":"Rafael Kiesel","doi":"10.4204/EPTCS.345.43","DOIUrl":"https://doi.org/10.4204/EPTCS.345.43","url":null,"abstract":"While propositional Answer Set Programming (ASP) is already NP-hard and therefore powerful enough to express many challenging problems, their specification can be tedious and complicated. Further, there are relevant problems that require higher expressivity or reasoning over data that changes with time. This and the practical usage of ASP gave rise to a need for a simpler, more expressive, and more concise specification language [1, 11]. Thus, ASP was extended in multiple directions. We focus on the following ones: 1. Time Domain (TD): In [5] ASP-semantics were combined with a temporal context resulting in the Logic-based framework for Analytic Reasoning over Streams (LARS). Here, interpretations assign possibly different sets of facts to time points. Accordingly, the input language was extended with operators like ♦, corresponding to existential quantification over time points. Another temporal extension of ASP is Temporal Equilibrium Logic (TEL) [9]. 2. Quantitative Reasoning over Models (QM): Given a program we may not only be interested in its answer sets but also in reasoning with quantities associated with them. Commonly this includes:","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"113 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":"124772042","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
APIA: An Architecture for Policy-Aware Intentional Agents APIA:策略感知的意向代理的体系结构
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.23
John Meyer, Daniela Inclezan
{"title":"APIA: An Architecture for Policy-Aware Intentional Agents","authors":"John Meyer, Daniela Inclezan","doi":"10.4204/EPTCS.345.23","DOIUrl":"https://doi.org/10.4204/EPTCS.345.23","url":null,"abstract":"This paper introduces the APIA architecture for policy-aware intentional agents. These agents, acting in changing environments, are driven by intentions and yet abide by domain-relevant policies. This work leverages the AIA architecture for intention-driven intelligent agents by Blount, Gelfond, and Balduccini. It expands AIA with notions of policy compliance for authorization and obligation policies specified in the language AOPL by Gelfond and Lobo. APIA introduces various agent behavior modes, corresponding to different levels of adherence to policies. APIA reasoning tasks are reduced to computing answer sets using the Clingo solver and its Python API.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"127 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":"130330975","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}
引用次数: 2
A Logic-based Multi-agent System for Ethical Monitoring and Evaluation of Dialogues 基于逻辑的多智能体对话伦理监控与评价系统
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.32
Abeer Dyoub, S. Costantini, Ivan Letteri, F. Lisi
{"title":"A Logic-based Multi-agent System for Ethical Monitoring and Evaluation of Dialogues","authors":"Abeer Dyoub, S. Costantini, Ivan Letteri, F. Lisi","doi":"10.4204/EPTCS.345.32","DOIUrl":"https://doi.org/10.4204/EPTCS.345.32","url":null,"abstract":"Dialogue Systems are tools designed for various practical purposes concerning human-machine interaction. These systems should be built on ethical foundations because their behavior may heavily influence a user (think especially about children). The primary objective of this paper is to present the architecture and prototype implementation of a Multi Agent System (MAS) designed for ethical monitoring and evaluation of a dialogue system. A prototype application, for monitoring and evaluation of chatting agents' (human/artificial) ethical behavior in an online customer service chat point w.r.t their institution/company's codes of ethics and conduct, is developed and presented. Future work and open issues with this research are discussed.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"49 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":"128433145","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}
引用次数: 6
Product Configuration in Answer Set Programming 答案集编程中的产品配置
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.46
Seemran Mishra
{"title":"Product Configuration in Answer Set Programming","authors":"Seemran Mishra","doi":"10.4204/EPTCS.345.46","DOIUrl":"https://doi.org/10.4204/EPTCS.345.46","url":null,"abstract":"This is a preliminary work on configuration knowledge representation which serves as a foundation for building interactive configuration systems in Answer Set programming (ASP). The major concepts of the product configuration problem are identified and discussed with a bike configuration example. A fact format is developed for expressing product knowledge that is domain-specific and can be mapped from other systems. Finally, a domain-independent ASP encoding is provided that represents the concepts in the configuration problem.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"15 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":"115476693","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}
引用次数: 1
Geolog: Scalable Logic Programming on Spatial Data 地质学:空间数据的可扩展逻辑编程
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.34
Tobias Grubenmann, Jens Lehmann
{"title":"Geolog: Scalable Logic Programming on Spatial Data","authors":"Tobias Grubenmann, Jens Lehmann","doi":"10.4204/EPTCS.345.34","DOIUrl":"https://doi.org/10.4204/EPTCS.345.34","url":null,"abstract":"Spatial data is ubiquitous in our data-driven society. The Logic Programming community has been investigating the use of spatial data in different settings. Despite the success of this research, the Geographic Information System (GIS) community has rarely made use of these new approaches. This has mainly two reasons. First, there is a lack of tools that tightly integrate logical reasoning into state-of-the-art GIS software. Second, the scalability of solutions has often not been tested and hence, some solutions might work on toy examples but do not scale well to real-world settings. The two main contributions of this paper are (1) the Relation Based Programming paradigm, expressing rules on relations instead of individual entities, and (2) Geolog, a tool for spatio-logical reasoning that can be installed on top of ArcMap, which is an industry standard GIS. We evaluate our new Relation Based Programming paradigm in four real-world scenarios and show that up to two orders of magnitude in performance gain can be achieved compared to the prevalent Entity Based Programming paradigm.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"17 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":"115223517","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
Natlog: a Lightweight Logic Programming Language with a Neuro-symbolic Touch Natlog:具有神经符号触摸的轻量级逻辑编程语言
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.27
Paul Tarau
{"title":"Natlog: a Lightweight Logic Programming Language with a Neuro-symbolic Touch","authors":"Paul Tarau","doi":"10.4204/EPTCS.345.27","DOIUrl":"https://doi.org/10.4204/EPTCS.345.27","url":null,"abstract":"We introduce Natlog, a lightweight Logic Programming language, sharing Prolog's unification-driven execution model, but with a simplified syntax and semantics. Our proof-of-concept Natlog implementation is tightly embedded in the Python-based deep-learning ecosystem with focus on content-driven indexing of ground term datasets. As an overriding of our symbolic indexing algorithm, the same function can be delegated to a neural network, serving ground facts to Natlog's resolution engine. Our open-source implementation is available as a Python package at https://pypi.org/project/natlog/ .","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"28 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":"123589484","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}
引用次数: 7
Generating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programming 用答案集规划从树-集成学习方法生成可解释规则集
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.26
A. Takemura, Katsumi Inoue
{"title":"Generating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programming","authors":"A. Takemura, Katsumi Inoue","doi":"10.4204/EPTCS.345.26","DOIUrl":"https://doi.org/10.4204/EPTCS.345.26","url":null,"abstract":"We propose a method for generating explainable rule sets from tree-ensemble learners using Answer Set Programming (ASP). To this end, we adopt a decompositional approach where the split structures of the base decision trees are exploited in the construction of rules, which in turn are assessed using pattern mining methods encoded in ASP to extract interesting rules. We show how user-defined constraints and preferences can be represented declaratively in ASP to allow for transparent and flexible rule set generation, and how rules can be used as explanations to help the user better understand the models. Experimental evaluation with real-world datasets and popular tree-ensemble algorithms demonstrates that our approach is applicable to a wide range of classification tasks.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"45 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":"121637681","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}
引用次数: 6
Flexible and Explainable Solutions for Multi-Agent Path Finding Problems 多智能体寻径问题的灵活且可解释的解决方案
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.40
Aysu Bogatarkan
{"title":"Flexible and Explainable Solutions for Multi-Agent Path Finding Problems","authors":"Aysu Bogatarkan","doi":"10.4204/EPTCS.345.40","DOIUrl":"https://doi.org/10.4204/EPTCS.345.40","url":null,"abstract":"The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. The real-world applications of MAPF require flexibility (e.g., solving variations of MAPF) as well as explainability. In this study, both of these challenges are addressed and some flexible and explainable solutions for MAPF and its variants are introduced.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"49 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":"124711580","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}
引用次数: 1
DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational Socialbots DiscASP:一个基于图形的ASP系统，用于查找会话社交机器人应用程序的相关一致概念
ICLP Technical Communications Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.345.35
Fang Li, Huaduo Wang, Kinjal Basu, Elmer Salazar, G. Gupta
{"title":"DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational Socialbots","authors":"Fang Li, Huaduo Wang, Kinjal Basu, Elmer Salazar, G. Gupta","doi":"10.4204/EPTCS.345.35","DOIUrl":"https://doi.org/10.4204/EPTCS.345.35","url":null,"abstract":"We consider the problem of finding relevant consistent concepts in a conversational AI system, particularly, for realizing a conversational socialbot. Commonsense knowledge about various topics can be represented as an answer set program. However, to advance the conversation, we need to solve the problem of finding relevant consistent concepts, i.e., find consistent knowledge in the\"neighborhood\"of the current topic being discussed that can be used to advance the conversation. Traditional ASP solvers will generate the whole answer set which is stripped of all the associations between the various atoms (concepts) and thus cannot be used to find relevant consistent concepts. Similarly, goal-directed implementations of ASP will only find concepts directly relevant to a query. We present the DiscASP system that will find the partial consistent model that is relevant to a given topic in a manner similar to how a human will find it. DiscASP is based on a novel graph-based algorithm for finding stable models of an answer set program. We present the DiscASP algorithm, its implementation, and its application to developing a conversational socialbot.","PeriodicalId":262534,"journal":{"name":"ICLP Technical Communications","volume":"32 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":"130838696","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}
引用次数: 6
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信