Theory Working Group
/groups/theory/search/index.rss?tag=hotlist/groups/theory/search/?tag=hotWhat’s HotHotListHot!?tag=hot0/groups/theory/sidebar/HotListNo items tagged with hot.hot/groups/theory/search/index.rss?sort=modifiedDate&kind=all&sortDirection=reverse&excludePages=wiki/welcomelist/groups/theory/search/?sort=modifiedDate&kind=all&sortDirection=reverse&excludePages=wiki/welcomeRecent ChangesRecentChangesListUpdates?sort=modifiedDate&kind=all&sortDirection=reverse&excludePages=wiki/welcome0/groups/theory/sidebar/RecentChangesListmodifiedDateallRecent ChangesRecentChangesListUpdateswiki/welcomeNo recent changes.reverse5searchlist/groups/theory/calendar/Upcoming EventsUpcomingEventsListEvents1Getting events…
Address
University of Applied Sciences Bonn-Rhein-Sieg,
FB 02 Computer Science,
Grantham-Allee 20,
53737 St Augustin
Germany
FAQ & News
- Sprechstunden/Contact hours: see below.
- Student FAQ (German) / extra-curricular exam dates / grants.
- Leistungsnachweise / How (not) to write a thesis
- News / offered theses (Bachelor- und Masterarbeiten) / mini projects
- check my blog.
Mails requesting information that is also available through this web page will not be answered.
Contact
office: C.277 phone: +49 2241 865 259
lab: A.035 phone: +49 2241 865 250
Sprechstunden/Office hours summer 2013: Thursday, 14:00h-16:30h
social networks and web2.0: dictionary of virtual reality.
Personal information
- Curriculum Vitae:
- Statements of Research and Teaching:
Research
- relational methods in computer science, relational and logic machine learning
- computational learning theory, rough set data analysis and ILP
- theorem proving, model checking
Projects
- RelaFix: A relation algebra calculator for finite domain
- PACME: Asynchronuos Complex Module Systems (see also: PACME)
- HFSP VerIT: Specification and Verification of distributed, embedded systems
Publications
A full list is in my CV.
book- Relational Knowledge Discovery. Cambridge University Press. 2012. (Errata)
- book chapter
- Learning Adaptive Behaviour. In: Chen, Magoulas, Adaptable and Adaptive Hypermedia Systems. Chapter 7, 104-124. Idea Group, 2005.
- journals
- Learning From Noise. Short Anecdote in Spec.Issue "What Went Wrong And Why", AI Magazine, 29(2), AAAI, 2008.
- Being aware: Where we think the Action is. Cognition, Technology, and Work, 9(2). Springer, 2007.
- Can User Models be Learned at All? Knowledge Engineering Review. Vol 19 (1), 2004.
- conferences
- Semantic Road Network Models for Rapid 3D Traffic Scenario Generation. With Tobias Haubrich, Sven Seel, Rainer Herpers, Peter Becker. ASIM Traffic Simulation Workshop, 2013.
- TSF-Slider: Combining Time- and Structure-Based Media Navigation in one Navigation Component. Demo Program of the 2011 IEEE International Symposium of Multimedia, IEEE, 2011. (Online IEEEXplore). ***
- Modalities, Relations, and Learning. Proc. RelMiCS 11, Springer, 2009.
- Relational Cognitive Structures For Intelligent And Robot Control. Proc. IEEE SMC 2008. *
- Why Some Emotional States Are Easier to be Recognized Than Others. Proc. IEEE SMC 2006.
- other
- ATPPortal: A User-friendly Web-based Interface for Automated Theorem Provers and for Automatically Generated Proofs, Univ. Augsburg Tech Report, Inst. Comp Sci, No 2010-10, 2010. **
**) with P. Höfner and S. Zeissler
***) with S. Pospiech, R. Mertens and M. Ketterl
Teaching
For detailed course information, please follow links or log in at LEA
- Lecture: Theory of Computer Science / Theoretische Informatik (German) [LEA]
- Lecture: Knowledge Discovery (aka Intelligent Systems II or Learning and Induction) [LEA]
- Seminar: Foundations of Informatics (Advanced Topics) [W12] [S13]
- Seminar (Augsburg): "Seminar über theoretische Informatik: Erweiterungen und Induktion logischer Programme" [>>]
- Lecture: Logics, Model Theory, Proof Theory (aka Intelligent Systems I or Logic and Deduction) [LEA]
- Lecture: Discrete Structures
- Lecture: Functional and Logic Programming [LEA]
Looking for a BSc/MSc-Thesis? Check the blog for the tags "bsc", "msc" or "thesis"!
_This_is_no_QR_Code++!+&
[>+_++[>+++[>+^++<-]<-]<
-]<++[>+??+[>++[>++[>++<
-]<-]<-]<-]>>>>++++++.>>
+++[>+++[>+++[>+++<-^<-]
<-]<++[>++![>++[>++[>++<
-]<-]<-]<-]>>>>+++.>+++[
>+++[>+++[>+!+!+<-]<-]<-
]>>++++[>++++<-]>+++++./
Comments