Sciweavers

5084 search results - page 12 / 1017
» Proving Possibility Properties
Sort
View
ECAI
2000
Springer
14 years 2 months ago
Tree-based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas...
Carlos Areces, Rosella Gennari, Juan Heguiabehere,...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
APLAS
2006
ACM
14 years 1 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt
JMLR
2010
158views more  JMLR 2010»
13 years 4 months ago
Restricted Eigenvalue Properties for Correlated Gaussian Designs
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
STACS
2007
Springer
14 years 3 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom