Decomposition of Decidable First-Order Logics over Integers and Reals
| dc.creator | Bouchy, Florent | |
| dc.creator | Finkel, Alain | |
| dc.creator | Leroux, Jérôme | |
| dc.date | 2008-12-10 | |
| dc.date.accessioned | 2026-07-07T12:11:42Z | |
| dc.date.available | 2026-07-07T12:11:42Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0812.1967 | |
| dc.identifier | http://arxiv.org/abs/0812.1967 | |
| dc.identifier | Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, Montreal, QC : Canada (2008) | |
| dc.identifier | doi:10.1109/TIME.2008.22 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/210304 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Decomposition of Decidable First-Order Logics over Integers and Reals | |
| dc.type | text |