Sciweavers

220 search results - page 28 / 44
» Coq Modulo Theory
Sort
View
69
Voted
IANDC
2007
126views more  IANDC 2007»
14 years 9 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
MOC
2000
71views more  MOC 2000»
14 years 9 months ago
Zeroes of Dirichlet L-functions and irregularities in the distribution of primes
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
Carter Bays, Richard H. Hudson
FOCS
2003
IEEE
15 years 3 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
TOCL
2008
128views more  TOCL 2008»
14 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 3 days ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...