@article{PrasseKnaebelMachlicaetal.2019,
  author    = {Prasse, Paul and Knaebel, Rene and Machlica, Lukas and Pevny, Tomas and Scheffer, Tobias},
  title     = {Joint detection of malicious domains and infected clients},
  series = {Machine learning},
  volume    = {108},
  journal   = {Machine learning},
  number    = {8-9},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0885-6125},
  doi       = {10.1007/s10994-019-05789-z},
  pages     = {1353 -- 1368},
  year      = {2019},
  abstract  = {Detection of malware-infected computers and detection of malicious web domains based on their encrypted HTTPS traffic are challenging problems, because only addresses, timestamps, and data volumes are observable. The detection problems are coupled, because infected clients tend to interact with malicious domains. Traffic data can be collected at a large scale, and antivirus tools can be used to identify infected clients in retrospect. Domains, by contrast, have to be labeled individually after forensic analysis. We explore transfer learning based on sluice networks; this allows the detection models to bootstrap each other. In a large-scale experimental study, we find that the model outperforms known reference models and detects previously unknown malware, previously unknown malware families, and previously unknown malicious domains.},
  language  = {en}
}
@article{CabalarFandinnoSchaubetal.2019,
  author    = {Cabalar, Pedro and Fandinno, Jorge and Schaub, Torsten H. and Schellhorn, Sebastian},
  title     = {Gelfond-Zhang aggregates as propositional formulas},
  series = {Artificial intelligence},
  volume    = {274},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2018.10.007},
  pages     = {26 -- 43},
  year      = {2019},
  abstract  = {Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made. In this paper, we show that any ASP aggregate interpreted under Gelfond and Zhang's (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are represented as formulas, we establish a formal comparison (in terms of the logic of Here-and-There) to Ferraris' (F) aggregates, which are defined by a different formula translation involving nested implications. In particular, we prove that if we replace an F-aggregate by a GZ-aggregate in a rule head, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterize a class of aggregates for which GZ- and F-semantics coincide.},
  language  = {en}
}
@article{AguadoCabalarFandinoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandi{\~n}o, Jorge and Pearce, David and Perez, Gilberto and Vidal-Peracho, Concepcion},
  title     = {Revisiting Explicit Negation in Answer Set Programming},
  series = {Theory and practice of logic programming},
  volume    = {19},
  journal   = {Theory and practice of logic programming},
  number    = {5-6},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068419000267},
  pages     = {908 -- 924},
  year      = {2019},
  language  = {en}
}
@article{LaskovGehlKruegeretal.2006,
  author    = {Laskov, Pavel and Gehl, Christian and Kr{\"u}ger, Stefan and M{\"u}ller, Klaus-Robert},
  title     = {Incremental support vector learning: analysis, implementation and applications},
  series = {Journal of machine learning research},
  volume    = {7},
  journal   = {Journal of machine learning research},
  publisher = {MIT Press},
  address   = {Cambridge, Mass.},
  issn      = {1532-4435},
  pages     = {1909 -- 1936},
  year      = {2006},
  abstract  = {Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen.},
  language  = {en}
}
@article{SteuerHumburgSelbig2006,
  author    = {Steuer, Ralf and Humburg, Peter and Selbig, Joachim},
  title     = {Validation and functional annotation of expression-based clusters based on gene ontology},
  series = {BMC bioinformatics},
  volume    = {7},
  journal   = {BMC bioinformatics},
  number    = {380},
  publisher = {BioMed Central},
  address   = {London},
  issn      = {1471-2105},
  doi       = {10.1186/1471-2105-7-380},
  pages     = {12},
  year      = {2006},
  abstract  = {Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files.},
  language  = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
  author    = {Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A compiler for nested logic programming},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On Acyclic and head-cycle free nested logic programs},
  isbn      = {3-540-22671-01},
  year      = {2004},
  language  = {en}
}
@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On acyclic and head-cycle free nested logic programs},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {On Computing belief change operations using quantifield boolean formulas},
  issn      = {0955-792X},
  year      = {2004},
  abstract  = {In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {On computing solutions to belief change scenarios},
  isbn      = {3-540- 42464-4},
  year      = {2001},
  language  = {en}
}
@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs},
  isbn      = {3-540-43930-7},
  year      = {2002},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2002,
  author    = {Besnard, Philippe and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report},
  year      = {2002},
  language  = {en}
}
@article{SchaubWoltran2018,
  author    = {Schaub, Torsten H. and Woltran, Stefan},
  title     = {Answer set programming unleashed!},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0550-z},
  pages     = {105 -- 108},
  year      = {2018},
  abstract  = {Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92-103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem's specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP's modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53-68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2003,
  author    = {Besnard, Philippe and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2013,
  author    = {Delgrande, James and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A model-theoretic approach to belief change in answer set programming},
  series = {ACM transactions on computational logic},
  volume    = {14},
  journal   = {ACM transactions on computational logic},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1529-3785},
  doi       = {10.1145/2480759.2480766},
  pages     = {46},
  year      = {2013},
  abstract  = {We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs. We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision. We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets. Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Debugging ASP programs by means of ASP},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{HaferLudwigSchumann2010,
  author    = {Hafer, J{\"o}rg and Ludwig, Joachim and Schumann, Marlen},
  title     = {Fallstudien in medialen R{\"a}umen},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64431},
  pages     = {93 -- 98},
  year      = {2010},
  abstract  = {Ziel dieses Beitrages ist es, das didaktische Konzept Fallstudien und seine lerntheoretisch-didaktische Begr{\"u}ndung vorzustellen. Es wird die These begr{\"u}ndet, dass mediale R{\"a}ume f{\"u}r die Bearbeitung von Fallstudien lernunterst{\"u}tzend wirken und sich in besonderer Weise f{\"u}r Prozesse der Lernberatung und Lernbegleitung in der Hochschule eignen. Diese These wird entlang dem lerntheoretischen Konzept der Bedeutungsr{\"a}ume von Studierenden in Verbindung mit den Spezifika medialer R{\"a}ume entfaltet. F{\"u}r den daraus entstandenen E-Learning-Ansatz Online-Fallstudien kann hier lediglich ein Ausblick gegeben werden.},
  language  = {de}
}
@article{BordihnFernauHolzeretal.2006,
  author    = {Bordihn, Henning and Fernau, Henning and Holzer, Markus and Manca, Vincenzo and Martin-Vide, Carlos},
  title     = {Iterated sequential transducers as language generating devices},
  series = {Theoretical computer science},
  volume    = {369},
  journal   = {Theoretical computer science},
  number    = {1},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2006.07.059},
  pages     = {67 -- 81},
  year      = {2006},
  abstract  = {Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established.},
  language  = {en}
}
@article{StoffelKunzGerber1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang and Gerber, Stefan},
  title     = {And/Or reasoning graphs for determining prime implicants in multi-level combinational networks},
  year      = {1997},
  language  = {en}
}
@article{GerberGoessel1994,
  author    = {Gerber, Stefan and G{\"o}ssel, Michael},
  title     = {Detection of permanent faults of a floating point adder by pseudoduplication},
  year      = {1994},
  language  = {en}
}
@article{BaierDiCiccioMendlingetal.2018,
  author    = {Baier, Thomas and Di Ciccio, Claudio and Mendling, Jan and Weske, Mathias},
  title     = {Matching events and activities by integrating behavioral aspects and label analysis},
  series = {Software and systems modeling},
  volume    = {17},
  journal   = {Software and systems modeling},
  number    = {2},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1619-1366},
  doi       = {10.1007/s10270-017-0603-z},
  pages     = {573 -- 598},
  year      = {2018},
  abstract  = {Nowadays, business processes are increasingly supported by IT services that produce massive amounts of event data during the execution of a process. These event data can be used to analyze the process using process mining techniques to discover the real process, measure conformance to a given process model, or to enhance existing models with performance information. Mapping the produced events to activities of a given process model is essential for conformance checking, annotation and understanding of process mining results. In order to accomplish this mapping with low manual effort, we developed a semi-automatic approach that maps events to activities using insights from behavioral analysis and label analysis. The approach extracts Declare constraints from both the log and the model to build matching constraints to efficiently reduce the number of possible mappings. These mappings are further reduced using techniques from natural language processing, which allow for a matching based on labels and external knowledge sources. The evaluation with synthetic and real-life data demonstrates the effectiveness of the approach and its robustness toward non-conforming execution logs.},
  language  = {en}
}
@article{PrzybyllaRomeike2018,
  author    = {Przybylla, Mareen and Romeike, Ralf},
  title     = {Empowering learners with tools in CS education},
  series = {it - Information Technology},
  volume    = {60},
  journal   = {it - Information Technology},
  number    = {2},
  publisher = {De Gruyter},
  address   = {Berlin},
  issn      = {1611-2776},
  doi       = {10.1515/itit-2017-0032},
  pages     = {91 -- 101},
  year      = {2018},
  abstract  = {In computer science, computer systems are both, objects of investigation and tools that enable creative learning and design. Tools for learning have a long tradition in computer science education. Already in the late 1960s, Papert developed a concept which had an immense impact on the development of informal education in the following years: his theory of constructionism understands learning as a creative process of knowledge construction that is most effective when learners create something purposeful that they can try out, show around, discuss, analyse and receive praise for. By now, there are numerous learning and programming environments that are based on the constructionist ideas. Modern tools offer opportunities for students to learn in motivating ways and gain impressive results in programming games, animations, implementing 3D models or developing interactive objects. This article gives an overview of computer science education research related to tools and media to be used in educational settings. We analyse different types of tools with a special focus on the categorization and development of tools for student adequate physical computing activities in the classroom. Research around the development and evaluation of tools and learning resources in the domain of physical computing is illustrated with the example of "My Interactive Garden", a constructionist learning and programming environment. It is explained how the results from empirical studies are integrated in the continuous development of the learning material.},
  language  = {en}
}
@article{MoeringLeino2022,
  author    = {M{\"o}ring, Sebastian and Leino, Olli Tapio},
  title     = {Die neoliberale Bedingung von Computerspielen},
  series = {Kontrollmaschinen - zur Dispositivtheorie des Computerspiels},
  journal   = {Kontrollmaschinen - zur Dispositivtheorie des Computerspiels},
  publisher = {LiteraturWissenschaft.de},
  address   = {M{\"u}nster},
  isbn      = {978-3-643-14780-6},
  pages     = {41 -- 61},
  year      = {2022},
  language  = {de}
}
@article{LyTarkhanov2009,
  author    = {Ly, Ibrahim and Tarkhanov, Nikolai Nikolaevich},
  title     = {A variational approach to the Cauchy problem for nonlinear elliptic differential equations},
  issn      = {0928-0219},
  doi       = {10.1515/Jiip.2009.037},
  year      = {2009},
  abstract  = {We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution.},
  language  = {en}
}
@article{PrasseIversenLienhardetal.2022,
  author    = {Prasse, Paul and Iversen, Pascal and Lienhard, Matthias and Thedinga, Kristina and Herwig, Ralf and Scheffer, Tobias},
  title     = {Pre-Training on In Vitro and Fine-Tuning on Patient-Derived Data Improves Deep Neural Networks for Anti-Cancer Drug-Sensitivity Prediction},
  series = {MDPI},
  volume    = {14},
  journal   = {MDPI},
  edition   = {16},
  publisher = {MDPI},
  address   = {Basel, Schweiz},
  issn      = {2072-6694},
  doi       = {10.3390/cancers14163950},
  pages     = {1 -- 14},
  year      = {2022},
  abstract  = {Large-scale databases that report the inhibitory capacities of many combinations of candidate drug compounds and cultivated cancer cell lines have driven the development of preclinical drug-sensitivity models based on machine learning. However, cultivated cell lines have devolved from human cancer cells over years or even decades under selective pressure in culture conditions. Moreover, models that have been trained on in vitro data cannot account for interactions with other types of cells. Drug-response data that are based on patient-derived cell cultures, xenografts, and organoids, on the other hand, are not available in the quantities that are needed to train high-capacity machine-learning models. We found that pre-training deep neural network models of drug sensitivity on in vitro drug-sensitivity databases before fine-tuning the model parameters on patient-derived data improves the models' accuracy and improves the biological plausibility of the features, compared to training only on patient-derived data. From our experiments, we can conclude that pre-trained models outperform models that have been trained on the target domains in the vast majority of cases.},
  language  = {en}
}
@article{EverardoPerezOsorio2020,
  author    = {Everardo P{\´e}rez, Flavio Omar and Osorio, Mauricio},
  title     = {Towards an answer set programming methodology for constructing programs following a semi-automatic approach},
  series = {Electronic notes in theoretical computer science},
  volume    = {354},
  journal   = {Electronic notes in theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {1571-0661},
  doi       = {10.1016/j.entcs.2020.10.004},
  pages     = {29 -- 44},
  year      = {2020},
  abstract  = {Answer Set Programming (ASP) is a successful rule-based formalism for modeling and solving knowledge-intense combinatorial (optimization) problems. Despite its success in both academic and industry, open challenges like automatic source code optimization, and software engineering remains. This is because a problem encoded into an ASP might not have the desired solving performance compared to an equivalent representation. Motivated by these two challenges, this paper has three main contributions. First, we propose a developing process towards a methodology to implement ASP programs, being faithful to existing methods. Second, we present ASP encodings that serve as the basis from the developing process. Third, we demonstrate the use of ASP to reverse the standard solving process. That is, knowing answer sets in advance, and desired strong equivalent properties, "we" exhaustively reconstruct ASP programs if they exist. This paper was originally motivated by the search of propositional formulas (if they exist) that represent the semantics of a new aggregate operator. Particularly, a parity aggregate. This aggregate comes as an improvement from the already existing parity (xor) constraints from xorro, where lacks expressiveness, even though these constraints fit perfectly for reasoning modes like sampling or model counting. To this end, this extended version covers the fundaments from parity constraints as well as the xorro system. Hence, we delve a little more in the examples and the proposed methodology over parity constraints. Finally, we discuss our results by showing the only representation available, that satisfies different properties from the classical logic xor operator, which is also consistent with the semantics of parity constraints from xorro.},
  language  = {en}
}
@article{OcheretnijGoesselSogomonyanetal.2006,
  author    = {Ocheretnij, Vitalij and G{\"o}ssel, Michael and Sogomonyan, Egor S. and Marienfeld, Daniel},
  title     = {Modulo p=3 checking for a carry select adder},
  doi       = {10.1007/s10836-006-6260-8},
  year      = {2006},
  abstract  = {In this paper a self-checking carry select adder is proposed. The duplicated adder blocks which are inherent to a carry select adder without error detection are checked modulo 3. Compared to a carry select adder without error detection the delay of the MSB of the sum of the proposed adder does not increase. Compared to a self-checking duplicated carry select adder the area is reduced by 20\%. No restrictions are imposed on the design of the adder blocks},
  language  = {en}
}
@article{SinghSogomonyanGoesseletal.1999,
  author    = {Singh, Adit D. and Sogomonyan, Egor S. and G{\"o}ssel, Michael and Seuring, Markus},
  title     = {Testability evaluation of sequential designs incorporating the multi-mode scannable memory element},
  year      = {1999},
  language  = {en}
}
@article{DimitrievSaposhnikovSaposhnikovetal.1999,
  author    = {Dimitriev, Alexej and Saposhnikov, V. V. and Saposhnikov, Vl. V. and G{\"o}ssel, Michael},
  title     = {Concurrent checking of sequential circuits by alternating inputs},
  year      = {1999},
  language  = {en}
}
@article{OtscheretnijSaposhnikovSaposhnikovetal.1999,
  author    = {Otscheretnij, Vitalij and Saposhnikov, Vl. V. and Saposhnikov, V. V. and G{\"o}ssel, Michael},
  title     = {Fault-tolerant self-dual circuits},
  year      = {1999},
  language  = {en}
}
@article{SaposhnikovMoshaninSaposhnikovetal.1999,
  author    = {Saposhnikov, Vl. V. V. V. and Moshanin, Vl. and Saposhnikov, V. V. and G{\"o}ssel, Michael},
  title     = {Experimental results for self-dual multi-output combinational circuits},
  year      = {1999},
  language  = {en}
}
@article{SaposhnikovSaposhnikovGoesseletal.1999,
  author    = {Saposhnikov, V. V. and Saposhnikov, Vl. V. and G{\"o}ssel, Michael and Morosov, Andrej},
  title     = {A method of construction of combinational self-checking units with detection of all single faults},
  year      = {1999},
  language  = {en}
}
@article{GoesselDimitrievSaposhnikovetal.1999,
  author    = {G{\"o}ssel, Michael and Dimitriev, Alexej and Saposhnikov, V. V. and Saposhnikov, Vl. V.},
  title     = {Eine selbsttestende Struktur zur on-line Fehlererkennung in kombinatorischen Schaltungen},
  year      = {1999},
  language  = {de}
}
@article{SaposhnikovOcheretnijSaposhnikovetal.1999,
  author    = {Saposhnikov, Vl. V. and Ocheretnij, V. and Saposhnikov, V. V. and G{\"o}ssel, Michael},
  title     = {Modified TMR-system with reduced hardware overhead},
  year      = {1999},
  language  = {en}
}
@article{GoesselSogomonyan1999,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {New totally self-checking ripple and carry look-ahead adders},
  year      = {1999},
  language  = {en}
}
@article{SeuringGoesselSogomonyan1998,
  author    = {Seuring, Markus and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {Ein strukturelles Verfahren zur Kompaktierung von Schaltungsausgaben f{\"u}r online-Fehlererkennungen und Selbstests},
  year      = {1998},
  language  = {de}
}
@article{SaposhnikovMorosovSaposhnikovetal.1998,
  author    = {Saposhnikov, V. V. and Morosov, Andrej and Saposhnikov, Vl. V. and G{\"o}ssel, Michael},
  title     = {A new design method for self-checking unidirectional combinational circuits},
  year      = {1998},
  language  = {en}
}
@article{GoesselSogomonyanMorosov1999,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S. and Morosov, Andrej},
  title     = {A new totally error propagating compactor for arbitrary cores with digital interfaces},
  year      = {1999},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural approach for space compaction for sequential circuits},
  year      = {1999},
  language  = {en}
}
@article{MorosovGoesselHartje1999,
  author    = {Morosov, Andrej and G{\"o}ssel, Michael and Hartje, Hendrik},
  title     = {Reduced area overhead of the input party for code-disjoint circuits},
  year      = {1999},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural method for output compaction of sequential automata implemented as circuits},
  year      = {1999},
  language  = {en}
}
@article{GoesselSogomonyan1998,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {On-line Test auf der Grundlage eines die Parit{\"a}t erhaltenden Signaturanalysators},
  year      = {1998},
  language  = {de}
}
@article{MorosovSaposhnikovGoessel1998,
  author    = {Morosov, Andrej and Saposhnikov, V. V. and G{\"o}ssel, Michael},
  title     = {Self-Checking circuits with unidiectionally independent outputs},
  year      = {1998},
  language  = {en}
}
@article{HlawiczkaGoesselSogomonyan1997,
  author    = {Hlawiczka, A. and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A linear code-preserving signature analyzer COPMISR},
  isbn      = {0-8186-7810-0},
  year      = {1997},
  language  = {en}
}
@article{SaposhnikovOtscheretnijSaposhnikovetal.1998,
  author    = {Saposhnikov, Vl. V. and Otscheretnij, Vitalij and Saposhnikov, V. V. and G{\"o}ssel, Michael},
  title     = {Design of Fault-Tolerant Circuits by self-dual Duplication},
  year      = {1998},
  language  = {en}
}
@article{BogueGoesselJuergensenetal.1998,
  author    = {Bogue, Ted and G{\"o}ssel, Michael and J{\"u}rgensen, Helmut and Zorian, Yervant},
  title     = {Built-in self-Test with an alternating output},
  isbn      = {0-8186-8359-7},
  year      = {1998},
  language  = {en}
}
@article{OtscheretnijGoesselSaposhnikovetal.1998,
  author    = {Otscheretnij, Vitalij and G{\"o}ssel, Michael and Saposhnikov, Vl. V. and Saposhnikov, V. V.},
  title     = {Fault-tolerant self-dual circuits with error detection by parity- and group parity prediction},
  year      = {1998},
  language  = {en}
}