Sciweavers

247 search results - page 28 / 50
» Logic Programming Approach to Automata-Based Decision Proced...
Sort
View
FOSSACS
2008
Springer
14 years 11 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CSL
2004
Springer
15 years 3 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 1 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
AAAI
2004
14 years 11 months ago
Stochastic Local Search for POMDP Controllers
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
Darius Braziunas, Craig Boutilier
SCCC
1998
IEEE
15 years 2 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...