Computer Science – Logic in Computer Science
Scientific paper
2008-12-10
Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, Montreal, QC : Canada (2008)
Computer Science
Logic in Computer Science
Scientific paper
10.1109/TIME.2008.22
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our decomposition splits a logic into two parts : one integer, and one decimal (i.e. on the interval [0,1]). We also give a basis for an implementation of our representation.
Bouchy Florent
Finkel Alain
Leroux Jérôme
No associations
LandOfFree
Decomposition of Decidable First-Order Logics over Integers and Reals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decomposition of Decidable First-Order Logics over Integers and Reals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition of Decidable First-Order Logics over Integers and Reals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-528184