Logic programming with the stable model semantics is put forward as a novel constraint
programming paradigm. This paradigm is interesting because it bring advantages of logic …

A novel logic program like language, weight constraint rules, is developed for answer set
programming purposes. It generalizes normal logic programs by allowing weight constraints …

The idea of answer set programming is to represent a given computational problem by a
logic program whose answer sets correspond to solutions, and then use an answer set …

Component-based approaches to program synthesis assemble programs from a database
of existing components, such as methods provided by an API. In this paper, we present a …

Model checking is a prominent technique used in the hardware and software industries for
automatic verification. While it is very successful in finding subtle bugs in distributed …

We present an extension of language A-Prolog by consistency-restoring rules with
preferences, give the semantics of the new language, CR-Prolog, and show how the …

Darüber hinaus wurden alle Themenbereiche des Buches überarbeitet und aktualisiert. Für
alle Selbsttestaufgaben, deren Anzahl wir nochmals erhöht haben, stehen ausführliche …

This article studies an implementation methodology for partial and disjunctive stable models
where partiality and disjunctions are unfolded from a logic program so that an …

This paper is concerned with construction of some state space abstractions for Time Petri
nets. State class spaces were introduced long ago by Berthomieu and Menasche as finite …

T imes is a modelling and schedulability analysis tool for embedded real-time systems,
developed at Uppsala University in 2001. It is appropriate for systems that can be described …