Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.”10.1162/evco_a_00266__Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.

van Rooijen, Lorijn, et al. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. 2017.

van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.”10.1109/REW.2017.26__2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.

Czerwinski, Wojciech, et al. “A Characterization for Decidable Separability by Piecewise Testable Languages.”10.23638/DMTCS-19-4-1__Discrete Mathematics &; Theoretical Computer Science, vol. 19, no. 4, 2017, doi:10.23638/DMTCS-19-4-1.

Wever, Marcel Dominik, et al. “Active Coevolutionary Learning of Requirements Specifications from Examples.”10.1145/3071178.3071258__Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334, doi:10.1145/3071178.3071258.

Platenius, Marie Christin, et al. An Overview of Service Specification Language and Matching in On-The-Fly Computing (.3). Universität Paderborn, 2016.

van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.”10.1109/REW.2016.015__Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9, doi:10.1109/REW.2016.015.

Czerwinski, Wojciech, et al. “A Note on Decidable Separability by Piecewise Testable Languages.”10.1007/978-3-319-22177-9‑14__Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdask, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–85, doi:10.1007/978-3-319-22177-9‑14.

van Rooijen, Lorijn. A Combinatorial Approach to the Separation Problem for Regular Languages. (Une Approche Combinatoire Du Problème de Séparation Pour Les Langages Réguliers). University of Bordeaux, France, 2014.

Place, Thomas, et al. “On Separation by Locally Testable and Locally Threshold Testable Languages.”10.2168/lmcs-10(3:24)2014__Logical Methods in Computer Science, vol. 10, no. 3, Logical Methods in Computer Science e.V., 2014, doi:10.2168/lmcs-10(3:24)2014.

Coumans, Dion, et al. “Relational Semantics for Full Linear Logic.”10.1016/j.jal.2013.07.005__Journal of Applied Logic, vol. 12, no. 1, Elsevier BV, 2013, pp. 50–66, doi:10.1016/j.jal.2013.07.005.

Place, Thomas, et al. “Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.”10.4230/LIPICS.FSTTCS.2013.363__Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India, vol. 24, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013, pp. 363--375, doi:10.4230/LIPICS.FSTTCS.2013.363.

Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.”10.1007/978-3-642-40313-2_64__Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:10.1007/978-3-642-40313-2_64.

Chernilovskaya, Anna, et al. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.”10.1093/jigpal/jzr051__Logic Journal of IGPL, vol. 20, no. 6, Oxford University Press (OUP), 2012, pp. 1110–32, doi:10.1093/jigpal/jzr051.

Chernilovskaya, A., et al. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.”10.1093/jigpal/jzr051__Logic Journal of IGPL, vol. 20, no. 6, Oxford University Press (OUP), 2012, pp. 1110–32, doi:10.1093/jigpal/jzr051.