Active XML (AXML) documents combine extensional XML data with intentional data defined through Web service calls. The dynamic properties of these documents pose challenges to both storage and data materialization techniques. We present ARAXA, a non-intrusive approach to store AXML documents. It takes advantage of complex objects from object-relational DBMS to represent both extensional and inte...

We present an hybrid extensional-intensional Inductive Logic Programming algorithm. We then show how this algorithm solves the problem of global inconsistency of intensional systems when learning multiple predicates, without incurring in the problems of incompleteness and inconsistency of extensional systems. The algorithm is obtained by modifying an intensional system 6] for learning abductive...

We present a natural framework for studying the persistence problem in two-dimensional fluid turbulence by using the Okubo-Weiss parameter Λ to distinguish between vortical and extensional regions. We then use a direct numerical simulation of the two-dimensional, incompressible Navier-Stokes equation with Ekman friction to study probability distribution functions (PDFs) of the persistence times...

We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevance of propositions and effective quotient sets. Then, by using the construction of total setoid à la Bishop we build a model of qmTT over mTT. The design of an extensional type theory with quotients and its interpretation in mTT...

Reversible computing is bi-deterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches exist to catch its extensional or intensional aspects and properties. We present a class RPRF of reversible functions which holds at bay intensional aspects and emphasizes the extensional side of the ...

In this paper we define an evolution mechanism with formal semantics using the metamodeling methodology [Geisler et al.98] based on dynamic logic. A remarkable feature of the metamodeling methodology is the ability to define the relation of intentional and extensional entities within one level, allowing not only for the description of structural relations among the modeling entities, but also f...

To form a Cooperative Information System in which several preexisting information systems cooperate by means of database interoperability, a methodology for database schema integration is needed. Extensional issues should be taken into account in such a methodology. We show how objects in different databases that represent the same real world object may be correlated through an object identific...

Abstract: Quantum search is well suited to spaces that can be described in brief encodings, such as integers or a set of algorithmic transformations in an abbreviated representation, but needs adaptation to deal efficiently with datasets. A method is presented for exploiting the global aggregation properties of a search operator so that the data space (extension) and algorithmic space can be ex...

A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several process algebras are capable of expressing this property and how they agree on the equivalence of deterministic processes. A number of important properties of processes P , including confluence, can be captured in terms...

We present a cartesian closed category of dI-domains with coherence and strongly stable functions which provides a new model of PCF, where terms are interpreted by functions and where, at rst order, all functions are sequential. We show how this model can be reened in such a way that the theory it induces on the terms of PCF be strictly ner than the theory induced by the Scott model of continuo...