[{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:15Z","doi":"10.1162/evco_a_00266","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"},{"_id":"63"},{"_id":"238"}],"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"title":"Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets","related_material":{"link":[{"url":"https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266","relation":"confirmation"}]},"page":"165–193","year":"2020","type":"journal_article","citation":{"short":"M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266.","ama":"Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation. 2020;28(2):165–193. doi:10.1162/evco_a_00266","apa":"Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266","chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation 28, no. 2 (2020): 165–193. https://doi.org/10.1162/evco_a_00266.","bibtex":"@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={10.1162/evco_a_00266}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }","mla":"Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266."},"_id":"15025","intvolume":" 28","issue":"2","publication":"Evolutionary Computation","publisher":"MIT Press Journals","author":[{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","id":"33176","last_name":"Wever"},{"full_name":"van Rooijen, Lorijn","first_name":"Lorijn","id":"58843","last_name":"van Rooijen"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"volume":28,"date_created":"2019-11-18T14:19:19Z","status":"public","abstract":[{"lang":"eng","text":"In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available."}],"user_id":"15415"},{"author":[{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843"},{"full_name":"Baeumer, Frederik Simon","first_name":"Frederik Simon","last_name":"Baeumer"},{"last_name":"Platenius","first_name":" Marie Christin","full_name":"Platenius, Marie Christin"},{"full_name":"Geierhos,, Michaela","first_name":" Michaela","last_name":"Geierhos,"},{"full_name":"Hamann, Heiko ","first_name":" Heiko ","last_name":"Hamann"},{"last_name":"Engels","id":"107","first_name":"Gregor","full_name":"Engels, Gregor"}],"department":[{"_id":"671"}],"status":"public","date_created":"2021-09-28T17:49:05Z","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","user_id":"71124","year":"2017","citation":{"bibtex":"@inproceedings{van Rooijen_Baeumer_Platenius_Geierhos,_Hamann_Engels_2017, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, author={van Rooijen, Lorijn and Baeumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017} }","mla":"van Rooijen, Lorijn, et al. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. 2017.","ama":"van Rooijen L, Baeumer FS, Platenius Marie Christin, Geierhos, Michaela, Hamann Heiko , Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: ; 2017.","apa":"van Rooijen, L., Baeumer, F. S., Platenius, Marie Christin, Geierhos, Michaela, Hamann, Heiko , & Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. Fourth International Workshop on Artificial Intelligence for Requirements Engineering (AIRE’17) workshop - in conjuction with RE’17.","chicago":"Rooijen, Lorijn van, Frederik Simon Baeumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” 2017.","ieee":"L. van Rooijen, F. S. Baeumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” presented at the Fourth International Workshop on Artificial Intelligence for Requirements Engineering (AIRE’17) workshop - in conjuction with RE’17, 2017.","short":"L. van Rooijen, F.S. Baeumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, G. Engels, in: 2017."},"type":"conference","language":[{"iso":"eng"}],"_id":"25101","date_updated":"2022-01-06T06:56:51Z","conference":{"start_date":"2017-09-05","name":"Fourth International Workshop on Artificial Intelligence for Requirements Engineering (AIRE'17) workshop - in conjuction with RE'17"}},{"abstract":[{"text":"Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets.","lang":"eng"}],"ddc":["000"],"user_id":"57458","author":[{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843"},{"first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","id":"38837"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","first_name":"Michaela"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"}],"publisher":"IEEE","quality_controlled":"1","file_date_updated":"2018-11-02T14:50:35Z","keyword":["Software","Unified modeling language","Requirements engineering","Ontologies","Search problems","Natural languages"],"publication":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","file":[{"date_updated":"2018-11-02T14:50:35Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":433613,"file_id":"5285","creator":"ups","access_level":"closed","date_created":"2018-11-02T14:50:35Z","file_name":"08054881.pdf"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:10Z","_id":"97","conference":{"name":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","start_date":"2017-09-04","location":"Lisbon, Portugal","end_date":"2017-09-08"},"year":"2017","type":"conference","citation":{"short":"L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.","ieee":"L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.","apa":"van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., & Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26","ama":"van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26","chicago":"Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.","mla":"van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.","bibtex":"@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }"},"page":"379-385","place":"Piscataway, NJ, USA","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"34"},{"_id":"7"},{"_id":"66"},{"_id":"238"},{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-5386-3489-9"],"eisbn":["978-1-5386-3488-2 "]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_updated":"2022-01-06T07:04:18Z","doi":"10.1109/REW.2017.26","language":[{"iso":"eng"}]},{"title":"A Characterization for Decidable Separability by Piecewise Testable Languages","user_id":"58843","volume":19,"status":"public","date_created":"2019-01-15T09:54:52Z","author":[{"last_name":"Czerwinski","full_name":"Czerwinski, Wojciech","first_name":"Wojciech"},{"last_name":"Martens","first_name":"Wim","full_name":"Martens, Wim"},{"full_name":"van Rooijen, Lorijn","first_name":"Lorijn","id":"58843","last_name":"van Rooijen"},{"last_name":"Zeitoun","full_name":"Zeitoun, Marc","first_name":"Marc"},{"full_name":"Zetzsche, Georg","first_name":"Georg","last_name":"Zetzsche"}],"department":[{"_id":"66"}],"publication":"Discrete Mathematics & Theoretical Computer Science","doi":"10.23638/DMTCS-19-4-1","issue":"4","date_updated":"2022-01-06T07:03:17Z","_id":"6725","intvolume":" 19","citation":{"ieee":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, and G. Zetzsche, “A Characterization for Decidable Separability by Piecewise Testable Languages,” Discrete Mathematics & Theoretical Computer Science, vol. 19, no. 4, 2017.","short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, G. Zetzsche, Discrete Mathematics & Theoretical Computer Science 19 (2017).","bibtex":"@article{Czerwinski_Martens_van Rooijen_Zeitoun_Zetzsche_2017, title={A Characterization for Decidable Separability by Piecewise Testable Languages}, volume={19}, DOI={10.23638/DMTCS-19-4-1}, number={4}, journal={Discrete Mathematics & Theoretical Computer Science}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc and Zetzsche, Georg}, year={2017} }","mla":"Czerwinski, Wojciech, et al. “A Characterization for Decidable Separability by Piecewise Testable Languages.” Discrete Mathematics & Theoretical Computer Science, vol. 19, no. 4, 2017, doi:10.23638/DMTCS-19-4-1.","chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, and Georg Zetzsche. “A Characterization for Decidable Separability by Piecewise Testable Languages.” Discrete Mathematics & Theoretical Computer Science 19, no. 4 (2017). https://doi.org/10.23638/DMTCS-19-4-1.","apa":"Czerwinski, W., Martens, W., van Rooijen, L., Zeitoun, M., & Zetzsche, G. (2017). A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science, 19(4). https://doi.org/10.23638/DMTCS-19-4-1","ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M, Zetzsche G. A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science. 2017;19(4). doi:10.23638/DMTCS-19-4-1"},"year":"2017","type":"journal_article","language":[{"iso":"eng"}]},{"department":[{"_id":"66"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Active Coevolutionary Learning of Requirements Specifications from Examples","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:15Z","doi":"10.1145/3071178.3071258","file":[{"file_name":"p1327-wever.pdf","date_created":"2018-11-02T15:00:35Z","access_level":"closed","creator":"ups","file_id":"5290","file_size":1092021,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T15:00:35Z"}],"author":[{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"},{"full_name":"van Rooijen, Lorijn","first_name":"Lorijn","id":"58843","last_name":"van Rooijen"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)","file_date_updated":"2018-11-02T15:00:35Z","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:15Z","abstract":[{"lang":"eng","text":"Within software engineering, requirements engineering starts from imprecise and vague user requirements descriptions and infers precise, formalized specifications. Techniques, such as interviewing by requirements engineers, are typically applied to identify the user’s needs. We want to partially automate even this first step of requirements elicitation by methods of evolutionary computation. The idea is to enable users to specify their desired software by listing examples of behavioral descriptions. Users initially specify two lists of operation sequences, one with desired behaviors and one with forbidden behaviors. Then, we search for the appropriate formal software specification in the form of a deterministic finite automaton. We solve this problem known as grammatical inference with an active coevolutionary approach following Bongard and Lipson [2]. The coevolutionary process alternates between two phases: (A) additional training data is actively proposed by an evolutionary process and the user is interactively asked to label it; (B) appropriate automata are then evolved to solve this extended grammatical inference problem. Our approach leverages multi-objective evolution in both phases and outperforms the state-of-the-art technique [2] for input alphabet sizes of three and more, which are relevant to our problem domain of requirements specification."}],"user_id":"477","ddc":["000"],"citation":{"chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Active Coevolutionary Learning of Requirements Specifications from Examples.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 1327--1334, 2017. https://doi.org/10.1145/3071178.3071258.","ama":"Wever MD, van Rooijen L, Hamann H. Active Coevolutionary Learning of Requirements Specifications from Examples. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO). ; 2017:1327--1334. doi:10.1145/3071178.3071258","apa":"Wever, M. D., van Rooijen, L., & Hamann, H. (2017). Active Coevolutionary Learning of Requirements Specifications from Examples. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (pp. 1327--1334). https://doi.org/10.1145/3071178.3071258","mla":"Wever, Marcel Dominik, et al. “Active Coevolutionary Learning of Requirements Specifications from Examples.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334, doi:10.1145/3071178.3071258.","bibtex":"@inproceedings{Wever_van Rooijen_Hamann_2017, title={Active Coevolutionary Learning of Requirements Specifications from Examples}, DOI={10.1145/3071178.3071258}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2017}, pages={1327--1334} }","short":"M.D. Wever, L. van Rooijen, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334.","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Active Coevolutionary Learning of Requirements Specifications from Examples,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334."},"type":"conference","year":"2017","page":"1327--1334","_id":"120"},{"date_created":"2017-10-17T12:41:35Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"has_accepted_license":"1","status":"public","file":[{"file_size":6498677,"creator":"florida","file_id":"1512","content_type":"application/pdf","date_updated":"2018-03-21T10:36:37Z","success":1,"relation":"main_file","date_created":"2018-03-21T10:36:37Z","file_name":"221-SFB_SSL_Techreport.pdf","access_level":"closed"}],"file_date_updated":"2018-03-21T10:36:37Z","department":[{"_id":"66"},{"_id":"76"}],"publisher":"Universität Paderborn","author":[{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"first_name":"Klementina","full_name":"Josifovska, Klementina","last_name":"Josifovska"},{"last_name":"van Rooijen","id":"58843","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"},{"full_name":"Arifulina, Svetlana","first_name":"Svetlana","last_name":"Arifulina"},{"first_name":"Matthias","full_name":"Becker, Matthias","last_name":"Becker"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"},{"full_name":"Schäfer, Wilhelm","first_name":"Wilhelm","last_name":"Schäfer"}],"user_id":"477","title":"An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)","ddc":["040"],"language":[{"iso":"eng"}],"type":"report","citation":{"ieee":"M. C. Platenius et al., An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn, 2016.","short":"M.C. Platenius, K. Josifovska, L. van Rooijen, S. Arifulina, M. Becker, G. Engels, W. Schäfer, An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3), Universität Paderborn, 2016.","bibtex":"@book{Platenius_Josifovska_van Rooijen_Arifulina_Becker_Engels_Schäfer_2016, title={An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)}, publisher={Universität Paderborn}, author={Platenius, Marie Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm}, year={2016} }","mla":"Platenius, Marie Christin, et al. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn, 2016.","apa":"Platenius, M. C., Josifovska, K., van Rooijen, L., Arifulina, S., Becker, M., Engels, G., & Schäfer, W. (2016). An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn.","ama":"Platenius MC, Josifovska K, van Rooijen L, et al. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn; 2016.","chicago":"Platenius, Marie Christin, Klementina Josifovska, Lorijn van Rooijen, Svetlana Arifulina, Matthias Becker, Gregor Engels, and Wilhelm Schäfer. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn, 2016."},"year":"2016","_id":"221","date_updated":"2022-01-06T06:55:25Z"},{"title":"Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"}],"doi":"10.1109/REW.2016.015","date_updated":"2022-01-06T06:52:42Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"A task at the beginning of the software development process is the creation of a requirements specification. The requirements specification is usually created by a software engineering expert. We try to substitute this expert by a domain expert (the user) and formulate the problem of creating requirements specifications as a search-based software engineering problem. The domain expert provides only examples of event sequences that describe the behavior of the required software program. These examples are represented by simple sequence diagrams and are divided into two subsets: positive examples of required program behavior and negative examples of prohibited program behavior. The task is then to synthesize a generalized requirements specification that usefully describes the required software. We approach this problem by applying a genetic algorithm and evolve deterministic finite automata (DFAs). These DFAs take the sequence diagrams as input that should be either accepted (positive example) or rejected (negative example). The problem is neither to find the minimal nor the most general automaton. Instead, the user should be provided with several appropriate automata from which the user can select, or which help the user to refine the examples given initially. We present the context of our research (\"On-The-Fly Computing\"), present our approach, report results indicating its feasibility, and conclude with a discussion.","lang":"eng"}],"date_created":"2017-10-17T12:41:23Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-21T12:47:21Z","publication":"Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)","author":[{"last_name":"van Rooijen","id":"58843","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T12:47:21Z","content_type":"application/pdf","creator":"florida","file_id":"1546","file_size":419026,"access_level":"closed","file_name":"160-07815598.pdf","date_created":"2018-03-21T12:47:21Z"}],"_id":"160","page":"3--9","citation":{"apa":"van Rooijen, L., & Hamann, H. (2016). Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016) (pp. 3--9). https://doi.org/10.1109/REW.2016.015","ama":"van Rooijen L, Hamann H. Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In: Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016). ; 2016:3--9. doi:10.1109/REW.2016.015","chicago":"Rooijen, Lorijn van, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” In Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 3--9, 2016. https://doi.org/10.1109/REW.2016.015.","bibtex":"@inproceedings{van Rooijen_Hamann_2016, title={Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm}, DOI={10.1109/REW.2016.015}, booktitle={Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)}, author={van Rooijen, Lorijn and Hamann, Heiko}, year={2016}, pages={3--9} }","mla":"van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9, doi:10.1109/REW.2016.015.","short":"L. van Rooijen, H. Hamann, in: Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9.","ieee":"L. van Rooijen and H. Hamann, “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm,” in Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9."},"type":"conference","year":"2016"},{"_id":"6726","date_updated":"2022-01-06T07:03:17Z","doi":"10.1007/978-3-319-22177-9\\_14","page":"173-185","type":"conference","citation":{"ieee":"W. Czerwinski, W. Martens, L. van Rooijen, and M. Zeitoun, “A Note on Decidable Separability by Piecewise Testable Languages,” in Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–185.","short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, in: Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–185.","mla":"Czerwinski, Wojciech, et al. “A Note on Decidable Separability by Piecewise Testable Languages.” Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–85, doi:10.1007/978-3-319-22177-9\\_14.","bibtex":"@inproceedings{Czerwinski_Martens_van Rooijen_Zeitoun_2015, title={A Note on Decidable Separability by Piecewise Testable Languages}, DOI={10.1007/978-3-319-22177-9\\_14}, booktitle={Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc}, year={2015}, pages={173–185} }","apa":"Czerwinski, W., Martens, W., van Rooijen, L., & Zeitoun, M. (2015). A Note on Decidable Separability by Piecewise Testable Languages. In Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings (pp. 173–185). https://doi.org/10.1007/978-3-319-22177-9\\_14","ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M. A Note on Decidable Separability by Piecewise Testable Languages. In: Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. ; 2015:173-185. doi:10.1007/978-3-319-22177-9\\_14","chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, and Marc Zeitoun. “A Note on Decidable Separability by Piecewise Testable Languages.” In Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 173–85, 2015. https://doi.org/10.1007/978-3-319-22177-9\\_14."},"year":"2015","language":[{"iso":"eng"}],"extern":"1","title":"A Note on Decidable Separability by Piecewise Testable Languages","user_id":"58843","publication":"Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings","department":[{"_id":"66"}],"author":[{"full_name":"Czerwinski, Wojciech","first_name":"Wojciech","last_name":"Czerwinski"},{"full_name":"Martens, Wim","first_name":"Wim","last_name":"Martens"},{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843"},{"first_name":"Marc","full_name":"Zeitoun, Marc","last_name":"Zeitoun"}],"date_created":"2019-01-15T10:01:56Z","status":"public"},{"_id":"6727","date_updated":"2022-01-06T07:03:17Z","language":[{"iso":"eng"}],"year":"2014","citation":{"short":"L. van Rooijen, 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.","ieee":"L. van Rooijen, 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.","ama":"van Rooijen L. 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.","apa":"van Rooijen, L. (2014). 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.","chicago":"Rooijen, Lorijn van. 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.","mla":"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.","bibtex":"@book{van Rooijen_2014, title={A combinatorial approach to the separation problem for regular languages. (Une approche combinatoire du problème de séparation pour les langages réguliers)}, publisher={University of Bordeaux, France}, author={van Rooijen, Lorijn}, year={2014} }"},"type":"dissertation","user_id":"58843","title":"A combinatorial approach to the separation problem for regular languages. (Une approche combinatoire du problème de séparation pour les langages réguliers)","extern":"1","date_created":"2019-01-15T10:05:42Z","status":"public","department":[{"_id":"66"}],"author":[{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"}],"publisher":"University of Bordeaux, France"},{"title":"On Separation by Locally Testable and Locally Threshold Testable Languages","publication_status":"published","publication_identifier":{"issn":["1860-5974"]},"department":[{"_id":"66"}],"doi":"10.2168/lmcs-10(3:24)2014","date_updated":"2022-01-06T07:03:17Z","language":[{"iso":"eng"}],"user_id":"58843","extern":"1","date_created":"2019-01-15T10:07:47Z","status":"public","volume":10,"publication":"Logical Methods in Computer Science","publisher":"Logical Methods in Computer Science e.V.","author":[{"first_name":"Thomas","full_name":"Place, Thomas","last_name":"Place"},{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843"},{"full_name":"Zeitoun, Marc","first_name":"Marc","last_name":"Zeitoun"}],"issue":"3","_id":"6728","intvolume":" 10","year":"2014","type":"journal_article","citation":{"short":"T. Place, L. van Rooijen, M. Zeitoun, Logical Methods in Computer Science 10 (2014).","ieee":"T. Place, L. van Rooijen, and M. Zeitoun, “On Separation by Locally Testable and Locally Threshold Testable Languages,” Logical Methods in Computer Science, vol. 10, no. 3, 2014.","chicago":"Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “On Separation by Locally Testable and Locally Threshold Testable Languages.” Logical Methods in Computer Science 10, no. 3 (2014). https://doi.org/10.2168/lmcs-10(3:24)2014.","ama":"Place T, van Rooijen L, Zeitoun M. On Separation by Locally Testable and Locally Threshold Testable Languages. Logical Methods in Computer Science. 2014;10(3). doi:10.2168/lmcs-10(3:24)2014","apa":"Place, T., van Rooijen, L., & Zeitoun, M. (2014). On Separation by Locally Testable and Locally Threshold Testable Languages. Logical Methods in Computer Science, 10(3). https://doi.org/10.2168/lmcs-10(3:24)2014","bibtex":"@article{Place_van Rooijen_Zeitoun_2014, title={On Separation by Locally Testable and Locally Threshold Testable Languages}, volume={10}, DOI={10.2168/lmcs-10(3:24)2014}, number={3}, journal={Logical Methods in Computer Science}, publisher={Logical Methods in Computer Science e.V.}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, year={2014} }","mla":"Place, Thomas, et al. “On Separation by Locally Testable and Locally Threshold Testable Languages.” 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."}},{"title":"Relational semantics for full linear logic","publication_identifier":{"issn":["1570-8683"]},"publication_status":"published","department":[{"_id":"66"}],"doi":"10.1016/j.jal.2013.07.005","date_updated":"2022-01-06T07:03:17Z","language":[{"iso":"eng"}],"user_id":"58843","extern":"1","volume":12,"status":"public","date_created":"2019-01-15T10:09:17Z","author":[{"last_name":"Coumans","first_name":"Dion","full_name":"Coumans, Dion"},{"last_name":"Gehrke","first_name":"Mai","full_name":"Gehrke, Mai"},{"last_name":"van Rooijen","id":"58843","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"}],"publisher":"Elsevier BV","publication":"Journal of Applied Logic","issue":"1","_id":"6729","intvolume":" 12","year":"2013","citation":{"short":"D. Coumans, M. Gehrke, L. van Rooijen, Journal of Applied Logic 12 (2013) 50–66.","ieee":"D. Coumans, M. Gehrke, and L. van Rooijen, “Relational semantics for full linear logic,” Journal of Applied Logic, vol. 12, no. 1, pp. 50–66, 2013.","chicago":"Coumans, Dion, Mai Gehrke, and Lorijn van Rooijen. “Relational Semantics for Full Linear Logic.” Journal of Applied Logic 12, no. 1 (2013): 50–66. https://doi.org/10.1016/j.jal.2013.07.005.","apa":"Coumans, D., Gehrke, M., & van Rooijen, L. (2013). Relational semantics for full linear logic. Journal of Applied Logic, 12(1), 50–66. https://doi.org/10.1016/j.jal.2013.07.005","ama":"Coumans D, Gehrke M, van Rooijen L. Relational semantics for full linear logic. Journal of Applied Logic. 2013;12(1):50-66. doi:10.1016/j.jal.2013.07.005","bibtex":"@article{Coumans_Gehrke_van Rooijen_2013, title={Relational semantics for full linear logic}, volume={12}, DOI={10.1016/j.jal.2013.07.005}, number={1}, journal={Journal of Applied Logic}, publisher={Elsevier BV}, author={Coumans, Dion and Gehrke, Mai and van Rooijen, Lorijn}, year={2013}, pages={50–66} }","mla":"Coumans, Dion, et al. “Relational Semantics for Full Linear Logic.” Journal of Applied Logic, vol. 12, no. 1, Elsevier BV, 2013, pp. 50–66, doi:10.1016/j.jal.2013.07.005."},"type":"journal_article","page":"50-66"},{"_id":"6730","date_updated":"2022-01-06T07:03:17Z","intvolume":" 24","doi":"10.4230/LIPICS.FSTTCS.2013.363","series_title":"LIPIcs","language":[{"iso":"eng"}],"page":"363--375","citation":{"short":"T. Place, L. van Rooijen, M. Zeitoun, in: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013, pp. 363--375.","ieee":"T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages,” in Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India, 2013, vol. 24, pp. 363--375.","apa":"Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. In Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India (Vol. 24, pp. 363--375). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.FSTTCS.2013.363","ama":"Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. In: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India. Vol 24. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2013:363--375. doi:10.4230/LIPICS.FSTTCS.2013.363","chicago":"Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.” In Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India, 24:363--375. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. https://doi.org/10.4230/LIPICS.FSTTCS.2013.363.","mla":"Place, Thomas, et al. “Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.” 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.","bibtex":"@inproceedings{Place_van Rooijen_Zeitoun_2013, series={LIPIcs}, title={Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages}, volume={24}, DOI={10.4230/LIPICS.FSTTCS.2013.363}, booktitle={Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, year={2013}, pages={363--375}, collection={LIPIcs} }"},"type":"conference","year":"2013","extern":"1","user_id":"58843","title":"Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages","publication":"Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India","department":[{"_id":"66"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","author":[{"first_name":"Thomas","full_name":"Place, Thomas","last_name":"Place"},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"},{"first_name":"Marc","full_name":"Zeitoun, Marc","last_name":"Zeitoun"}],"date_created":"2019-01-15T10:10:14Z","status":"public","volume":24},{"date_created":"2019-01-15T10:23:36Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642403125","9783642403132"]},"department":[{"_id":"66"}],"publication":"Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Thomas","full_name":"Place, Thomas","last_name":"Place"},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"},{"last_name":"Zeitoun","first_name":"Marc","full_name":"Zeitoun, Marc"}],"user_id":"58843","title":"Separating Regular Languages by Piecewise Testable and Unambiguous Languages","place":"Berlin, Heidelberg","extern":"1","language":[{"iso":"eng"}],"page":"729-740","type":"conference","year":"2013","citation":{"ieee":"T. Place, L. van Rooijen, and M. Zeitoun, “Separating Regular Languages by Piecewise Testable and Unambiguous Languages,” in Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, 2013, pp. 729–740.","short":"T. Place, L. van Rooijen, M. Zeitoun, in: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 729–740.","mla":"Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” 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.","bibtex":"@inproceedings{Place_van Rooijen_Zeitoun_2013, place={Berlin, Heidelberg}, title={Separating Regular Languages by Piecewise Testable and Unambiguous Languages}, DOI={10.1007/978-3-642-40313-2_64}, booktitle={Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}, publisher={Springer Berlin Heidelberg}, author={Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, year={2013}, pages={729–740} }","apa":"Place, T., van Rooijen, L., & Zeitoun, M. (2013). Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013 (pp. 729–740). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_64","ama":"Place T, van Rooijen L, Zeitoun M. Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740. doi:10.1007/978-3-642-40313-2_64","chicago":"Place, Thomas, Lorijn van Rooijen, and Marc Zeitoun. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.” In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, 729–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-40313-2_64."},"doi":"10.1007/978-3-642-40313-2_64","date_updated":"2022-01-06T07:03:17Z","_id":"6732"},{"user_id":"52534","status":"public","date_created":"2019-01-31T11:51:48Z","volume":20,"author":[{"first_name":"Anna","full_name":"Chernilovskaya, Anna","last_name":"Chernilovskaya"},{"last_name":"Gehrke","first_name":"Mai","full_name":"Gehrke, Mai"},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"}],"publisher":"Oxford University Press (OUP)","publication":"Logic Journal of IGPL","issue":"6","_id":"7342","intvolume":" 20","type":"journal_article","year":"2012","citation":{"ama":"Chernilovskaya A, Gehrke M, van Rooijen L. Generalized Kripke semantics for the Lambek-Grishin calculus. Logic Journal of IGPL. 2012;20(6):1110-1132. doi:10.1093/jigpal/jzr051","apa":"Chernilovskaya, A., Gehrke, M., & van Rooijen, L. (2012). Generalized Kripke semantics for the Lambek-Grishin calculus. Logic Journal of IGPL, 20(6), 1110–1132. https://doi.org/10.1093/jigpal/jzr051","chicago":"Chernilovskaya, Anna, Mai Gehrke, and Lorijn van Rooijen. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” Logic Journal of IGPL 20, no. 6 (2012): 1110–32. https://doi.org/10.1093/jigpal/jzr051.","mla":"Chernilovskaya, Anna, et al. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” Logic Journal of IGPL, vol. 20, no. 6, Oxford University Press (OUP), 2012, pp. 1110–32, doi:10.1093/jigpal/jzr051.","bibtex":"@article{Chernilovskaya_Gehrke_van Rooijen_2012, title={Generalized Kripke semantics for the Lambek-Grishin calculus}, volume={20}, DOI={10.1093/jigpal/jzr051}, number={6}, journal={Logic Journal of IGPL}, publisher={Oxford University Press (OUP)}, author={Chernilovskaya, Anna and Gehrke, Mai and van Rooijen, Lorijn}, year={2012}, pages={1110–1132} }","short":"A. Chernilovskaya, M. Gehrke, L. van Rooijen, Logic Journal of IGPL 20 (2012) 1110–1132.","ieee":"A. Chernilovskaya, M. Gehrke, and L. van Rooijen, “Generalized Kripke semantics for the Lambek-Grishin calculus,” Logic Journal of IGPL, vol. 20, no. 6, pp. 1110–1132, 2012."},"page":"1110-1132","title":"Generalized Kripke semantics for the Lambek-Grishin calculus","publication_status":"published","publication_identifier":{"issn":["1367-0751","1368-9894"]},"department":[{"_id":"66"}],"doi":"10.1093/jigpal/jzr051","date_updated":"2022-01-06T07:03:35Z","language":[{"iso":"eng"}]},{"page":"1110-1132","type":"journal_article","citation":{"apa":"Chernilovskaya, A., Gehrke, M., & van Rooijen, L. (2012). Generalized Kripke semantics for the Lambek-Grishin calculus. Logic Journal of IGPL, 20(6), 1110–1132. https://doi.org/10.1093/jigpal/jzr051","ama":"Chernilovskaya A, Gehrke M, van Rooijen L. Generalized Kripke semantics for the Lambek-Grishin calculus. Logic Journal of IGPL. 2012;20(6):1110-1132. doi:10.1093/jigpal/jzr051","chicago":"Chernilovskaya, A., M. Gehrke, and Lorijn van Rooijen. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” Logic Journal of IGPL 20, no. 6 (2012): 1110–32. https://doi.org/10.1093/jigpal/jzr051.","bibtex":"@article{Chernilovskaya_Gehrke_van Rooijen_2012, title={Generalized Kripke semantics for the Lambek-Grishin calculus}, volume={20}, DOI={10.1093/jigpal/jzr051}, number={6}, journal={Logic Journal of IGPL}, publisher={Oxford University Press (OUP)}, author={Chernilovskaya, A. and Gehrke, M. and van Rooijen, Lorijn}, year={2012}, pages={1110–1132} }","mla":"Chernilovskaya, A., et al. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” Logic Journal of IGPL, vol. 20, no. 6, Oxford University Press (OUP), 2012, pp. 1110–32, doi:10.1093/jigpal/jzr051.","short":"A. Chernilovskaya, M. Gehrke, L. van Rooijen, Logic Journal of IGPL 20 (2012) 1110–1132.","ieee":"A. Chernilovskaya, M. Gehrke, and L. van Rooijen, “Generalized Kripke semantics for the Lambek-Grishin calculus,” Logic Journal of IGPL, vol. 20, no. 6, pp. 1110–1132, 2012."},"year":"2012","intvolume":" 20","_id":"6733","issue":"6","publication":"Logic Journal of IGPL","publisher":"Oxford University Press (OUP)","author":[{"last_name":"Chernilovskaya","full_name":"Chernilovskaya, A.","first_name":"A."},{"last_name":"Gehrke","full_name":"Gehrke, M.","first_name":"M."},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"}],"volume":20,"date_created":"2019-01-15T10:28:38Z","status":"public","extern":"1","user_id":"58843","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:17Z","doi":"10.1093/jigpal/jzr051","publication_status":"published","publication_identifier":{"issn":["1367-0751","1368-9894"]},"title":"Generalized Kripke semantics for the Lambek-Grishin calculus"}]