Precisely when the success of artificial intelligence (AI) sub-symbolic techniques makes
them be identified with the whole AI by many non-computer-scientists and non-technical …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

Using a call-by-value functional language as an example, this article illustrates the use of
coinductive definitions and proofs in big-step operational semantics, enabling it to describe …

Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and
that has been under almost constant development since then. This paper presents the …

In this paper we present the theory and practice of co-logic programming (co-LP for brevity),
a paradigm that combines both inductive and coinductive logic programming. Co-LP is a …

Coinduction has recently been introduced as a powerful technique for reasoning about
unfounded sets, unbounded structures, and interactive computations. Where induction …

Runtime verification (RV) is an approach to verification consisting in dynamically checking
that the event traces generated by single runs of a system under scrutiny (SUS) are …

Multiparty sessions with asynchronous communications and global types play an important
role for the modelling of interaction protocols in distributed systems. In designing such …

We introduce a generalized notion of inference system to support structural recursion on non
well-founded datatypes. Besides axioms and inference rules with the usual meaning, a …