Sciweavers

8094 search results - page 26 / 1619
» Improvements in Formula Generalization
Sort
View
KR
2004
Springer
14 years 1 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
CAV
2003
Springer
155views Hardware» more  CAV 2003»
13 years 11 months ago
An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
Marc Geilen
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
ICALP
2007
Springer
14 years 1 months ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
TPHOL
2007
IEEE
14 years 1 months ago
Verifying Nonlinear Real Formulas Via Sums of Squares
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
John Harrison