@misc{KlimczakHofstedtSchmittetal., author = {Klimczak, Peter and Hofstedt, Petra and Schmitt, Ingo and Petersen, Christer}, title = {Computergest{\"u}tzte Methoden der Interpretation. Perspektiven einer digitalen Medienwissenschaft}, series = {Workshop INF-DH-2018}, journal = {Workshop INF-DH-2018}, publisher = {Gesellschaft f{\"u}r Informatik e.V.}, address = {Bonn}, doi = {10.18420/infdh2018-06}, pages = {10}, abstract = {Zwar hat sich die elektronische Datenverarbeitung etwa im Rahmen der Archivierung, der Kategorisierung und der Suche von bzw. in Texten allgemein durchgesetzt, allerdings k{\"o}nnen deren Verfahren bisher nur bedingt auf eine Ebene des Textverst{\"a}ndnisses vordringen. Es existieren keine Algorithmen, die menschliche Interpretation auf Subtextebene zufriedenstellend imitieren k{\"o}nnten. Unter Subtext wird hier eine Bedeutungsebene verstanden, die der expliziten Aussage eines Textes als zus{\"a}tzliche Ausdrucksdimension unterlegt ist. Von Seiten der Computerphilologie sind bisher einzig Textanalyse und -interpretation unterst{\"u}tzende Verfahren entwickelt worden, die lediglich auf der Sprachoberfl{\"a}che Anwendung finden (Jannidis, 2010). Von Seiten der Computerlinguistik und der Informatik existieren hingegen Text-Retrieval-Systeme, die den groben Inhalt von Texten erfassen (Manning et al., 2008). Dabei erfolgt jedoch keine ‚echte' Interpretation, die die impliziten Aussagen des Textes erfassen und damit die Ableitung neuen Wissens erm{\"o}glichen k{\"o}nnte. Aufbauend auf der 2016 vorgestellten formalen Subtextanalyse (Klimczak, 2016) erscheint aber ein algorithmisiertes Verfahren zur Rekonstruktion von komplexen Semantiken narrativer Gebrauchstexte m{\"o}glich, welches die bestehenden Verfahren sowohl der Computerphilologie als auch der Computerlinguistik qualitativ {\"u}bertreffen k{\"o}nnte, indem es hermeneutische Zug{\"a}nge f{\"u}r informationstechnische Forschung erschließt.}, language = {de} } @misc{LoefflerLiuHofstedt, author = {L{\"o}ffler, Sven and Liu, Ke and Hofstedt, Petra}, title = {The Regularization of CSPs for Rostering, Planning and Resource Management Problems}, series = {Artificial Intelligence Applications and Innovations - 14th IFIP WG 12.5 International Conference, AIAI 2018, Rhodes, Greece}, journal = {Artificial Intelligence Applications and Innovations - 14th IFIP WG 12.5 International Conference, AIAI 2018, Rhodes, Greece}, editor = {Iliadis, Lazaros S. and Maglogiannis, Ilias and Plagianakos, Vassilis P.}, publisher = {Springer}, address = {Cham}, isbn = {978-3-319-92006-1}, doi = {10.1007/978-3-319-92007-8_18}, pages = {209 -- 218}, language = {en} } @misc{LiuLoefflerHofstedt, author = {Liu, Ke and L{\"o}ffler, Sven and Hofstedt, Petra}, title = {Solving the Traveling Tournament Problem with Predefined Vanues by Parallel Constraint Programming}, series = {Mining Intelligence and Knowledge Exploration - 6th International Conference, MIKE 2018, Cluj-Napoca, Romania, 2018}, journal = {Mining Intelligence and Knowledge Exploration - 6th International Conference, MIKE 2018, Cluj-Napoca, Romania, 2018}, editor = {Groza, Adrian and Prasath, Rajendra}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-030-05917-0}, doi = {10.1007/978-3-030-05918-7_7}, pages = {64 -- 79}, language = {en} } @misc{LiuLoefflerHofstedt, author = {Liu, Ke and L{\"o}ffler, Sven and Hofstedt, Petra}, title = {Hypertree Decomposition: The First Step towards Parallel Constraint Solving}, series = {Declarative Programming and Knowledge Management - DECLARE 2017, Unifying INAP, WFLP, and WLP, W{\"u}rzburg, Germany, Revised Selected Papers}, journal = {Declarative Programming and Knowledge Management - DECLARE 2017, Unifying INAP, WFLP, and WLP, W{\"u}rzburg, Germany, Revised Selected Papers}, editor = {Seipel, Dietmar and Hanus, Michael and Abreu, Salvador}, publisher = {Springer}, address = {Heidelberg [u.a.]}, isbn = {978-3-030-00800-0}, doi = {10.1007/978-3-030-00801-7_6}, pages = {81 -- 94}, language = {en} } @misc{BeckerLoefflerHofstedt, author = {Becker, Ilja and L{\"o}ffler, Sven and Hofstedt, Petra}, title = {Sharing Nogoods between Portfolio Instances in Choco Solver}, series = {20. Kolloquium Programmiersprachen und Grundlagen der Programmierung KPS 2019 : Tagungsband : Baiersbronn, 23.-25. September 2019}, journal = {20. Kolloquium Programmiersprachen und Grundlagen der Programmierung KPS 2019 : Tagungsband : Baiersbronn, 23.-25. September 2019}, editor = {Pl{\"u}micke, Martin and Alia, Fayez Abu}, publisher = {Shaker Verlag}, address = {D{\"u}ren}, isbn = {978-3-8440-6933-4}, pages = {31 -- 36}, language = {en} } @incollection{HofstedtHowerJohnetal., author = {Hofstedt, Petra and Hower, Walter and John, Ulrich and Wolf, Armin}, title = {MOC 2019 - 11. Workshop zur transparenten Modellierung und Optimierung komplexer Probleme}, series = {INFORMATIK 2019 - 50 Jahre Gesellschaft f{\"u}r Informatik - Informatik f{\"u}r Gesellschaft}, booktitle = {INFORMATIK 2019 - 50 Jahre Gesellschaft f{\"u}r Informatik - Informatik f{\"u}r Gesellschaft}, editor = {Draude, Claude and Lange, Martin and Sick, Bernhard}, publisher = {GI}, address = {Bonn}, isbn = {978-3-88579-689-3}, doi = {10.18420/inf2019_ws40}, pages = {1}, language = {de} } @techreport{OPUS4-24952, title = {Deklarative Ans{\"a}tze zur K{\"u}nstlichen Intelligenz, W(C)LP 2018, Post-Proceedings}, editor = {John, Ulrich and Hofstedt, Petra and Wolf, Armin}, publisher = {Hochschule f{\"u}r Wirtschaft, Technik und Kultur (htwk)}, address = {Berlin}, pages = {81}, language = {de} } @misc{LoefflerLiuHofstedt, author = {L{\"o}ffler, Sven and Liu, Ke and Hofstedt, Petra}, title = {Detecting Higly Overlapping Parts in Constraint Satisfaction Problems for Speed-Up}, series = {Deklarative Ans{\"a}tze zur K{\"u}nstlichen Intelligenz - punktuelle Beitr{\"a}ge - Post-Proceedings des 32. Workshops f{\"u}r (Constraint) Logische Programmierung}, journal = {Deklarative Ans{\"a}tze zur K{\"u}nstlichen Intelligenz - punktuelle Beitr{\"a}ge - Post-Proceedings des 32. Workshops f{\"u}r (Constraint) Logische Programmierung}, editor = {John, Ulrich and Hofstedt, Petra and Wolf, Armin}, publisher = {Hochschule f{\"u}r Wirtschaft, Technik und Kultur (htwk)}, address = {Berlin}, pages = {19 -- 24}, language = {en} } @misc{LoefflerLiuHofstedt, author = {L{\"o}ffler, Sven and Liu, Ke and Hofstedt, Petra}, title = {Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems}, series = {Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019}, journal = {Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019}, editor = {Rocha, Ana Paula and Steels, Luc and Herik, Jaap van den}, publisher = {SciTePress}, isbn = {978-989-758-350-6}, doi = {10.5220/0007455907550761}, pages = {755 -- 761}, abstract = {This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original CSP. Therefore, our decomposition approach has two goals: 1. to evenly balance the workload distribution over all cores and solve the partial CSPs as fast as possible and 2. to minimize the number of shared variables to make the join process of the solutions as fast as possible.}, language = {en} } @misc{LoefflerLiuHofstedt, author = {L{\"o}ffler, Sven and Liu, Ke and Hofstedt, Petra}, title = {A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems}, series = {Proceedings of the 11th International Conference on Agents and Artificial Intelligence}, journal = {Proceedings of the 11th International Conference on Agents and Artificial Intelligence}, editor = {Rocha, Ana Paula and Steels, Luc and Herik, Jaap van den}, publisher = {SciTePress}, isbn = {978-989-758-350-6}, doi = {10.5220/0007260204350442}, pages = {435 -- 442}, abstract = {This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and concatenation of their underlying deterministic finite automatons (DFAs). This, eventually, often allows to significantly speed-up the solution process of the original rCSP.}, language = {en} }