We examine a class of infinite two-person games on finitely coloured graphs. The main aim
is to construct finite memory winning strategies for both players. This problem is motivated by …

Publisher Summary First-order modal logics are modal logics in which the underlying
propositional logic is replaced by a first-order predicate logic. They pose some of the most …

This book presents a systematic treatment of deductive aspects and structures of fuzzy logic
understood as many valued logic sui generis. Some important systems of real-valued …

An approach to software design that introduces a fully automated analysis giving designers
immediate feedback, now featuring the latest version of the Alloy language. In Software …

Finite model theory is an area of mathematical logic that grew out of computer science
applications. The main sources of motivational examples for finite model theory are found in …

One of the major aims of finite model theory consists in characterizing the queries in a given
complexity class by means of a logic in which they can be described. In this way one obtains …

The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

During the past few years, several of us have been asked many times about references on
finite tree automata. On one hand, this is the witness of the liveness of this field. On the other …

The Web is causing a revolution in how we represent, retrieve, and process information Its
growth has given us a universally accessible database-but in the form of a largely …

The recently introduced series of description logics under the common monikerDL-Lite'has
attracted attention of the description logic and semantic web communities due to the low …