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

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

筛选
英文 中文
Learning Typed Rules over Knowledge Graphs 在知识图上学习类型化规则
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/51
Honglin Wu, Zhe Wang, Kewen Wang, Yishu Shen
{"title":"Learning Typed Rules over Knowledge Graphs","authors":"Honglin Wu, Zhe Wang, Kewen Wang, Yishu Shen","doi":"10.24963/kr.2022/51","DOIUrl":"https://doi.org/10.24963/kr.2022/51","url":null,"abstract":"Rule learning from large datasets has regained extensive interest as rules are useful for developing explainable approaches to many applications in knowledge graphs. However, existing methods for rule learning are still limited in terms of scalability and rule quality. This paper presents a new method for learning typed rules by employing entity class information. Our experimental evaluation shows the superiority of our system compared to state-of-the-art rule learners. In particular, we demonstrate the usefulness of typed rules in reasoning for link prediction.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"34 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":"132275893","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
On Syntactic Forgetting with Strong Persistence 论强持续性句法遗忘
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/5
M. Berthold
{"title":"On Syntactic Forgetting with Strong Persistence","authors":"M. Berthold","doi":"10.24963/kr.2022/5","DOIUrl":"https://doi.org/10.24963/kr.2022/5","url":null,"abstract":"It is generally agreed upon that so-called strong persistence (SP) captures best the essence of forgetting in logic programming. While classes of operators, such as F_R and F_SP, that satisfy immediate relaxations of (SP), and in the case of F_SP, even (SP) whenever possible, have been characterized semantically, many practical questions have yet to be addressed.\u0000This technical paper aims to answer one of them: How can atoms be forgotten from a program without having to calculate its exponential number of models? To this end, we introduce two concrete representatives of F_R and F_SP that forget sets of atoms by syntactical manipulation of a program’s rules. This may in many cases prevent exponential blowups and produce a forgetting result that is close to the original program.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"23 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":"126628798","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
The Topology of Surprise 惊喜的拓扑结构
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/4
A. Baltag, N. Bezhanishvili, D. Fernández-Duque
{"title":"The Topology of Surprise","authors":"A. Baltag, N. Bezhanishvili, D. Fernández-Duque","doi":"10.24963/kr.2022/4","DOIUrl":"https://doi.org/10.24963/kr.2022/4","url":null,"abstract":"In this paper we present a topological epistemic logic, with modalities for knowledge (modeled as the universal modality), knowability (represented by the topological interior operator), and unknowability of the actual world. The last notion has a non-self-referential reading (modeled by Cantor derivative: the set of limit points of a given set) and a self-referential one (modeled by Cantor's perfect core of a given set: its largest subset without isolated points). We completely axiomatize this logic, showing that it is decidable and PSPACE-complete, and we apply it to the analysis of a famous epistemic puzzle: the Surprise Exam Paradox.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"58 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":"114042790","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
Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models 认知行为:多智能体信念基础与行为模型的比较
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/24
E. Lorini, Elise Perrotin, François Schwarzentruber
{"title":"Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models","authors":"E. Lorini, Elise Perrotin, François Schwarzentruber","doi":"10.24963/kr.2022/24","DOIUrl":"https://doi.org/10.24963/kr.2022/24","url":null,"abstract":"We compare the syntactic multi-agent belief base approach, and the dynamic epistemic logic possible world semantic approach. In the belief base approach, the language provides an implicit and an explicit belief operators, plus a dynamic modality for actions consisting in adding formulae to bases. For the semantic approach, we rely on action models of Dynamic Epistemic Logic (DEL). We first show how to translate a formula of the belief base approach into DEL: in particular, we provide a specific action model scheme corresponding to the addition of a formula in a belief base. Conversely, we identify a fragment of DEL that can be translated in the multi- agent belief base language.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"18 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":"134139390","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
ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser ALASPO:一个自适应大邻域ASP优化器
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/58
Thomas Eiter, Tobias Geibinger, N. Ruiz, Nysret Musliu, J. Oetsch, D. Stepanova
{"title":"ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser","authors":"Thomas Eiter, Tobias Geibinger, N. Ruiz, Nysret Musliu, J. Oetsch, D. Stepanova","doi":"10.24963/kr.2022/58","DOIUrl":"https://doi.org/10.24963/kr.2022/58","url":null,"abstract":"We present the system ALASPO which implements Adaptive Large-neighbourhood search for Answer Set Programming (ASP) Optimisation. Large-neighbourhood search (LNS) is a meta-heuristic where parts of a solution are destroyed and reconstructed in an attempt to improve an overall objective. ALASPO currently supports the ASP solver clingo, as well as its extensions clingo-dl and clingcon for difference and full integer constraints, and multi-shot solving for an efficient implementation of the LNS loop. Neighbourhoods can be defined in code or declaratively as part of the ASP encoding. While the method underlying ALASPO has been described in previous work, ALASPO also incorporates portfolios for the LNS operators along with self-adaptive selection strategies as a technical novelty. This improves usability considerably at no loss of solution quality, but on the contrary often yields benefits. To demonstrate this, we evaluate ALASPO on different optimisation benchmarks.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"1 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":"130367464","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
Faithful Approaches to Rule Learning 忠实的规则学习方法
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/50
David Tena Cucala, B. C. Grau, B. Motik
{"title":"Faithful Approaches to Rule Learning","authors":"David Tena Cucala, B. C. Grau, B. Motik","doi":"10.24963/kr.2022/50","DOIUrl":"https://doi.org/10.24963/kr.2022/50","url":null,"abstract":"Rule learning involves developing machine learning models that can be applied to a set of logical facts to predict additional facts, as well as providing methods for extracting from the learned model a set of logical rules that explain symbolically the model's predictions. Existing such approaches, however, do not describe formally the relationship between the model's predictions and the derivations of the extracted rules; rather, it is often claimed without justification that the extracted rules `approximate' or `explain' the model, and rule quality is evaluated by manual inspection. In this paper, we study the formal properties of Neural-LP--a prominent rule learning approach. We show that the rules extracted from Neural-LP models can be both unsound and incomplete: on the same input dataset, the extracted rules can derive facts not predicted by the model, and the model can make predictions not derived by the extracted rules. We also propose a modification to the Neural-LP model that ensures that the extracted rules are always sound and complete. Finally, we show that, on several prominent benchmarks, the classification performance of our modified model is comparable to that of the standard Neural-LP model. Thus, faithful learning of rules is feasible from both a theoretical and practical point of view.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"33 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":"115829448","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
Public and Private Affairs in Strategic Reasoning 战略推理中的公共与私人事务
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/14
Nathanaël Fijalkow, Bastien Maubert, A. Murano, S. Rubin, Moshe Y. Vardi
{"title":"Public and Private Affairs in Strategic Reasoning","authors":"Nathanaël Fijalkow, Bastien Maubert, A. Murano, S. Rubin, Moshe Y. Vardi","doi":"10.24963/kr.2022/14","DOIUrl":"https://doi.org/10.24963/kr.2022/14","url":null,"abstract":"Do agents know each others’ strategies? In multi-process software construction, each process has access to the processes already constructed; but in typical human-robot interactions, a human may not announce its strategy to the robot (indeed, the human may not even know their own strategy). This question has often been overlooked when modeling and reasoning about multi-agent systems. In this work, we study how it impacts strategic reasoning.\u0000\u0000To do so we consider Strategy Logic (SL), a well-established and highly expressive logic for strategic reasoning. Its usual semantics, which we call “white-box semantics”, models systems in which agents “broadcast” their strategies. By adding imperfect information to the evaluation games for the usual semantics, we obtain a new semantics called “black-box semantics”, in which agents keep their strategies private. We consider the model-checking problem and show that the black-box semantics has much lower complexity than white-box semantics for an important fragment of Strategy Logic.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"90 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":"134589697","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
Neural-Probabilistic Answer Set Programming 神经概率答案集规划
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/48
Arseny Skryagin, Wolfgang Stammer, Daniel Ochs, D. Dhami, K. Kersting
{"title":"Neural-Probabilistic Answer Set Programming","authors":"Arseny Skryagin, Wolfgang Stammer, Daniel Ochs, D. Dhami, K. Kersting","doi":"10.24963/kr.2022/48","DOIUrl":"https://doi.org/10.24963/kr.2022/48","url":null,"abstract":"The goal of combining the robustness of neural networks and the expressivity of symbolic methods has rekindled the interest in Neuro-Symbolic AI. One specifically interesting branch of research is deep probabilistic programming languages (DPPLs) which carry out probabilistic logical programming via the probability estimations of deep neural networks. However, recent SOTA DPPL approaches allow only for limited conditional probabilistic queries and do not offer the power of true joint probability estimation. In our work, we propose an easy integration of tractable probabilistic inference within a DPPL. To this end we introduce SLASH, a novel DPPL that consists of Neural-Probabilistic Predicates (NPPs) and a logical program, united via answer set programming. NPPs are a novel design principle allowing for the unification of all deep model types and combinations thereof to be represented as a single probabilistic predicate. In this context, we introduce a novel +/- notation for answering various types of probabilistic queries by adjusting the atom notations of a predicate. We evaluate SLASH on the benchmark task of MNIST addition as well as novel tasks for DPPLs such as missing data prediction, generative learning and set prediction with state-of-the-art performance, thereby showing the effectiveness and generality of our method.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"18 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":"122006365","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
Automatic Synthesis of Dynamic Norms for Multi-Agent Systems 多智能体系统动态规范的自动综合
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/2
N. Alechina, Giuseppe De Giacomo, B. Logan, Giuseppe Perelli
{"title":"Automatic Synthesis of Dynamic Norms for Multi-Agent Systems","authors":"N. Alechina, Giuseppe De Giacomo, B. Logan, Giuseppe Perelli","doi":"10.24963/kr.2022/2","DOIUrl":"https://doi.org/10.24963/kr.2022/2","url":null,"abstract":"Norms have been widely proposed to coordinate and regulate multi-agent systems (MAS) behaviour. We consider the problem of synthesising and revising the set of norms in a normative MAS to satisfy a design objective expressed in Alternating Time Temporal Logic (ATL*). ATL* is a well-established language for strategic reasoning, which allows the specification of norms that constrain the strategic behaviour of agents. We focus on dynamic norms, that is, norms corresponding to Mealy machines, that allow us to place different constraints on the agents' behaviour depending on the state of the norm and the state of the underlying MAS. We show that synthesising dynamic norms is (k + 1)-EXPTIME, where k is the alternation depth of quantifiers in the ATL* specification. Note that for typical cases of interest, k is either 1 or 2. We also study the problem of removing existing norms to satisfy a new objective, which we show to be 2EXPTIME-complete.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"40 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":"128698361","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
Kernel Contraction and the Order of Relevance 核压缩与关联顺序
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning Pub Date : 2022-07-01 DOI: 10.24963/kr.2022/30
Jandson S. Ribeiro
{"title":"Kernel Contraction and the Order of Relevance","authors":"Jandson S. Ribeiro","doi":"10.24963/kr.2022/30","DOIUrl":"https://doi.org/10.24963/kr.2022/30","url":null,"abstract":"The postulate of relevance provides a suitable and general notion of minimal change for belief contraction. Relevance is tightly connected to smooth kernel contractions when an agent's epistemic state is represented as a logically closed set of formulae. \u0000This connection, however, breaks down when an agent's epistemic state is represented as a set of formulae not necessarily logically closed. \u0000We investigate the cause behind this schism, and we reconnect relevance with smooth kernel contractions by constraining the behaviour of their choice mechanisms and epistemic preference relations. \u0000Our first representation theorem connects smooth kernel contractions with a novel class of epistemic preference relations. \u0000For our second representation theorem, we introduce the principle of symmetry of removal that relates relevance to epistemic choices. \u0000For the last theorem, we devise a novel class of smooth kernel contractions, that satisfy relevance, which are based on epistemic preference relations that capture the principle of symmetry of removal.","PeriodicalId":351970,"journal":{"name":"Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning","volume":"418 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":"117330928","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
下一页 尾页
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学术官方微信