Model Checking Branching Time Logics

Alicante(2007)

引用 4|浏览0
暂无评分
摘要
Automated planning is a central area of artificial intelligence, involving the design of languages and computational models for reasoning about actions, change and time. In domain-independent planning, a planning problem is specified by the description ...
更多
查看译文
关键词
artificial intelligence,automated planning,central area,domain-independent planning,model checking branching time,planning problem,computational model,temporal logic,model checking,automata,computer science,circuits,polynomials,formal verification,logic programming,np hard problem,computational complexity,ctl,np complete problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要