SAT-based planning in complex domains: Concurrency, constraints and nondeterminism-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

Published:2003-07 Issue:1-2 Volume:147 Page:85-117
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Castellini Claudio,Giunchiglia Enrico,Tacchella Armando

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference51 articles.

1. Generating satisfiable problem instances;Achlioptas,2000

2. Using CSP look-back techniques to solve real-world SAT instances;Bayardo,1997

3. Heuristic search + symbolic model checking = efficient conformant planning;Bertoli,2001

4. Symbolic model checking without BDDs;Biere,1999

5. Fast planning through planning graph analysis;Blum,1995

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Achieving High MAP-Coverage Through Pattern Constraint Reduction;IEEE Transactions on Software Engineering;2023-01-01

2. Answer Set Planning: A Survey;Theory and Practice of Logic Programming;2022-04-01

3. Planning with Incomplete Information in Quantified Answer Set Programming;Theory and Practice of Logic Programming;2021-09

4. SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets;IEEE Transactions on Reliability;2021-06

5. Chapter 30. Reasoning with Quantified Boolean Formulas;Frontiers in Artificial Intelligence and Applications;2021-02-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP