A clausal resolution method for CTL branching-time temporal logic

Author： Bolotov Alexander   Fisher Michael  

Publisher： Taylor & Francis Ltd

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.11, Iss.1, 1999-01, pp. : 77-93

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the expressivity and complexity of quantitative branching-time temporal logics

By Laroussinie F.   Schnoebelen P.   Turuani M.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 297-315

Elsevier

Access to resources Recommend Favorite

Inductive equivalence in clausal logic and nonmonotonic logic programming

By Sakama Chiaki   Inoue Katsumi  

Machine Learning, Vol. 83, Iss. 1, 2011-04 ,pp. : 1-29

Springer Publishing Company

Access to resources Recommend Favorite

Dealing with Multiple Granularity of Time in Temporal Logic Programming

By Liu C.   Orgun M.A.  

Journal of Symbolic Computation, Vol. 22, Iss. 5, 1996-11 ,pp. : 699-720

Academic Press

Access to resources Recommend Favorite

Completeness of a first-order temporal logic with time-gaps

By Baaz M.   Leitsch A.   Zach R.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 241-270

Elsevier

Access to resources Recommend Favorite

Assumption/guarantee specifications in linear-time temporal logic

By Jonsson B.   Yih-Kuen T.  

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 47-72

Elsevier

Access to resources Recommend Favorite