A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formali
β¦ LIBER β¦
A clausal resolution method for branching-time logic ECTL+
β Scribed by Alexander Bolotov; Artie Basukoski
- Publisher
- Springer Netherlands
- Year
- 2006
- Tongue
- English
- Weight
- 448 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A clausal resolution method for extended
β
Alexander Bolotov; Artie Basukoski
π
Article
π
2006
π
Elsevier Science
π
English
β 255 KB
A complete deductive-system for since-un
β
Alberto Zanardo
π
Article
π
1991
π
Springer Netherlands
π
English
β 861 KB
Model checking for a probabilistic branc
β
Christel Baier; Marta Kwiatkowska
π
Article
π
1998
π
Springer-Verlag
π
English
β 698 KB
A branch and bound method for the job-sh
β
Christian Artigues; Dominique Feillet
π
Article
π
2007
π
Springer US
π
English
β 481 KB
A time efficient method for determinatio
β
L. Satish; Santosh C. Vora; Alok Kumar Sinha
π
Article
π
2005
π
Elsevier Science
π
English
β 312 KB
Modulated repetition time look-locker (M
β
Neville D. Gai; John A. Butman
π
Article
π
2009
π
John Wiley and Sons
π
English
β 637 KB
## Abstract ## Purpose To demonstrate a modification of the LookβLocker (LL) technique that enables rapid high resolution T1 mapping over the physiologic range of intracranial T1 values, ranging from white matter to cerebrospinal fluid (CSF). This is achieved by use of a threeβdimensional (3D) bal