Artif. Intell.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":"13 1","pages":"54-69"},"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}
Artif. Intell.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":"27 1","pages":"70-96"},"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}
Artif. Intell.Pub Date : 2016-06-24DOI: 10.4204/EPTCS.215.4
T. Ågotnes, Yì Nicholas Wáng
{"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":"119 1","pages":"1-21"},"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}
Artif. Intell.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":"72 1","pages":"1-34"},"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}
Artif. Intell.Pub Date : 2016-02-28DOI: 10.4230/LIPIcs.MFCS.2017.80
Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng
{"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":"89 1","pages":"103961"},"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}
Artif. Intell.Pub Date : 2016-02-12DOI: 10.1609/aaai.v30i1.10078
R. Ganian, S. Ordyniak
{"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":"55 1","pages":"61-71"},"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}
Artif. Intell.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":"22 1","pages":"1-27"},"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号
