Institut für Informatik und Computational Science
Refine
Year of publication
- 2018 (42) (remove)
Document Type
- Article (21)
- Other (13)
- Doctoral Thesis (3)
- Part of a Book (2)
- Conference Proceeding (2)
- Postprint (1)
Keywords
- E-Learning (3)
- TPACK (2)
- argument mining (2)
- parsing (2)
- physical computing (2)
- 2-tag system (1)
- ARCS Modell (1)
- ASP (Answer Set Programming) (1)
- Adaptivität (1)
- Answer set programming (1)
- Antwortmengenprogrammierung (1)
- Apps (1)
- Argumentation structure (1)
- Audience Response Systeme (1)
- Autismus (1)
- Automatic Item Generation (1)
- Berliner Modell (1)
- Blended Learning (1)
- Blind users (1)
- Business process intelligence (1)
- CASP (Constraint Answer Set Programming) (1)
- Clock tree (1)
- Computergestützes Training (1)
- Computing with DNA (1)
- Constraint satisfaction (1)
- Course timetabling (1)
- Declare (1)
- Didaktik (1)
- Digital Game Based Learning (1)
- Digitale Medien (1)
- Edge Computing (1)
- Educational timetabling (1)
- Entwurfsprinzipien (1)
- Event mapping (1)
- Game-based learning (1)
- Gesture input (1)
- Hochschul-Apps (1)
- Hochschul-Cloud (1)
- Hochschullehre (1)
- Imperative calculi (1)
- Interaktivität (1)
- Internet of Things (1)
- Key input (1)
- Kompetenzerwerb (1)
- LMS (1)
- Lehrer*innenbildung (1)
- Lern-App (1)
- Lernaufgaben (1)
- Lernmotivation (1)
- M2M (1)
- MQTT (1)
- Minimal perturbation problems (1)
- Mobile Learning (1)
- Mobiles Lernen (1)
- Modeling (1)
- Multi-objective optimization (1)
- Natural language processing (1)
- Onlinelehre (1)
- OpenOLAT (1)
- Planar tactile display (1)
- Polarization (1)
- Process mining (1)
- SAMR (1)
- SMT (SAT Modulo Theories) (1)
- SaaSAbstract (1)
- Schulmaterial (1)
- Screen reader (1)
- Semantic Interoperability (1)
- Sharing (1)
- Single-event transient (SET) (1)
- Splicing (1)
- Splicing processor (1)
- Strategie (1)
- Turing machine (1)
- Type and effect systems (1)
- Unterrichtswerkzeuge (1)
- User Experience (1)
- Virtual reality (1)
- Weiterbildung (1)
- activities (1)
- answer set programming (1)
- argumentation structure (1)
- authentication (1)
- automated driving (1)
- automated guided vehicle routing (1)
- behavioral (1)
- car assembly operations (1)
- classroom material (1)
- computer science education (1)
- constraints (1)
- continuous (1)
- design principles (1)
- didaktische Rekonstruktion (1)
- didaktisches Konzept (1)
- digitale Bildung (1)
- digitale Medien (1)
- e-learning (1)
- educational reconstruction (1)
- eingebettete Systeme (1)
- embedded systems (1)
- gait (1)
- hybrid (1)
- hybrides Problemlösen (1)
- informatische Bildung im Sekundarbereich (1)
- joint lab (1)
- klinisch-praktischer Unterricht (1)
- locomotion (1)
- media (1)
- mobile Applikationen (1)
- mobiles Lernen (1)
- oneM2M Ontology (1)
- open learning (1)
- pdf forms (1)
- physical Computing (1)
- real-walking (1)
- reliability (1)
- resources (1)
- safety (1)
- secondary computer science education (1)
- security (1)
- smartphone (1)
- technische Rahmenbedingungen (1)
- tools (1)
- tools for teaching (1)
- verification (1)
- xAPI (1)
Institute
- Institut für Informatik und Computational Science (42) (remove)
Die 8. Fachtagung für Hochschuldidaktik der Informatik (HDI) fand im September 2018 zusammen mit der Deutschen E-Learning Fachtagung Informatik (DeLFI) unter dem gemeinsamen Motto „Digitalisierungswahnsinn? - Wege der Bildungstransformationen“ in Frankfurt statt.
Dabei widmet sich die HDI allen Fragen der informatischen Bildung im Hochschulbereich. Schwerpunkte bildeten in diesem Jahr u. a.:
- Analyse der Inhalte und anzustrebenden Kompetenzen in Informatikveranstaltungen
- Programmieren lernen & Einstieg in Softwareentwicklung
- Spezialthemen: Data Science, Theoretische Informatik und Wissenschaftliches Arbeiten
Die Fachtagung widmet sich ausgewählten Fragestellungen dieser Themenkomplexe, die durch Vorträge ausgewiesener Experten und durch eingereichte Beiträge intensiv behandelt werden.
Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capabilities. Although this has already resulted in various applications, certain aspects of such applications are more naturally modeled using variables over finite domains, for accounting for resources, fine timings, coordinates, or functions. Our goal is thus to extend ASP with constraints over integers while preserving its declarative nature. This allows for fast prototyping and elaboration tolerant problem descriptions of resource related applications. The resulting paradigm is called Constraint Answer Set Programming (CASP).
We present three different approaches for solving CASP problems. The first one, a lazy, modular approach combines an ASP solver with an external system for handling constraints. This approach has the advantage that two state of the art technologies work hand in hand to solve the problem, each concentrating on its part of the problem. The drawback is that inter-constraint dependencies cannot be communicated back to the ASP solver, impeding its learning algorithm. The second approach translates all constraints to ASP. Using the appropriate encoding techniques, this results in a very fast, monolithic system. Unfortunately, due to the large, explicit representation of constraints and variables, translation techniques are restricted to small and mid-sized domains. The third approach merges the lazy and the translational approach, combining the strength of both while removing their weaknesses. To this end, we enhance the dedicated learning techniques of an ASP solver with the inferences of the translating approach in a lazy way. That is, the important knowledge is only made explicit when needed.
By using state of the art techniques from neighboring fields, we provide ways to tackle real world, industrial size problems. By extending CASP to reactive solving, we open up new application areas such as online planning with continuous domains and durations.