Sciweavers

2062 search results - page 157 / 413
» Derivatives of Logical Formulas
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 10 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
139
Voted
WABI
2007
Springer
15 years 10 months ago
Predicting Protein Folding Kinetics Via Temporal Logic Model Checking
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Christopher James Langmead, Sumit Kumar Jha
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 10 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
KR
2010
Springer
15 years 9 months ago
The Temporal Logic of Token Causes
While type causality helps us to understand general relationships such as the etiology of a disease (smoking causing lung cancer), token causality aims to explain causal connectio...
Samantha Kleinberg, Bud Mishra
FOSSACS
2007
Springer
15 years 8 months ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...