The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language...
详细信息
The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.
programming languages are often classified according to their paradigms, e.g. imperative, functional, logic, constraint-based, object-oriented, or aspect-oriented. A paradigm characterizes the style, concepts, and met...
ISBN:
(纸本)9783642268700
programming languages are often classified according to their paradigms, e.g. imperative, functional, logic, constraint-based, object-oriented, or aspect-oriented. A paradigm characterizes the style, concepts, and methods of the language for describing situations and processes and for solving problems, and each paradigm serves best for programming in particular application areas. Real-world problems, however, are often best implemented by a combination of concepts from different paradigms, because they comprise aspects from several realms, and this combination is more comfortably realized using multiparadigm programming languages. This book deals with the theory and practice of multiparadigm constraint programming languages. The author first elaborates on programming paradigms and languages, constraints, and the merging of programming concepts which yields multiparadigm (constraint) programming languages. In the second part the author inspects two concrete approaches on multiparadigm constraint programming the concurrent constraint functional language CCFL, which combines the functional and the constraint-based paradigms and allows the description of concurrent processes; and a general framework for multiparadigm constraint programming and its implementation, *** book is appropriate for researchers and graduate students in the areas of programming and artificial intelligence.
We present a method for the automated verification of temporal properties of infinite state systems. Our verification method is based on the specialization of constraint logic programs (CLP) and works in two phases: (...
详细信息
SQL Success is about problem-solving in SQL. It bridges the gap between dry and dull database theory books, and developer books that focus on giving recipes without explaining sufficiently the reasons behind the recip...
ISBN:
(纸本)9781909765009
SQL Success is about problem-solving in SQL. It bridges the gap between dry and dull database theory books, and developer books that focus on giving recipes without explaining sufficiently the reasons behind the recipes or discussing alternative *** developers struggle with SQL due to the contrast between the top-down logic of most programming languages and SQL's set-based approach. SQL Success aims to be different. This book is more than syntax examples. SQL Success explains how to use SQL to solve problems, and covers syntax in the process-not as the focus, but as a tool toward accomplishing the *** Success also shows something that most other books do not: the pitfalls and traps of SQL, a deceptively simple language, and how easy it is to get a query wrong. Written in a conversational way, SQL Success talks about logic more than theory, avoids jargon, and refers to common-sense more than rules. It ignores features that are rarely used and tries to avoid information *** intention of SQL Success is not to cover every aspect of all variants of SQL. The goal is to cover everything that is of practical use. That goal is informed by the author's many years of practical experience leading an understanding of what professional developers need to know, the common mistakes that are made, and how those mistakes can be *** on the practical implications of theory. Emphasizes accuracy and efficiency. Teaches how to "think SQL", not merely the *** to Oracle, SQL Server, MySQL, PostgreSQL, DB2, and *** for college-level database courses, SQL certification preparation, and professionals who want to take their database skills to the next *** by downloadable files and online database with practice exercises at *** resources for instructors.
Concurrent Constraint programming (ccp) is a well-established declarative framework from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied...
详细信息
We discuss extensions to a controlled natural language allowing spatiotemporal expressions to be interpreted as fuzzy logic functions. The extensions first required new sentence templates. Next, changes to a GPSG pars...
详细信息
We are proud to introduce this special issue of the Journal of theory and practice of logic programming (TPLP), dedicated to the full papers accepted for the 28th International Conference on logicprogramming (ICLP). ...
We are proud to introduce this special issue of the Journal of theory and practice of logic programming (TPLP), dedicated to the full papers accepted for the 28th International Conference on logicprogramming (ICLP). The ICLP meetings started in Marseille in 1982 and since then constitute the main venue for presenting and discussing work in the area of logicprogramming.
(ECLPSe)-P-i is a Prolog-based programming system, aimed at the development and deployment of constraint programming applications. It is also used for teaching most aspects of combinatorial problem solving, for exampl...
详细信息
(ECLPSe)-P-i is a Prolog-based programming system, aimed at the development and deployment of constraint programming applications. It is also used for teaching most aspects of combinatorial problem solving, for example, problem modelling, constraint programming, mathematical programming and search techniques. It uses an extended Prolog as its high-level modelling and control language, complemented by several constraint solver libraries, interfaces to third-party solvers, an integrated development environment and interfaces for embedding into host environments. This paper discusses language extensions, implementation aspects, components, and tools that we consider relevant on the way from logicprogramming to Constraint logicprogramming.
暂无评论