๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of choosing the branching literal in DPLL

โœ Scribed by Paolo Liberatore

Book ID
108307084
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
99 KB
Volume
116
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the expressivity and complexity of qu
On the expressivity and complexity of quantitative branching-time temporal logics
โœ F. Laroussinie; Ph. Schnoebelen; M. Turuani ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 347 KB

We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even