7 search results - page 1 / 2 » Decomposition of Decidable First-Order Logics over Integers ... |
TIME
2008
IEEE
13 years 11 months ago
2008
IEEE
We tackle the issue of representing infinite sets of realvalued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
CADE
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a wor...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
ECAI
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...