@unpublished{Arnold2009,
  author    = {Arnold, Holger},
  title     = {A linearized DPLL calculus with clause learning (2nd, revised version)},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29080},
  year      = {2009},
  abstract  = {Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.},
  language  = {en}
}
@masterthesis{Repp2023,
  type      = {Bachelor Thesis},
  author    = {Repp, Leo},
  title     = {Extending the automatic theorem prover nanoCoP with arithmetic procedures},
  doi       = {10.25932/publishup-57619},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-576195},
  school      = {Universit{\"a}t Potsdam},
  pages     = {52},
  year      = {2023},
  abstract  = {In dieser Bachelorarbeit implementiere ich den automatischen Theorembeweiser nanoCoP-Ω. Es handelt sich bei diesem neuen System um das Ergebnis einer Portierung von Arithmetik-behandelnden Prozeduren aus dem automatischen Theorembeweiser mit Arithmetik leanCoP-Ω in das System nanoCoP 2.0. Dazu wird zuerst der mathematische Hintergrund zu automatischen Theorembeweisern und Arithmetik gegeben. Ich stelle die Vorg{\"a}ngerprojekte leanCoP, nanoCoP und leanCoP-Ω vor, auf dessen Vorlage nanoCoP-Ω entwickelt wurde. Es folgt eine ausf{\"u}hrliche Erkl{\"a}rung der Konzepte, um welche der nicht-klausale Konnektionskalk{\"u}l erweitert werden muss, um eine Behandlung von arithmetischen Ausdr{\"u}cken und Gleichheiten in den Kalk{\"u}l zu integrieren, sowie eine Beschreibung der Implementierung dieser Konzepte in nanoCoP-Ω. Als letztes folgt eine experimentelle Evaluation von nanoCoP-Ω. Es wurde ein ausf{\"u}hrlicher Vergleich von Laufzeit und Anzahl gel{\"o}ster Probleme im Vergleich zum {\"a}hnlich aufgebauten Theorembeweiser leanCoP-Ω auf Basis der TPTP-Benchmark durchgef{\"u}hrt. Ich komme zu dem Ergebnis, dass nanoCoP-Ω deutlich schneller ist als leanCoP-Ω ist, jedoch weniger gut geeignet f{\"u}r gr{\"o}ßere Probleme. Zudem konnte ich feststellen, dass nanoCoP-Ω falsche Beweise liefern kann. Ich bespreche, wie dieses Problem gel{\"o}st werden kann, sowie einige m{\"o}gliche Optimierungen und Erweiterungen des Beweissystems.},
  language  = {en}
}
@phdthesis{Dramlitsch2002,
  author    = {Dramlitsch, Thomas},
  title     = {Distributed computations in a dynamic, heterogeneous Grid environment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0000759},
  school      = {Universit{\"a}t Potsdam},
  year      = {2002},
  abstract  = {Die immer dichtere und schnellere Vernetzung von Rechnern und Rechenzentren {\"u}ber Hochgeschwindigkeitsnetzwerke erm{\"o}glicht eine neue Art des wissenschaftlich verteilten Rechnens, bei der geographisch weit auseinanderliegende Rechenkapazit{\"a}ten zu einer Gesamtheit zusammengefasst werden k{\"o}nnen. Dieser so entstehende virtuelle Superrechner, der selbst aus mehreren Grossrechnern besteht, kann dazu genutzt werden Probleme zu berechnen, f{\"u}r die die einzelnen Grossrechner zu klein sind. Die Probleme, die numerisch mit heutigen Rechenkapazit{\"a}ten nicht l{\"o}sbar sind, erstrecken sich durch s{\"a}mtliche Gebiete der heutigen Wissenschaft, angefangen von Astrophysik, Molek{\"u}lphysik, Bioinformatik, Meteorologie, bis hin zur Zahlentheorie und Fluiddynamik um nur einige Gebiete zu nennen. Je nach Art der Problemstellung und des L{\"o}sungsverfahrens gestalten sich solche "Meta-Berechnungen" mehr oder weniger schwierig. Allgemein kann man sagen, dass solche Berechnungen um so schwerer und auch um so uneffizienter werden, je mehr Kommunikation zwischen den einzelnen Prozessen (oder Prozessoren) herrscht. Dies ist dadurch begr{\"u}ndet, dass die Bandbreiten bzw. Latenzzeiten zwischen zwei Prozessoren auf demselben Grossrechner oder Cluster um zwei bis vier Gr{\"o}ssenordnungen h{\"o}her bzw. niedriger liegen als zwischen Prozessoren, welche hunderte von Kilometern entfernt liegen. Dennoch bricht nunmehr eine Zeit an, in der es m{\"o}glich ist Berechnungen auf solch virtuellen Supercomputern auch mit kommunikationsintensiven Programmen durchzuf{\"u}hren. Eine grosse Klasse von kommunikations- und berechnungsintensiven Programmen ist diejenige, die die L{\"o}sung von Differentialgleichungen mithilfe von finiten Differenzen zum Inhalt hat. Gerade diese Klasse von Programmen und deren Betrieb in einem virtuellen Superrechner wird in dieser vorliegenden Dissertation behandelt. Methoden zur effizienteren Durchf{\"u}hrung von solch verteilten Berechnungen werden entwickelt, analysiert und implementiert. Der Schwerpunkt liegt darin vorhandene, klassische Parallelisierungsalgorithmen zu analysieren und so zu erweitern, dass sie vorhandene Informationen (z.B. verf{\"u}gbar durch das Globus Toolkit) {\"u}ber Maschinen und Netzwerke zur effizienteren Parallelisierung nutzen. Soweit wir wissen werden solche Zusatzinformationen kaum in relevanten Programmen genutzt, da der Grossteil aller Parallelisierungsalgorithmen implizit f{\"u}r die Ausf{\"u}hrung auf Grossrechnern oder Clustern entwickelt wurde.},
  language  = {en}
}
@phdthesis{Lanfermann2002,
  author    = {Lanfermann, Gerd},
  title     = {Nomadic migration : a service environment for autonomic computing on the Grid},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0000773},
  school      = {Universit{\"a}t Potsdam},
  year      = {2002},
  abstract  = {In den vergangenen Jahren ist es zu einer dramatischen Vervielfachung der verf{\"u}gbaren Rechenzeit gekommen. Diese 'Grid Ressourcen' stehen jedoch nicht als kontinuierlicher Strom zur Verf{\"u}gung, sondern sind {\"u}ber verschiedene Maschinentypen, Plattformen und Betriebssysteme verteilt, die jeweils durch Netzwerke mit fluktuierender Bandbreite verbunden sind. Es wird f{\"u}r Wissenschaftler zunehmend schwieriger, die verf{\"u}gbaren Ressourcen f{\"u}r ihre Anwendungen zu nutzen. Wir glauben, dass intelligente, selbstbestimmende Applikationen in der Lage sein sollten, ihre Ressourcen in einer dynamischen und heterogenen Umgebung selbst zu w{\"a}hlen: Migrierende Applikationen suchen eine neue Ressource, wenn die alte aufgebraucht ist. 'Spawning'-Anwendungen lassen Algorithmen auf externen Maschinen laufen, um die Hauptanwendung zu beschleunigen. Applikationen werden neu gestartet, sobald ein Absturz endeckt wird. Alle diese Verfahren k{\"o}nnen ohne menschliche Interaktion erfolgen. Eine verteilte Rechenumgebung besitzt eine nat{\"u}rliche Unverl{\"a}sslichkeit. Jede Applikation, die mit einer solchen Umgebung interagiert, muss auf die gest{\"o}rten Komponenten reagieren k{\"o}nnen: schlechte Netzwerkverbindung, abst{\"u}rzende Maschinen, fehlerhafte Software. Wir konstruieren eine verl{\"a}ssliche Serviceinfrastruktur, indem wir der Serviceumgebung eine 'Peer-to-Peer'-Topology aufpr{\"a}gen. Diese "Grid Peer Service" Infrastruktur beinhaltet Services wie Migration und Spawning, als auch Services zum Starten von Applikationen, zur Datei{\"u}bertragung und Auswahl von Rechenressourcen. Sie benutzt existierende Gridtechnologie wo immer m{\"o}glich, um ihre Aufgabe durchzuf{\"u}hren. Ein Applikations-Information- Server arbeitet als generische Registratur f{\"u}r alle Teilnehmer in der Serviceumgebung. Die Serviceumgebung, die wir entwickelt haben, erlaubt es Applikationen z.B. eine Relokationsanfrage an einen Migrationsserver zu stellen. Der Server sucht einen neuen Computer, basierend auf den {\"u}bermittelten Ressourcen-Anforderungen. Er transferiert den Statusfile des Applikation zu der neuen Maschine und startet die Applikation neu. Obwohl das umgebende Ressourcensubstrat nicht kontinuierlich ist, k{\"o}nnen wir kontinuierliche Berechnungen auf Grids ausf{\"u}hren, indem wir die Applikation migrieren. Wir zeigen mit realistischen Beispielen, wie sich z.B. ein traditionelles Genom-Analyse-Programm leicht modifizieren l{\"a}sst, um selbstbestimmte Migrationen in dieser Serviceumgebung durchzuf{\"u}hren.},
  subject      = {Peer-to-Peer-Netz ; GRID computing ; Zuverl{\"a}ssigkeit ; Web Services ; Betriebsmittelverwaltung ; Migration},
  language  = {en}
}
@phdthesis{Fudickar2014,
  author    = {Fudickar, Sebastian},
  title     = {Sub Ghz transceiver for indoor localisation of smartphones},
  school      = {Universit{\"a}t Potsdam},
  pages     = {IV, 167},
  year      = {2014},
  language  = {en}
}
@phdthesis{Schindler2016,
  author    = {Schindler, Sven},
  title     = {Honeypot Architectures for IPv6 Networks},
  school      = {Universit{\"a}t Potsdam},
  pages     = {164},
  year      = {2016},
  language  = {en}
}
@phdthesis{Jung2015,
  author    = {Jung, J{\"o}rg},
  title     = {Efficient credit based server load balancing},
  school      = {Universit{\"a}t Potsdam},
  pages     = {353},
  year      = {2015},
  language  = {en}
}
@inproceedings{OPUS4-3955,
  title     = {Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009},
  editor    = {Geske, Ulrich and Wolf, Armin},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-026-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-37977},
  pages     = {187},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. The 23rd WLP was held in Potsdam at September 15 - 16, 2009. The topics of the presentations of WLP2009 were grouped into the major areas: Databases, Answer Set Programming, Theory and Practice of Logic Programming as well as Constraints and Constraint Handling Rules.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@article{LagriffoulAndres2016,
  author    = {Lagriffoul, Fabien and Andres, Benjamin},
  title     = {Combining task and motion planning},
  series = {The international journal of robotics research},
  volume    = {35},
  journal   = {The international journal of robotics research},
  number    = {8},
  publisher = {Sage Science Press},
  address   = {Thousand Oaks},
  issn      = {1741-3176},
  doi       = {10.1177/0278364915619022},
  pages     = {890 -- 927},
  year      = {2016},
  abstract  = {Solving problems combining task and motion planning requires searching across a symbolic search space and a geometric search space. Because of the semantic gap between symbolic and geometric representations, symbolic sequences of actions are not guaranteed to be geometrically feasible. This compels us to search in the combined search space, in which frequent backtracks between symbolic and geometric levels make the search inefficient.We address this problem by guiding symbolic search with rich information extracted from the geometric level through culprit detection mechanisms.},
  language  = {en}
}
@phdthesis{Smirnov2011,
  author    = {Smirnov, Sergey},
  title     = {Business process model abstraction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60258},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Business process models are used within a range of organizational initiatives, where every stakeholder has a unique perspective on a process and demands the respective model. As a consequence, multiple process models capturing the very same business process coexist. Keeping such models in sync is a challenge within an ever changing business environment: once a process is changed, all its models have to be updated. Due to a large number of models and their complex relations, model maintenance becomes error-prone and expensive. Against this background, business process model abstraction emerged as an operation reducing the number of stored process models and facilitating model management. Business process model abstraction is an operation preserving essential process properties and leaving out insignificant details in order to retain information relevant for a particular purpose. Process model abstraction has been addressed by several researchers. The focus of their studies has been on particular use cases and model transformations supporting these use cases. This thesis systematically approaches the problem of business process model abstraction shaping the outcome into a framework. We investigate the current industry demand in abstraction summarizing it in a catalog of business process model abstraction use cases. The thesis focuses on one prominent use case where the user demands a model with coarse-grained activities and overall process ordering constraints. We develop model transformations that support this use case starting with the transformations based on process model structure analysis. Further, abstraction methods considering the semantics of process model elements are investigated. First, we suggest how semantically related activities can be discovered in process models-a barely researched challenge. The thesis validates the designed abstraction methods against sets of industrial process models and discusses the method implementation aspects. Second, we develop a novel model transformation, which combined with the related activity discovery allows flexible non-hierarchical abstraction. In this way this thesis advocates novel model transformations that facilitate business process model management and provides the foundations for innovative tool support.},
  language  = {en}
}
@phdthesis{Mahr2012,
  author    = {Mahr, Philipp},
  title     = {Resource efficient communication in network-based reconfigurable on-chip systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-59914},
  school      = {Universit{\"a}t Potsdam},
  year      = {2012},
  abstract  = {The constantly growing capacity of reconfigurable devices allows simultaneous execution of complex applications on those devices. The mere diversity of applications deems it impossible to design an interconnection network matching the requirements of every possible application perfectly, leading to suboptimal performance in many cases. However, the architecture of the interconnection network is not the only aspect affecting performance of communication. The resource manager places applications on the device and therefore influences latency between communicating partners and overall network load. Communication protocols affect performance by introducing data and processing overhead putting higher load on the network and increasing resource demand. Approaching communication holistically not only considers the architecture of the interconnect, but communication-aware resource management, communication protocols and resource usage just as well. Incorporation of different parts of a reconfigurable system during design- and runtime and optimizing them with respect to communication demand results in more resource efficient communication. Extensive evaluation shows enhanced performance and flexibility, if communication on reconfigurable devices is regarded in a holistic fashion.},
  language  = {en}
}
@phdthesis{Gebser2011,
  author    = {Gebser, Martin},
  title     = {Proof theory and algorithms for answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55425},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems. ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving. We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns. The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them. We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found. Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.},
  language  = {en}
}
@phdthesis{Albrecht2013,
  author    = {Albrecht, Alexander},
  title     = {Understanding and managing extract-transform-load systems},
  pages     = {107},
  year      = {2013},
  language  = {en}
}
@phdthesis{Kaufmann2015,
  author    = {Kaufmann, Benjamin},
  title     = {High performance answer set solving},
  pages     = {182},
  year      = {2015},
  language  = {en}
}
@article{LewinMcNicol2015,
  author    = {Lewin, Cathy and McNicol, Sarah},
  title     = {Supporting the Development of 21st Century Skills through ICT},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82672},
  pages     = {181 -- 198},
  year      = {2015},
  abstract  = {The growing impact of globalisation and the development of a 'knowledge society' have led many to argue that 21st century skills are essential for life in twenty-first century society and that ICT is central to their development. This paper describes how 21st century skills, in particular digital literacy, critical thinking, creativity, communication and collaboration skills, have been conceptualised and embedded in the resources developed for teachers in iTEC, a four-year, European project. The effectiveness of this approach is considered in light of the data collected through the evaluation of the pilots, which considers both the potential benefits of using technology to support the development of 21st century skills, but also the challenges of doing so. Finally, the paper discusses the learning support systems required in order to transform pedagogies and embed 21st century skills. It is argued that support is required in standards and assessment; curriculum and instruction; professional development; and learning environments.},
  language  = {en}
}
@article{MagenheimNellesNeugebaueretal.2015,
  author    = {Magenheim, Johannes and Nelles, Wolfgang and Neugebauer, Jonas and Ohrndorf, Laura and Schaper, Niclas and Schubert, Sigrid},
  title     = {Expert Rating of Competence Levels in Upper Secondary Computer Science Education},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82683},
  pages     = {199 -- 216},
  year      = {2015},
  abstract  = {In the project MoKoM, which is funded by the German Research Foundation (DFG) from 2008 to 2012, a test instrument measuring students' competences in computer science was developed. This paper presents the results of an expert rating of the levels of students' competences done for the items of the instrument. At first we will describe the difficulty-relevant features that were used for the evaluation. These were deduced from computer science, psychological and didactical findings and resources. Potentials and desiderata of this research method are discussed further on. Finally we will present our conclusions on the results and give an outlook on further steps.},
  language  = {en}
}
@article{OpelKramerTrommenetal.2015,
  author    = {Opel, Simone and Kramer, Matthias and Trommen, Michael and Pottb{\"a}cker, Florian and Ilaghef, Youssef},
  title     = {BugHunt},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82693},
  pages     = {217 -- 233},
  year      = {2015},
  abstract  = {Competencies related to operating systems and computer security are usually taught systematically. In this paper we present a different approach, in which students have to remove virus-like behaviour on their respective computers, which has been induced by software developed for this purpose. They have to develop appropriate problem-solving strategies and thereby explore essential elements of the operating system. The approach was implemented exemplarily in two computer science courses at a regional general upper secondary school and showed great motivation and interest in the participating students.},
  language  = {en}
}
@article{PassigTzurielKedmi2015,
  author    = {Passig, David and Tzuriel, David and Kedmi, Ganit Eshel},
  title     = {Improving children's Cognitive Modifiability through Mediated Learning and Dynamic Assessment within 3D Immersive Virtual Reality Environment},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82705},
  pages     = {235 -- 252},
  year      = {2015},
  abstract  = {The objectives of this study were to examine (a) the effect of dynamic assessment (DA) in a 3D Immersive Virtual Reality (IVR) environment as compared with computerized 2D and noncomputerized (NC) situations on cognitive modifiability, and (b) the transfer effects of these conditions on more difficult problem solving administered two weeks later in a non-computerized environment. A sample of 117 children aged 6:6-9:0 years were randomly assigned into three experimental groups of DA conditions: 3D, 2D, and NC, and one control group (C). All groups received the pre- and post-teaching Analogies subtest of the Cognitive Modifiability Battery (CMB-AN). The experimental groups received a teaching phase in conditions similar to the pre-and post-teaching phases. The findings showed that cognitive modifiability, in a 3D IVR, was distinctively higher than in the two other experimental groups (2D computer group and NC group). It was also found that the 3D group showed significantly higher performance in transfer problems than the 2D and NC groups.},
  language  = {en}
}
@article{Saito2015,
  author    = {Saito, Toshinori},
  title     = {The Key Competencies in Informatics and ICT viewed from Nussbaum's Ten Central Capabilities},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82718},
  pages     = {253 -- 266},
  year      = {2015},
  abstract  = {This article shows a discussion about the key competencies in informatics and ICT viewed from a philosophical foundation presented by Martha Nussbaum, which is known as 'ten central capabilities'. Firstly, the outline of 'The Capability Approach', which has been presented by Amartya Sen and Nussbaum as a theoretical framework of assessing the state of social welfare, will be explained. Secondly, the body of Nussbaum's ten central capabilities and the reason for being applied as the basis of discussion will be shown. Thirdly, the relationship between the concept of 'capability' and 'competency' is to be discussed. After that, the author's assumption of the key competencies in informatics and ICT led from the examination of Nussbaum's ten capabilities will be presented.},
  language  = {en}
}