Pub Date : 2016-10-01DOI: 10.1016/j.artint.2016.06.007
J. Zabkar, I. Bratko, J. Demšar
{"title":"Extracting qualitative relations from categorical data","authors":"J. Zabkar, I. Bratko, J. Demšar","doi":"10.1016/j.artint.2016.06.007","DOIUrl":"https://doi.org/10.1016/j.artint.2016.06.007","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82958494","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}
Pub Date : 2016-10-01DOI: 10.1016/j.artint.2016.06.003
Thomas Eiter, Michael Fink, D. Stepanova
{"title":"Data repair of inconsistent nonmonotonic description logic programs","authors":"Thomas Eiter, Michael Fink, D. Stepanova","doi":"10.1016/j.artint.2016.06.003","DOIUrl":"https://doi.org/10.1016/j.artint.2016.06.003","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82219036","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}
Pub Date : 2016-10-01DOI: 10.1016/j.artint.2016.06.008
Chanhyun Kang, Sarit Kraus, Cristian Molinaro, Francesca Spezzano, V. S. Subrahmanian
{"title":"Diffusion centrality: A paradigm to maximize spread in social networks","authors":"Chanhyun Kang, Sarit Kraus, Cristian Molinaro, Francesca Spezzano, V. S. Subrahmanian","doi":"10.1016/j.artint.2016.06.008","DOIUrl":"https://doi.org/10.1016/j.artint.2016.06.008","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90321747","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}
Distributed knowledge is the sum of the knowledge in a group; what someone who is able to discern between two possible worlds whenever any member of the group can discern between them, would know. Sometimes distributed knowledge is referred to as the potential knowledge of a group, or the joint knowledge they could obtain if they had unlimited means of communication. In epistemic logic, the formula D_G{phi} is intended to express the fact that group G has distributed knowledge of {phi}, that there is enough information in the group to infer {phi}. But this is not the same as reasoning about what happens if the members of the group share their information. In this paper we introduce an operator R_G, such that R_G{phi} means that {phi} is true after G have shared all their information with each other - after G's distributed knowledge has been resolved. The R_G operators are called resolution operators. Semantically, we say that an expression R_G{phi} is true iff {phi} is true in what van Benthem [11, p. 249] calls (G's) communication core; the model update obtained by removing links to states for members of G that are not linked by all members of G. We study logics with different combinations of resolution operators and operators for common and distributed knowledge. Of particular interest is the relationship between distributed and common knowledge. The main results are sound and complete axiomatizations.
分布式知识是一个群体中知识的总和;如果一个人能够分辨出两个可能的世界，并且团队中的任何成员都能分辨出来，他就会知道。有时，分布式知识被称为一个群体的潜在知识，或者如果他们有无限的沟通手段，他们可以获得的共同知识。在认识论逻辑中，公式D_G{phi}旨在表示组G具有关于{phi}的分布式知识的事实，即组中有足够的信息来推断{phi}。但这与推断如果群体成员共享信息会发生什么不同。本文引入一个算子R_G，使得R_G{phi}意味着在G之间共享了所有的信息之后，即在G的分布式知识被解析之后，{phi}为真。R_G操作符称为解析操作符。语义上，我们说表达式R_G{phi}为真，如果{phi}在van Benthem [11, p. 249]所说的(G的)通信核心中为真;通过移除与G的所有成员没有链接的G的成员的状态链接而获得的模型更新。我们使用不同的解析算子和共同知识和分布式知识的算子组合来研究逻辑。特别令人感兴趣的是分布式知识和公共知识之间的关系。主要结果是合理和完整的公理化。
{"title":"Resolving distributed knowledge","authors":"T. Ågotnes, Yì Nicholas Wáng","doi":"10.4204/EPTCS.215.4","DOIUrl":"https://doi.org/10.4204/EPTCS.215.4","url":null,"abstract":"Distributed knowledge is the sum of the knowledge in a group; what someone who is able to discern between two possible worlds whenever any member of the group can discern between them, would know. Sometimes distributed knowledge is referred to as the potential knowledge of a group, or the joint knowledge they could obtain if they had unlimited means of communication. In epistemic logic, the formula D_G{phi} is intended to express the fact that group G has distributed knowledge of {phi}, that there is enough information in the group to infer {phi}. But this is not the same as reasoning about what happens if the members of the group share their information. In this paper we introduce an operator R_G, such that R_G{phi} means that {phi} is true after G have shared all their information with each other - after G's distributed knowledge has been resolved. The R_G operators are called resolution operators. Semantically, we say that an expression R_G{phi} is true iff {phi} is true in what van Benthem [11, p. 249] calls (G's) communication core; the model update obtained by removing links to states for members of G that are not linked by all members of G. We study logics with different combinations of resolution operators and operators for common and distributed knowledge. Of particular interest is the relationship between distributed and common knowledge. The main results are sound and complete axiomatizations.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77475049","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}
Pub Date : 2016-06-14DOI: 10.1016/j.artint.2017.06.003
Amílcar Mata Díaz, R. Pérez
{"title":"Impossibility in belief merging","authors":"Amílcar Mata Díaz, R. Pérez","doi":"10.1016/j.artint.2017.06.003","DOIUrl":"https://doi.org/10.1016/j.artint.2017.06.003","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78061432","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}
Pub Date : 2016-02-28DOI: 10.4230/LIPIcs.MFCS.2017.80
Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng
Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling relaxations such as (Walrasian) envy-free pricing do. In this paper we design an optimal envy-free mechanism for multi-unit auctions with budgets. When the market is even mildly competitive, the approximation ratios of this mechanism are small constants for both the revenue and welfare objectives, and in fact for welfare the approximation converges to 1 as the market becomes fully competitive. We also give an impossibility theorem, showing that truthfulness requires discarding resources and, in particular, is incompatible with (Pareto) efficiency.
{"title":"Walrasian Pricing in Multi-Unit Auctions","authors":"Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng","doi":"10.4230/LIPIcs.MFCS.2017.80","DOIUrl":"https://doi.org/10.4230/LIPIcs.MFCS.2017.80","url":null,"abstract":"Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling relaxations such as (Walrasian) envy-free pricing do. In this paper we design an optimal envy-free mechanism for multi-unit auctions with budgets. When the market is even mildly competitive, the approximation ratios of this mechanism are small constants for both the revenue and welfare objectives, and in fact for welfare the approximation converges to 1 as the market becomes fully competitive. We also give an impossibility theorem, showing that truthfulness requires discarding resources and, in particular, is incompatible with (Pareto) efficiency.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79733422","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}
Pub Date : 2016-02-12DOI: 10.1609/aaai.v30i1.10078
R. Ganian, S. Ordyniak
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. Despite its huge range of applications, only few tractable fragments of ILP are known, probably the most prominent of which is based on the notion of total unimodularity. Using entirely different techniques, we identify new tractable fragments of ILP by studying structural parameterizations of the constraint matrix within the framework of parameterized complexity. In particular, we show that ILP is fixed-parameter tractable when parameterized by the treedepth of the constraint matrix and the maximum absolute value of any coefficient occurring in the ILP instance. Together with matching hardness results for the more general parameter treewidth, we draw a detailed complexity landscape of ILP w.r.t. decompositional parameters defined on the constraint matrix.
{"title":"The Complexity Landscape of Decompositional Parameters for ILP","authors":"R. Ganian, S. Ordyniak","doi":"10.1609/aaai.v30i1.10078","DOIUrl":"https://doi.org/10.1609/aaai.v30i1.10078","url":null,"abstract":"\u0000 \u0000 Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. Despite its huge range of applications, only few tractable fragments of ILP are known, probably the most prominent of which is based on the notion of total unimodularity. Using entirely different techniques, we identify new tractable fragments of ILP by studying structural parameterizations of the constraint matrix within the framework of parameterized complexity. In particular, we show that ILP is fixed-parameter tractable when parameterized by the treedepth of the constraint matrix and the maximum absolute value of any coefficient occurring in the ILP instance. Together with matching hardness results for the more general parameter treewidth, we draw a detailed complexity landscape of ILP w.r.t. decompositional parameters defined on the constraint matrix.\u0000 \u0000","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73410327","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}
Pub Date : 2015-07-01DOI: 10.1016/j.artint.2015.03.002
A. Cimatti, A. Micheli, Marco Roveri
{"title":"An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty","authors":"A. Cimatti, A. Micheli, Marco Roveri","doi":"10.1016/j.artint.2015.03.002","DOIUrl":"https://doi.org/10.1016/j.artint.2015.03.002","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83357054","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：