{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:10:05Z","timestamp":1745968205424,"version":"3.40.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T00:00:00Z","timestamp":1362441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10472-013-9332-3","type":"journal-article","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T22:54:16Z","timestamp":1362437656000},"page":"301-325","source":"Crossref","is-referenced-by-count":4,"title":["On quantified linear implications"],"prefix":"10.1007","volume":"71","author":[{"given":"Pavlos","family":"Eirinakis","sequence":"first","affiliation":[]},{"given":"Salvatore","family":"Ruggieri","sequence":"additional","affiliation":[]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,5]]},"reference":[{"issue":"3","key":"9332_CR1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1023\/B:JOTA.0000004869.66331.5c","volume":"118","author":"F Borrelli","year":"2003","unstructured":"Borrelli, F., Bemporad, A., Morari, M.: Geometric algorithm for multiparametric linear programming. J. Optim. Theory Appl. 118(3), 515\u2013540 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"9332_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/968708.968710","volume":"37","author":"CW Brown","year":"2003","unstructured":"Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 37(4), 97\u2013108 (2003)","journal-title":"ACM SIGSAM Bulletin"},{"issue":"1\u20132","key":"9332_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1\u20132), 29\u201335 (1988)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"9332_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2), 2\u20139 (1997)","journal-title":"ACM SIGSAM Bulletin"},{"key":"9332_CR5","doi-asserted-by":"crossref","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. In: Matzat, B.H., Greuel, G.M., Hiss, G. (eds.) Algorithmic Algebra and Number Theory, pp. 221\u2013248. Springer (1998)","DOI":"10.1007\/978-3-642-59932-3_11"},{"issue":"4","key":"9332_CR6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10601-012-9127-x","volume":"17","author":"P Eirinakis","year":"2012","unstructured":"Eirinakis, P., Ruggieri, S., Subramani, K., Wojciechowski, P.: A complexity perspective on entailment of paramererized linear constraints. Constraints 17(4), 461\u2013487 (2012)","journal-title":"Constraints"},{"key":"9332_CR7","volume-title":"Postoptimal Analyses, Parametric Programming, and Related Topics","author":"T Gal","year":"1995","unstructured":"Gal, T.: Postoptimal Analyses, Parametric Programming, and Related Topics, 2nd edn. de\u00a0Gruyter and Co., Berlin, Germany (1995)","edition":"2"},{"issue":"3","key":"9332_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1016372507161","volume":"9","author":"R Hall","year":"2002","unstructured":"Hall, R.: Specification, validation, and synthesis of email agent controllers: a case study in function rich reactive system design. Autom. Softw. Eng. 9(3), 233\u2013261 (2002)","journal-title":"Autom. Softw. Eng."},{"key":"9332_CR9","first-page":"226","volume":"81","author":"D Harel","year":"2003","unstructured":"Harel, D.: A grand challenge for computing: towards full reactive modeling of a multi-cellular animal. EATCS Bulletin 81, 226\u2013235 (2003)","journal-title":"EATCS Bulletin"},{"key":"9332_CR10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19,20","author":"J Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.: Constraint logic programming: a survey. J. Log. Program. 19,20, 503\u2013581 (1994)","journal-title":"J. Log. Program."},{"issue":"3","key":"9332_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J Jaffar","year":"1992","unstructured":"Jaffar, J., Michaylov, S., Stuckey, P., Yap, R.: The CLP( ${\\cal R}$ ) language and system. ACM Trans. Program. Lang. Syst. 14(3), 339\u2013395 (1992)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1\u20133","key":"9332_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. J. Log. Program. 37(1\u20133), 1\u201346 (1998)","journal-title":"J. Log. Program."},{"key":"9332_CR13","doi-asserted-by":"crossref","unstructured":"Kam, N., Cohen, I., Harel, D.: The immune system as a reactive system: modeling t cell activation with statecharts. In: Proceedings of the 2001 IEEE Symposia on Human-Centric Computing Languages and Environments, pp. 15\u201322 (2001)","DOI":"10.1109\/HCC.2001.995228"},{"key":"9332_CR14","first-page":"1093","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 224, 1093\u20131096; English translation: Soviet Mathematics Doklady, 20, 1093\u20131096 (1979)","journal-title":"Soviet Mathematics Doklady"},{"key":"9332_CR15","doi-asserted-by":"crossref","unstructured":"Koo, T., Sinopoli, B., Sangiovanni-Vincentelli, A., Sastry, S.: A formal approach to reactive system design: unmanned aerial vehicle flight management system design example. In: Proceedings of the 1999 IEEE International Symposium on Computer Aided Control System Design, pp.\u00a0522\u2013527 (1999)","DOI":"10.1109\/CACSD.1999.808702"},{"key":"9332_CR16","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V Loechner","year":"1997","unstructured":"Loechner, V., Wilde, D.K.: Parameterized polyhedra and their vertices. Int. J. Parallel Program. 25, 525\u2013549 (1997)","journal-title":"Int. J. Parallel Program."},{"key":"9332_CR17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01581642","volume":"19","author":"KG Murty","year":"1980","unstructured":"Murty, K.G.: Computational complexity of parametric linear programming. Math. Program. 19, 213\u2013219 (1980)","journal-title":"Math. Program."},{"key":"9332_CR18","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proceedings of the 2000 ACM Conference on Computer Communications Security, pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"},{"key":"9332_CR19","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proceedings of the 2001 IEEE Symposium on Security and Privacy, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"9332_CR20","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. The MIT Press, Cambridge, MA (2002)"},{"key":"9332_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9783527631216","volume-title":"Multi-parametric Programming: Theory, Algorithms and Applications, Process Systems Engineering Series, vol.\u00a01.","author":"EN Pistikopoulos","year":"2007","unstructured":"Pistikopoulos, E.N., Georgiadis, M., Dua, V.: Multi-parametric Programming: Theory, Algorithms and Applications, Process Systems Engineering Series, vol.\u00a01. Wiley-VCH, Weinheim (2007)"},{"issue":"4","key":"9332_CR22","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/1183278.1183282","volume":"7","author":"S Ratschan","year":"2006","unstructured":"Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Trans. Comput. Log. 7(4), 723\u2013748 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"9332_CR23","doi-asserted-by":"crossref","unstructured":"Ruggieri, S., Mesnard, F.: Typing linear constraints. ACM Trans. Program. Lang. Syst. 32(6), article 21 (2010)","DOI":"10.1145\/1749608.1749610"},{"key":"9332_CR24","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York, NY (1987)"},{"key":"9332_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comp. Sci. 3, 1\u201322 (1977)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"9332_CR26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1024930227883","volume":"2","author":"K Subramani","year":"2003","unstructured":"Subramani, K.: An analysis of partially clairvoyant scheduling. Journal of Mathematical Modelling and Algorithms 2(2), 97\u2013119 (2003)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"9332_CR27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10951-005-6367-2","volume":"8","author":"K Subramani","year":"2005","unstructured":"Subramani, K.: An analysis of totally clairvoyant scheduling. J. Sched. 8(2), 113\u2013133 (2005)","journal-title":"J. Sched."},{"issue":"1","key":"9332_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10472-007-9085-y","volume":"51","author":"K Subramani","year":"2007","unstructured":"Subramani, K.: On a decision procedure for quantified linear programs. Ann. Math. Artif. Intell. 51(1), 55\u201377 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9332_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2009\/845804","volume":"2009","author":"K Subramani","year":"2009","unstructured":"Subramani, K.: On the complexity of selected satisfiability and equivalence queries over boolean formulas and inclusion queries over hulls. J. Appl. Math. Decis. Sci. (JAMDS) 2009, 1\u201318 (2009)","journal-title":"J. Appl. Math. Decis. Sci. (JAMDS)"},{"key":"9332_CR30","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A Tarski","year":"1951","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley (1951)"},{"issue":"1","key":"9332_CR31","doi-asserted-by":"crossref","first-page":"7","DOI":"10.2307\/2274424","volume":"53","author":"L Vries Van Den","year":"1988","unstructured":"Van Den Vries, L.: Alfred Tarski\u2019s elimination theory for closed fields. J. Symb. Log. 53(1), 7\u201319 (1988)","journal-title":"J. Symb. Log."},{"issue":"1\u20132","key":"9332_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"4","author":"V Weispfenning","year":"1988","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. Symb. Comput. 4(1\u20132), 3\u201327 (1988)","journal-title":"J. Symb. Comput."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9332-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9332-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9332-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:55:10Z","timestamp":1745967310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9332-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,5]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9332"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9332-3","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2013,3,5]]}}}