Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning最新文献_第2页

Defining Defense and Defeat in Abstract Argumentation From Scratch - A Generalizing Approach 在抽象论证中从零开始定义辩护和失败——一种一般化的方法

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/7

Lydia Blümel, Markus Ulbricht

引用次数: 2

The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion 越坏越好:信念融合的广义孔多塞陪审团定理

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/21

J. Karge, S. Rudolph

{"title":"The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion","authors":"J. Karge, S. Rudolph","doi":"10.24963/kr.2022/21","DOIUrl":"https://doi.org/10.24963/kr.2022/21","url":null,"abstract":"In multi-agent belief fusion, there is increasing interest in results and methods from social choice theory.\u0000As a theoretical cornerstone, the Condorcet Jury Theorem (CJT) states that given a number of equally competent, independent agents where each is more likely to guess the true out of two alternatives, the chances of determining this objective truth by majority voting increase with the number of participating agents, approaching certainty. Past generalizations of the CJT have shown that some of its underlying assumptions can be weakened. Motivated by requirements from practical belief fusion scenarios, we provide a significant further generalization that subsumes several of the previous ones. Our considered setting simultaneously allows for heterogeneous competence levels across the agents (even tolerating entirely incompetent or even malicious voters), and voting for any number of alternatives from a finite set. We derive practical lower bounds for the numbers of agents needed to give probabilistic guarantees for determining the true state through approval voting. We also demonstrate that the non-asymptotic part of the CJT fails in our setting for arbitrarily high numbers of voters.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127626468","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

Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO 从不透明机器学习预测器中提取符号知识:GridREx & PEDRO

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/57

Federico Sabbatini, Roberta Calegari

{"title":"Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO","authors":"Federico Sabbatini, Roberta Calegari","doi":"10.24963/kr.2022/57","DOIUrl":"https://doi.org/10.24963/kr.2022/57","url":null,"abstract":"Procedures aimed at explaining outcomes and behaviour of opaque predictors are becoming more and more essential as machine learning (ML) black-box (BB) models pervade a wide variety of fields and, in particular, critical ones - e.g., medical or financial -, where it is not possible to make decisions on the basis of a blind automatic prediction. A growing number of methods designed to overcome this BB limitation is present in the literature, however some ML tasks are nearly or completely neglected-e.g., regression and clustering. Furthermore, existing techniques may be not applicable in complex real-world scenarios or they can affect the output predictions with undesired artefacts.\u0000\u0000In this paper we present the design and the implementation of GridREx, a pedagogical algorithm to extract knowledge from black-box regressors, along with PEDRO, an optimisation procedure to automate the GridREx hyper-parameter tuning phase with better results than manual tuning. We also report the results of our experiments involving the application of GridREx and PEDRO in real case scenarios, including GridREx performance assessment by using as benchmarks other similar state-of-the-art techniques. GridREx proved to be able to give more concise explanations with higher fidelity and predictive capabilities.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123048099","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}

引用次数: 5

Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing 在不确定性行为和可错感存在下的信念投射

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/40

Jens Claßen, J. Delgrande

引用次数: 0

Open Relation Extraction with Non-existent and Multi-span Relationships 不存在关系和多跨关系的开放关系提取

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/37

Huifan Yang, Da-Wei Li, Zekun Li, Donglin Yang, Bin Wu

{"title":"Open Relation Extraction with Non-existent and Multi-span Relationships","authors":"Huifan Yang, Da-Wei Li, Zekun Li, Donglin Yang, Bin Wu","doi":"10.24963/kr.2022/37","DOIUrl":"https://doi.org/10.24963/kr.2022/37","url":null,"abstract":"Open relation extraction (ORE) aims to assign semantic relationships among arguments, essential to the automatic construction of knowledge graphs (KG). The previous ORE methods and some benchmark datasets consider a relation between two arguments as definitely existing and in a simple single-span form, neglecting possible non-existent relationships and flexible, expressive multi-span relations. However, detecting non-existent relations is necessary for a pipelined information extraction system (first performing named entity recognition then relation extraction), and multi-span relationships contribute to the diversity of connections in KGs. To fulfill the practical demands of ORE, we design a novel Query-based Multi-head Open Relation Extractor (QuORE) to extract single/multi-span relations and detect non-existent relationships effectively. Moreover, we re-construct some public datasets covering English and Chinese to derive augmented and multi-span relation tuples. Extensive experiment results show that our method outperforms the state-of-the-art ORE model LOREM in the extraction of existing single/multi-span relations and the overall performances on four datasets with non-existent relationships.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545142","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

Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems 多智能体系统中基于enthymeme的通信框架

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/27

Alison R. Panisson, P. McBurney, Rafael Heitor Bordini

{"title":"Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems","authors":"Alison R. Panisson, P. McBurney, Rafael Heitor Bordini","doi":"10.24963/kr.2022/27","DOIUrl":"https://doi.org/10.24963/kr.2022/27","url":null,"abstract":"Communication is one of the most important aspects of multi-agent systems. Among the different communication techniques applied to multi-agent systems, argumentation-based approaches have received special interest from the community, because allowing agents to exchange arguments provides a rich form of communication. In contrast to the benefits that argumentation-based techniques provide to multi-agent communication, extra weight on the communication infrastructure results from the additional information exchanged by agents, which could restrict the practical use of such techniques. In this work, we propose an argumentation framework whereby agents are able to exchange shorter messages when engaging in dialogues by omitting information that is common knowledge (e.g., information about a shared multi-agent organisation). In particular, we focus on using enthymemes, shared argumentation schemes (i.e., reasoning patterns from which arguments are instantiated), and common organisational knowledge to build an enthymeme-based communication framework. We show that our approach addresses some of Grice's maxims, in particular that agents can be brief in communication, without any loss in the content of the intended arguments.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132212630","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

A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation 概率逻辑程序与概率论证的可信最小未定义稳定语义

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/31

Victor Hugo Nascimento Rocha, Fabio Gagliardi Cozman

引用次数: 7

Sticky Policies in OWL2: Extending PL with Fixpoints and Transitive Closure OWL2中的粘接策略:用固定点和传递闭包扩展PL

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/8

P. Bonatti, L. Sauro

引用次数: 0

Stream Reasoning with Cycles 循环流推理

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/56

Periklis Mantenoglou, Manolis Pitsikalis, A. Artikis

引用次数: 2

Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism ASPIC+论证形式中最弱链接原则下稳定结论的计算

Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/22

Tuomo Lehtonen, J. Wallner, M. Järvisalo

引用次数: 1