Open AccessVerification of Qualitative ℤ Constraints
Author(s) -
Stéphane Demri,
Régis Gascon
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-28309-9
DOI - 10.1007/11539452_39
Subject(s) - decidability , presburger arithmetic , boolean data type , mathematics , discrete mathematics , modulo , arity , satisfiability , rotation formalisms in three dimensions , computer science , programming language , geometry
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in MediaObjects/InlineFigure2.png. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom