{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,17]],"date-time":"2026-11-17T16:25:47Z","timestamp":1794932747083,"version":"4.9.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>Linear Temporal Logic (LTL) can be used for problem-solving when all problem constraints can be specified in this logic through the use of satisfiability checking techniques. In optimization problems such as scheduling with preferences, where constraints are primarily temporal, LTL is a desirable specification formalism. However, LTL cannot be used as a standalone formalism due to the fact that it is unable to specify soft constraints.<\/jats:p>\n                  <jats:p>\n                    This article introduces Optimization LTL (OLTL), an optimization-oriented extension of LTL that can specify both hard and soft constraints in optimization problems. The syntax, semantics and basic formal properties of this logic are presented, along with an encoding based on bit-vector logic and Linear Real Arithmetic (LRA). Additionally, a tool called\n                    <jats:italic toggle=\"yes\">LiTeLLab<\/jats:italic>\n                    (\n                    <jats:bold>Li<\/jats:bold>\n                    near\n                    <jats:bold>Te<\/jats:bold>\n                    mporal\n                    <jats:bold>L<\/jats:bold>\n                    ogic\n                    <jats:bold>Lab<\/jats:bold>\n                    oratory) is introduced to solve optimization problems specified by OLTL. The feasibility and scalability of using OLTL as a specification formalism is demonstrated through two case studies. These problems, with multiple optimization parameters, are specified in OLTL and\n                    <jats:italic toggle=\"yes\">LiTeLLab<\/jats:italic>\n                    successfully generates optimal solutions.\n                  <\/jats:p>","DOI":"10.1145\/3812533","type":"journal-article","created":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T05:53:31Z","timestamp":1779515611000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["OLTL: An Optimization Extension of Linear Temporal Logic"],"prefix":"10.1145","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9484-6813","authenticated-orcid":false,"given":"Mohammad Mehdi","family":"Pourhashem Kallehbasti","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Science and Technology of Mazandaran","place":["Behshahr, Iran (the Islamic Republic of)"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9193-9560","authenticated-orcid":false,"given":"Matteo","family":"Rossi","sequence":"additional","affiliation":[{"name":"Dipartimento di Meccanica, Politecnico di Milano","place":["Milano, Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2875421"},{"key":"e_1_3_3_3_2","volume-title":"Principles of Model Checking","author":"Baier Christel","year":"2008","unstructured":"Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. MIT Press. Retrieved from https:\/\/mitpress.mit.edu\/9780262026499\/principles-of-model-checking\/"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106411"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2593489.2593492"},{"key":"e_1_3_3_6_2","first-page":"14","volume-title":"Proceedings of the 8th International Workshop on Satisfiability Modulo Theories","volume":"13","author":"Barrett Clark","year":"2010","unstructured":"Clark Barrett, Aaron Stump, and Cesare Tinelli. 2010. The SMT-LIB standard: Version 2.0. In Proceedings of the 8th International Workshop on Satisfiability Modulo Theories 13 (2010), 14. Retrieved from http:\/\/theory.stanford.edu\/barrett\/pubs\/BST10.pdf"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2000799.2000800"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(5:5)2006"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Alessandro Cimatti Anders Franz\u00e9n Alberto Griggio Roberto Sebastiani and Cristian Stenico. 2010. Satisfiability modulo the theory of costs: Foundations and applications. In Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer 99\u2013113. DOI:10.1007\/978-3-642-12002-3_8","DOI":"10.1007\/978-3-642-12002-3_8"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_9"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.09.006"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01090-4_27"},{"key":"e_1_3_3_14_2","volume-title":"Proceedings of the High Confidence Software and Systems Conference","author":"Elenius Daniel","year":"2019","unstructured":"Daniel Elenius, Eric Yeh, St\u00e9phane Graham-Lengrand, Shalini Ghosh, Patrick Lincoln, and Natarajan Shankar. 2019. Deriving formal specifications from natural language requirements using arsenal 21. In Proceedings of the High Confidence Software and Systems Conference. Retrieved from https:\/\/sos-vo.org\/node\/60715"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-3446-x"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629606"},{"key":"e_1_3_3_17_2","volume-title":"International Working Conference on Requirements Engineering: Foundation for Software Quality (REFSQ-2020)","author":"Giannakopoulou Dimitra","year":"2020","unstructured":"Dimitra Giannakopoulou, Anastasia Mavridou, Julian Rhein, Thomas Pressburger, Johann Schumann, and Nija Shi. 2020. Formal requirements elicitation with FRET. In International Working Conference on Requirements Engineering: Foundation for Software Quality (REFSQ-2020). Retrieved from https:\/\/ntrs.nasa.gov\/api\/citations\/20200001989\/downloads\/20200001989.pdf"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.22152\/programming-journal.org\/2023\/7\/7"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-42626-1_6"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0613-5"},{"key":"e_1_3_3_21_2","first-page":"322","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"Khatib Lina","year":"2001","unstructured":"Lina Khatib, Paul Morris, Robert Morris, and Francesca Rossi2001. Temporal constraint reasoning with preferences. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 322\u2013327. Retrieved from https:\/\/ntrs.nasa.gov\/api\/citations\/20010094077\/downloads\/20010094077.pdf"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2030225"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104923"},{"key":"e_1_3_3_24_2","unstructured":"LiTeLLab. 2023. The LiTeLLab Bounded Satisfiability Checker. Retrieved July 20 2025 from https:\/\/github.com\/mmpourhashem\/LiTeLLab."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31606-7_32"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-013-0193-3"},{"key":"e_1_3_3_27_2","unstructured":"Microsoft Research. 2023. Z3: An Efficient SMT Solver. Retrieved July 20 2025 from https:\/\/github.com\/Z3Prover\/z3."},{"key":"e_1_3_3_28_2","volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","year":"1994","unstructured":"Christos H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley. Retrieved from https:\/\/www.amazon.com\/Computational-Complexity-Christos-H-Papadimitriou\/dp\/0201530821"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2020.3014394"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491509.2491514"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6963-14-464"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341412"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.06.002"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207548908942537"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/IRI.2004.1431509"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0280-3"},{"key":"e_1_3_3_38_2","volume-title":"Optimization Modulo Theories with OptiMathSAT","author":"Trentin Patrick","year":"2019","unstructured":"Patrick Trentin. 2019. Optimization Modulo Theories with OptiMathSAT. Ph. D. Dissertation. University of Trento. Retrieved from https:\/\/iris.unitn.it\/retrieve\/af3c6503-7d45-444c-afe1-6a8fe2b9069b\/main.pdf"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2013.6579837"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.44"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1967701.1967747"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC49329.2020.9164304"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3812533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T11:41:21Z","timestamp":1785238881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3812533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1145\/3812533"],"URL":"https:\/\/doi.org\/10.1145\/3812533","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"2023-08-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-07-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}