Sciweavers

1138 search results - page 181 / 228
» First-Order Model Checking Problems Parameterized by the Mod...
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
LICS
2008
IEEE
14 years 2 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
ECAI
2004
Springer
13 years 12 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
AAAI
2007
13 years 10 months ago
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
Zhen Liu, Anand Ranganathan, Anton Riabov
KBSE
2009
IEEE
14 years 2 months ago
Loopfrog: A Static Analyzer for ANSI-C Programs
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
Daniel Kroening, Natasha Sharygina, Stefano Tonett...