Skip to main content
SpringerLink
Log in

Solving linear constraints over real and rational fields

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Practical methods are proposed to solve linear constraints over real and rational fields with quantifiers. Secondary problems are observed together with the set of possible solutions in the context of automatic software model verification.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. http://en.wikipedia.org/wiki/First-order_logic.

  2. http://coq.inria.fr/V8.1pl4/refman/Reference-Manual022.html.

  3. http://en.wikipedia.org/wiki/Fourier%E2%80%93Motzkin_elimination

  4. G. E. Collins, “Quantifier elimination by cylindrical algebraic decomposition — twenty years of progress,” in: B. F. Caviness and J. R. Johnson (eds.), Quantifier Elimination and Cylindrical Algebraic Decomposition, Springer–Verlag, New York (1998), pp. 8–23.

    Google Scholar 

  5. http://www.umiacs.umd.edu/~hismail/Omega/node3.html.

  6. G. Badros, A. Borning, and P. Stuckey, “The Cassowary linear arithmetic constraint solving algorithm,” ACM Trans. on Computer-Human Interaction (TOCHI), 8(4), 267–306 (2001).

    Article  Google Scholar 

  7. http://research.microsoft.com/en-us/um/redmond/projects/z3/index.html.

  8. J.-L. Lassez, “Querying constraints,” in: Proc. ACM Conf. on Principles of Database Systems (ACM 089791-352-3/90/0004/0288), Nashville (1990).

  9. http://en.wikipedia.org/wiki/Gaussian_elimination

  10. B. C. Eaves and U. G. Rothblum, “Dines–Fourier–Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields,” Math. Program., 53, No. 3, 307–321 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Huynh, L. Joskowicz, C. Lassez, and J. Lassez, “Practical tools for reasoning about linear constraints,” Fundam. Inf., 3–4, 357–380 (1991).

    MathSciNet  Google Scholar 

  12. C. Lassez and J.-L. Lassez, Quantifier Elimination for Conjunctions of Linear Constraint via a Convex Hull Algorithm: Techn. Rep., IBM T. J. Watson / Research Center, Yorktown Heights (1991).

  13. J. L. Lassez and K. McAloon, “A canonical form of generalized linear constraints,” J. Symbolic Comput., 33, 147–160 (1992).

    MathSciNet  Google Scholar 

  14. J.-L. Imbert, “Variable elimination for disequations in generalised liner constraint systems,” The Computer J., 36, No. 5 (1993).

  15. Boost Libraries, www.boost.org

  16. W. Pugh and D. Wonnacott, “Going beyond integer programming with the omega test to eliminate false data dependences,” IEEE Trans. on Parallel and Distributed Systems, 6, No. 2, 204–211 (1995).

    Article  Google Scholar 

  17. N. Bshouty, “A subexponential exact learning algorithm for DNF using equivalence queries,” Information Processing Letters, 59, 37–39 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Tarui and T. Tsukiji, “Learning DNF by approximating inclusion-exclusion formulae,” in: Proc. IEEE Conf. on Comput. Complexity (1999), pp. 215–220.

  19. A. R. Klivans and R. A. Servedio, “Learning DNF in time \( 2{O^{\left( {{n^{{{1} \left/ {3} \right.}}}} \right)}} \),” J. Comput. Syst. Sci., 68(2), 303–318 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  20. http://www.springerlink.com/content/htq68m20q121t3jw/.

  21. http://code.google.com/p/constraints-solver-over-r/.

  22. http://en.wikipedia.org/wiki/Time-Triggered_Protocol.

  23. A. B. Godlevsky and S. N. Svirgunenko, “Using linear models in optimizing parameters of time-triggered protocols,” Cybern. Syst. Analysis, 42, No. 3, 328–334 (2006).

    Article  MATH  Google Scholar 

  24. http://www.risc.uni-linz.ac.at/projects/intas/Timisoara/Presentations/German/German.pdf.

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    V. N. German

Authors
  1. V. N. German
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. N. German.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 123–133, July–August 2010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

German, V.N. Solving linear constraints over real and rational fields. Cybern Syst Anal 46, 630–638 (2010). https://doi.org/10.1007/s10559-010-9239-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-010-9239-5

Keywords

Search

Navigation