Abstract In 2007, the Second International Timetabling Competition (ITC-2007) has been
organized and a formal definition of the Curriculum-Based Course Timetabling (CB-CTT) …

In this paper we describe asprin, a general, flexible, and extensible framework for handling
preferences among the stable models of a logic program. We show how complex preference …

We consider the university course timetabling problem, which is one of the most studied
problems in educational timetabling. In particular, we focus our attention on the formulation …

Abstract Answer Set Programming (ASP) is an approach to declarative problem solving,
combining a rich yet simple modeling language with high performance solving capacities …

This paper contributes to the area of inductive logic programming by presenting a new
learning framework that allows the learning of weak constraints in Answer Set Programming …

Abstract Answer Set Programming (ASP) is a powerful declarative programming paradigm
that has been successfully applied to many different domains. Recently, ASP has also …

Recent developments in applying and extending Boolean satisfiability (SAT) based
techniques have resulted in new types of approaches to pseudo-Boolean optimization …

University examination scheduling is a difficult and heavily administrative task, particularly
when the number of students and courses is high. Changes in educational paradigms, an …

In der modernen Hochschullandschaft ist die effiziente Verwaltung von
Informationsbeständen ein zentrales Anliegen der Digitalisierung. In diesem Beitrag …

Many complex activities in production cycles, such as quality control or fault analysis, require
highly experienced specialists to perform various operations on (semi) finished products …