Sciweavers

4513 search results - page 628 / 903
» Logic programming with satisfiability
Sort
View
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
15 years 11 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
FOSSACS
2007
Springer
15 years 10 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
ICALP
2007
Springer
15 years 10 months ago
Continuous Capacities on Continuous State Spaces
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
Jean Goubault-Larrecq
SGAI
2007
Springer
15 years 10 months ago
Learning Sets of Sub-Models for Spatio-Temporal Prediction
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
Andrew Bennett, Derek R. Magee
143
Voted
APLAS
2006
ACM
15 years 10 months ago
Relational Reasoning for Recursive Types and References
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
Nina Bohr, Lars Birkedal