116 search results - page 16 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
ISNN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
101
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
TPHOL
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
FORMATS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we introduce a variant of temporal logic tailored for specifying desired properties of continuous signals. The logic is based on a bounded subset of the rea...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...