The definable criterion for definability in Presburger arithmetic and its applications

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 1433-1444

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Deciding Boolean Algebra with Presburger Arithmetic

By Kuncak Viktor Nguyen Huu Rinard Martin

Journal of Automated Reasoning, Vol. 36, Iss. 3, 2006-04 ,pp. : 213-239

Springer Publishing Company

Access to resources Recommend Favorite

Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

By Rusu V. Zinovieva E.

Electronic Notes in Theoretical Computer Science, Vol. 50, Iss. 4, 2004-01 ,pp. : 1-15

Elsevier

Access to resources Recommend Favorite

Chase-Like Decoding of Arithmetic Codes with Applications

International Journal of Computer Vision and Image Processing (IJCVIP), Vol. 1, Iss. 1, 2011-01 ,pp. : 27-40

IGI Global_journal

Access to resources Recommend Favorite

Interval arithmetic techniques for the design of controllers for nonlinear dynamical systems with applications in mechatronics

By Aschemann H.

Journal of Computer and Systems Sciences International, Vol. 49, Iss. 5, 2010-10 ,pp. : 683-695

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The workflow system and its applications

By Chow W-M.

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 506-519

Taylor & Francis Ltd

Access to resources Recommend Favorite