Sciweavers

1322 search results - page 192 / 265
» Unsound Theorem Proving
Sort
View
INFORMS
2010
110views more  INFORMS 2010»
13 years 6 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 5 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
AAI
2010
94views more  AAI 2010»
13 years 3 months ago
Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Ken Kaneiwa, Norihiro Kamide
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 3 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
ICASSP
2011
IEEE
13 years 17 days ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes