Sciweavers

7 search results - page 1 / 2
» Decomposition of Decidable First-Order Logics over Integers ...
Sort
View
TIME
2008
IEEE
14 years 5 months ago
Decomposition of Decidable First-Order Logics over Integers and Reals
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 ...
Florent Bouchy, Alain Finkel, Jérôme ...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 11 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
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 ...
Viktor Kuncak, Martin C. Rinard
CADE
2006
Springer
14 years 11 months ago
Verifying Mixed Real-Integer Quantifier Elimination
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...
Amine Chaieb
CSL
2010
Springer
14 years 6 days ago
Ordered Sets in the Calculus of Data Structures
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...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
ECAI
1998
Springer
14 years 2 months ago
Description Logics with Concrete Domains and Aggregation
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...
Franz Baader, Ulrike Sattler