Sciweavers

2062 search results - page 44 / 413
» Derivatives of Logical Formulas
Sort
View
73
Voted
ENTCS
2006
121views more  ENTCS 2006»
14 years 11 months ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
CADE
2002
Springer
15 years 11 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
85
Voted
CONCUR
2003
Springer
15 years 4 months ago
Model Checking a Path
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Nicolas Markey, Ph. Schnoebelen
86
Voted
SAT
2005
Springer
142views Hardware» more  SAT 2005»
15 years 4 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
92
Voted
CADE
1992
Springer
15 years 3 months ago
Isabelle-91
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
Tobias Nipkow, Lawrence C. Paulson