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

Artif. Intell.最新文献

筛选
英文 中文
SAT-based Explicit LTLf Satisfiability Checking 基于sat的显式ltf可满足性检验
Artif. Intell. Pub Date : 2018-11-07 DOI: 10.1609/aaai.v33i01.33012946
Jianwen Li, Kristin Yvonne Rozier, G. Pu, Yueling Zhang, Moshe Y. Vardi
{"title":"SAT-based Explicit LTLf Satisfiability Checking","authors":"Jianwen Li, Kristin Yvonne Rozier, G. Pu, Yueling Zhang, Moshe Y. Vardi","doi":"10.1609/aaai.v33i01.33012946","DOIUrl":"https://doi.org/10.1609/aaai.v33i01.33012946","url":null,"abstract":"We present a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existing approaches for LTLf satisfiability checking, by demonstrating an approximate four-fold speed-up compared to the second-best solver.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81294356","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}
引用次数: 31
The Topology of Boundaries 边界的拓扑结构
Artif. Intell. Pub Date : 2018-07-20 DOI: 10.1016/0004-3702(94)00051-4
Margaret M. Fleck
{"title":"The Topology of Boundaries","authors":"Margaret M. Fleck","doi":"10.1016/0004-3702(94)00051-4","DOIUrl":"https://doi.org/10.1016/0004-3702(94)00051-4","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89563476","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
Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models 基于习得二值化神经网络转移模型的分解状态和动作空间规划
Artif. Intell. Pub Date : 2018-07-01 DOI: 10.24963/ijcai.2018/669
B. Say, S. Sanner
{"title":"Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models","authors":"B. Say, S. Sanner","doi":"10.24963/ijcai.2018/669","DOIUrl":"https://doi.org/10.24963/ijcai.2018/669","url":null,"abstract":"In this paper, we leverage the efficiency of Binarized Neural Networks (BNNs) to learn complex state transition models of planning domains with discretized factored state and action spaces. In order to directly exploit this transition structure for planning, we present two novel compilations of the learned factored planning problem with BNNs based on reductions to Boolean Satisfiability (FD-SAT-Plan) as well as Binary Linear Programming (FD-BLP-Plan). Experimentally, we show the effectiveness of learning complex transition models with BNNs, and test the runtime efficiency of both encodings on the learned factored planning problem. After this initial investigation, we present an incremental constraint generation algorithm based on generalized landmark constraints to improve the planning accuracy of our encodings. Finally, we show how to extend the best performing encoding (FD-BLP-Plan+) beyond goals to handle factored planning problems with rewards.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72882145","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}
引用次数: 20
Game Description Language and Dynamic Epistemic Logic Compared 游戏描述语言与动态认知逻辑之比较
Artif. Intell. Pub Date : 2018-07-01 DOI: 10.24963/ijcai.2018/248
Thorsten Engesser, Robert Mattmüller, B. Nebel, M. Thielscher
{"title":"Game Description Language and Dynamic Epistemic Logic Compared","authors":"Thorsten Engesser, Robert Mattmüller, B. Nebel, M. Thielscher","doi":"10.24963/ijcai.2018/248","DOIUrl":"https://doi.org/10.24963/ijcai.2018/248","url":null,"abstract":"Several different frameworks have been proposed to model and reason about knowledge in dynamic multi-agent settings, among them the logic-programming-based game description language GDL-III, and dynamic epistemic logic (DEL), based on possible-worlds semantics. GDL-III and DEL have complementary strengths and weaknesses in terms of ease of modeling and simplicity of semantics. In this paper, we formally study the expressiveness of GDL-III vs. DEL. We clarify the commonalities and differences between those languages, demonstrate how to bridge the differences where possible, and identify large fragments of GDL-III and DEL that are equivalent in the sense that they can be used to encode games or planning tasks that admit the same legal action sequences. We prove the latter by providing compilations between those fragments of GDL-III and DEL.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79674834","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}
引用次数: 17
A General Multi-agent Epistemic Planner Based on Higher-order Belief Change 基于高阶信念变化的通用多智能体认知规划
Artif. Intell. Pub Date : 2018-06-29 DOI: 10.24963/ijcai.2017/152
Xiao Huang, Biqing Fang, Hai Wan, Yongmei Liu
{"title":"A General Multi-agent Epistemic Planner Based on Higher-order Belief Change","authors":"Xiao Huang, Biqing Fang, Hai Wan, Yongmei Liu","doi":"10.24963/ijcai.2017/152","DOIUrl":"https://doi.org/10.24963/ijcai.2017/152","url":null,"abstract":"In recent years, multi-agent epistemic planning has received attention from both dynamic logic and planning communities. Existing implementations of multi-agent epistemic planning are based on compilation into classical planning and suffer from various limitations, such as generating only linear plans, restriction to public actions, and incapability to handle disjunctive beliefs. In this paper, we propose a general representation language for multi-agent epistemic planning where the initial KB and the goal, the preconditions and effects of actions can be arbitrary multi-agent epistemic formulas, and the solution is an action tree branching on sensing results. To support efficient reasoning in the multi-agent KD45 logic, we make use of a normal form called alternating cover disjunctive formulas (ACDFs). We propose basic revision and update algorithms for ACDFs. We also handle static propositional common knowledge, which we call constraints. Based on our reasoning, revision and update algorithms, adapting the PrAO algorithm for contingent planning from the literature, we implemented a multi-agent epistemic planner called MEPK. Our experimental results show the viability of our approach.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81759996","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}
引用次数: 48
Making Computational Sense of Montague's Intensional Logic 从计算意义上理解蒙太古的内涵逻辑
Artif. Intell. Pub Date : 2018-02-03 DOI: 10.1016/0004-3702(77)90025-X
Jerry R. Hobbs, S. Rosenschein
{"title":"Making Computational Sense of Montague's Intensional Logic","authors":"Jerry R. Hobbs, S. Rosenschein","doi":"10.1016/0004-3702(77)90025-X","DOIUrl":"https://doi.org/10.1016/0004-3702(77)90025-X","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78649844","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}
引用次数: 59
Combining Experts' Causal Judgments 结合专家的因果判断
Artif. Intell. Pub Date : 2018-02-02 DOI: 10.1609/aaai.v32i1.12112
Dalal Alrajeh, Hana Chockler, Joseph Y. Halpern
{"title":"Combining Experts' Causal Judgments","authors":"Dalal Alrajeh, Hana Chockler, Joseph Y. Halpern","doi":"10.1609/aaai.v32i1.12112","DOIUrl":"https://doi.org/10.1609/aaai.v32i1.12112","url":null,"abstract":"\u0000 \u0000 Consider a policymaker who wants to decide which intervention to perform in order to change a currently undesirable situation. The policymaker has at her disposal a team of experts, each with their own understanding of the causal dependencies between different factors contributing to the outcome. The policymaker has varying degrees of confidence in the experts’ opinions. She wants to combine their opinions in order to decide on the most effective intervention. We formally define the notion of an effective intervention, and then consider how experts’ causal judgments can be combined in order to determine the most effective intervention. We define a notion of two causal models being compatible, and show how compatible causal models can be combined. We then use it as the basis for combining experts causal judgments. We illustrate our approach on a number of real-life examples. \u0000 \u0000","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74663365","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}
引用次数: 15
Effective footstep planning using homotopy-class guidance 利用同伦类引导进行有效的脚步规划
Artif. Intell. Pub Date : 2017-12-02 DOI: 10.1016/j.artint.2020.103346
Vinitha Ranganeni, Sahit Chintalapudi, Oren Salzman, M. Likhachev
{"title":"Effective footstep planning using homotopy-class guidance","authors":"Vinitha Ranganeni, Sahit Chintalapudi, Oren Salzman, M. Likhachev","doi":"10.1016/j.artint.2020.103346","DOIUrl":"https://doi.org/10.1016/j.artint.2020.103346","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84919863","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
Belief revision and projection in the epistemic situation calculus 认知情境演算中的信念修正与投射
Artif. Intell. Pub Date : 2017-10-01 DOI: 10.1016/j.artint.2017.07.004
C. Schwering, G. Lakemeyer, M. Pagnucco
{"title":"Belief revision and projection in the epistemic situation calculus","authors":"C. Schwering, G. Lakemeyer, M. Pagnucco","doi":"10.1016/j.artint.2017.07.004","DOIUrl":"https://doi.org/10.1016/j.artint.2017.07.004","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77543297","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}
引用次数: 10
Robustness Among Multiwinner Voting Rules 多赢家投票规则的鲁棒性
Artif. Intell. Pub Date : 2017-07-05 DOI: 10.1007/978-3-319-66700-3_7
Robert Bredereck, P. Faliszewski, A. Kaczmarczyk, R. Niedermeier, P. Skowron, Nimrod Talmon
{"title":"Robustness Among Multiwinner Voting Rules","authors":"Robert Bredereck, P. Faliszewski, A. Kaczmarczyk, R. Niedermeier, P. Skowron, Nimrod Talmon","doi":"10.1007/978-3-319-66700-3_7","DOIUrl":"https://doi.org/10.1007/978-3-319-66700-3_7","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83996819","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}
引用次数: 46
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信