We explore the paradigm of artifact-centric systems from a knowledge-based perspective. We provide a semantics based on interpreted-systems to interpret a first-order temporalepistemic language with identity in a multi-agent setting. We consider the model checking problem for this language and provide abstraction results. We isolate a natural subclass of artifact-systems for which the model che...

In this paper, we present the project Urbi et Orbi, a framework to dynamically manage distributed virtual environments (DVEs). This framework relies on a dedicated scripting language, Goal, which is typed, object-oriented and dynamically bound. Goal is interpreted by the application hosted by each machine and is designed to handle efficiently both network communications and interactivity. Final...

Current graphical object-oriented design notations are syntax-bound and semantic-free since they tend to focus on design representation rather than on the meaning of the design. This paper proposes a meaning for object-oriented designs in terms of object behaviours represented as constructions in category theory. A new design language is proposed, based on-notation, whose semantics is given by ...

We investigate CPS translatability of typed al uli with indu tive and oindu tive types. We show that tenable Plotkin-style all-by-name CPS translations exist for simply typed al uli with a natural number type and stream types and, more generally, with arbitrary positive indu tive and oindu tive types. These translations also work in the presen e of ontrol operators and generalize for dependentl...

DEFINITION A relational query language Q is BP-complete if for each relational database D, the set of all relations defined by the queries of Q on D is equal to the set of all first-order definable relations over D. More formally, fix some infinite universe U of atomic data elements. A relational database schema S is a finite set of relation names, each with an associated arity. A relational da...

This work’ integrates three related AI search techniques constraint satisfaction, branch-and-bound and solution synthesis and applies the result to semantic processing in natural language (NL). We summarize the approach as “Hunter-Gatherer:” o branch-and-bound and constraint satisfaction allow us to “hunt down” non-optimal and impossible solutions and prune them from the search space. e solutio...

In a bounded analysis, arithmetic operators become partial, and a different semantics becomes necessary. One approach, mimicking programming languages, is for overflow to result in wrap-around. Although easy to implement, wrap-around produces unexpected counterexamples that do not correspond to cases that would arise in the unbounded setting. This paper describes a new approach, implemented in ...

Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This paper consists of three parts. In the first part we consider some options for labels: simple constant labels vs labels with free variables, logic depended inference rules vs labels manipulation based on a label algebra. ...

Scalar replacement or register promotion uses scalar variables to save data that can be reused across loop iterations, leading to a reduction of the number of memory operations at the expense of a possibly large number of registers. In this paper we present a compiler data reuse analysis capable of uncovering and exploiting reuse opportunities for array references that exhibit Multiple-Inductio...

One way to model a sound and complete translation from a source calculus into a target calculus is with an adjoint or a Galois connection. In the special case of a reeection, one also has that the target calculus is isomorphic to a subset of the source. We show that three widely studied translations form reeections. We use as our source language Moggi's computational lambda calculus, which is a...