Sciweavers

2062 search results - page 30 / 413
» Derivatives of Logical Formulas
Sort
View
LICS
1994
IEEE
14 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
JUCS
2010
114views more  JUCS 2010»
13 years 8 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
ECAI
2004
Springer
14 years 3 months ago
Compilation of LTL Goal Formulas into PDDL
Abstract. Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extend...
Stephen Cresswell, Alexandra M. Coddington
SAT
2004
Springer
111views Hardware» more  SAT 2004»
14 years 3 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak
CADE
2005
Springer
14 years 10 months ago
sKizzo: A Suite to Evaluate and Certify QBFs
We present sKizzo, a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by means of propositional skolemization and symbolic reasoning.
Marco Benedetti