Pub Date : 2012-11-01DOI: 10.1016/j.artint.2012.07.005
Siddharth Srivastava, N. Immerman, S. Zilberstein
{"title":"Applicability conditions for plans with loops: Computability results and algorithms","authors":"Siddharth Srivastava, N. Immerman, S. Zilberstein","doi":"10.1016/j.artint.2012.07.005","DOIUrl":"https://doi.org/10.1016/j.artint.2012.07.005","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"14 1","pages":"1-19"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84631270","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 : 2012-11-01DOI: 10.1016/j.artint.2012.07.003
Veronica L. Policicchio, Adriana Pietramala, P. Rullo
{"title":"GAMoN: Discovering M-of-N{¬, ∨} hypotheses for text classification by a lattice-based Genetic Algorithm","authors":"Veronica L. Policicchio, Adriana Pietramala, P. Rullo","doi":"10.1016/j.artint.2012.07.003","DOIUrl":"https://doi.org/10.1016/j.artint.2012.07.003","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"7 1","pages":"61-95"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74337603","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 : 2012-10-08DOI: 10.1007/978-3-642-33558-7_62
Stéphane Caro, Damien Chablat, A. Goldsztejn, Daisuke Ishii, C. Jermann
{"title":"A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots","authors":"Stéphane Caro, Damien Chablat, A. Goldsztejn, Daisuke Ishii, C. Jermann","doi":"10.1007/978-3-642-33558-7_62","DOIUrl":"https://doi.org/10.1007/978-3-642-33558-7_62","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"16 1","pages":"34-50"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76919749","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 : 2012-07-22DOI: 10.1016/j.artint.2015.03.007
Vernon Asuncion, Yin Chen, Yan Zhang, Yi Zhou
{"title":"Ordered completion for logic programs with aggregates","authors":"Vernon Asuncion, Yin Chen, Yan Zhang, Yi Zhou","doi":"10.1016/j.artint.2015.03.007","DOIUrl":"https://doi.org/10.1016/j.artint.2015.03.007","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"59 1","pages":"72-102"},"PeriodicalIF":0.0,"publicationDate":"2012-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82661858","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}
Craig Boutilier, I. Caragiannis, Simi Haber, Tyler Lu, A. Procaccia, Or Sheffet
We adopt a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives. For many reasons one might consider mechanisms, or social choice functions, that only have access to the ordinal rankings of alternatives by the individual agents rather than their utility functions. In this context, one possible objective for a social choice function is the maximization of (expected) social welfare relative to the information contained in these rankings. We study such optimal social choice functions under three different models, and underscore the important role played by scoring functions. In our worst-case model, no assumptions are made about the underlying distribution and we analyze the worst-case distortion---or degree to which the selected alternative does not maximize social welfare---of optimal social choice functions. In our average-case model, we derive optimal functions under neutral (or impartial culture) distributional models. Finally, a very general learning-theoretic model allows for the computation of optimal social choice functions (i.e., that maximize expected social welfare) under arbitrary, sampleable distributions. In the latter case, we provide both algorithms and sample complexity results for the class of scoring functions, and further validate the approach empirically.
{"title":"Optimal social choice functions: a utilitarian view","authors":"Craig Boutilier, I. Caragiannis, Simi Haber, Tyler Lu, A. Procaccia, Or Sheffet","doi":"10.1145/2229012.2229030","DOIUrl":"https://doi.org/10.1145/2229012.2229030","url":null,"abstract":"We adopt a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives. For many reasons one might consider mechanisms, or social choice functions, that only have access to the ordinal rankings of alternatives by the individual agents rather than their utility functions. In this context, one possible objective for a social choice function is the maximization of (expected) social welfare relative to the information contained in these rankings. We study such optimal social choice functions under three different models, and underscore the important role played by scoring functions. In our worst-case model, no assumptions are made about the underlying distribution and we analyze the worst-case distortion---or degree to which the selected alternative does not maximize social welfare---of optimal social choice functions. In our average-case model, we derive optimal functions under neutral (or impartial culture) distributional models. Finally, a very general learning-theoretic model allows for the computation of optimal social choice functions (i.e., that maximize expected social welfare) under arbitrary, sampleable distributions. In the latter case, we provide both algorithms and sample complexity results for the class of scoring functions, and further validate the approach empirically.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"8 1","pages":"190-213"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86806414","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 : 2012-06-01DOI: 10.1016/j.artint.2012.02.001
Geoffrey Chu, Peter James Stuckey
{"title":"A complete solution to the Maximum Density Still Life Problem","authors":"Geoffrey Chu, Peter James Stuckey","doi":"10.1016/j.artint.2012.02.001","DOIUrl":"https://doi.org/10.1016/j.artint.2012.02.001","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"6 1","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75182748","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 : 2012-04-27DOI: 10.1007/978-3-642-28148-8_5
Mario Alviano, Wolfgang Faber, G. Greco, N. Leone
{"title":"Magic Sets for disjunctive Datalog programs","authors":"Mario Alviano, Wolfgang Faber, G. Greco, N. Leone","doi":"10.1007/978-3-642-28148-8_5","DOIUrl":"https://doi.org/10.1007/978-3-642-28148-8_5","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"2 1","pages":"156-192"},"PeriodicalIF":0.0,"publicationDate":"2012-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77592424","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
扫码关注我们
求助内容：
应助结果提醒方式：