Browsing by Author "Cruz-Filipe, L."
Now showing 1 - 4 of 4
Results Per Page
Sort Options
- Computing Repairs from Active Integrity ConstraintsPublication . Cruz-Filipe, L.; Engrácia, P.; Nunes, I.; Gaspar, G.Repairing an inconsistent knowledge base is a well known problem for which several solutions have been proposed and implemented in the past. In this paper, we start by looking at databases with active integrity constraints - consistency requirements that also indicate how the database should be updated when they are not met - as introduced by Caroprese et al.We show that the different kinds of repairs considered by those authors can be effectively computed by searching for leaves of specific kinds of trees. Although these computations are in general not very efficient (deciding the existence of a repair for a given database with active integrity constraints is NP-complete), on average the algorithms we present make significant reductions on the number of nodes in the search tree. Finally, these algorithms also give an operational characterization of different kinds of repairs that can be used when we extend the concept of active integrity constraints to the more general setting of knowledge bases.
- The Finitistic Consistency of Heck’s Predicative Fregean SystemPublication . Cruz-Filipe, L.; Ferreira, FernandoFrege’s theory is inconsistent (Russell’s paradox). However, the predicative version of Frege’s system is consistent. This was proved by Richard Heck in 1996 using a model-theoretic argument. In this paper, we give a finitistic proof of this consistency result. As a consequence, Heck’s predicative theory is rather weak (as was suspected).
- The Stream‐basedService‐Centered Calculus: a Foundation for Service‐Oriented ProgrammingPublication . Cruz-Filipe, L.; Lanese, I.; Ravara, A.; Vasconcelos, V.We give a formal account of stream-based, service-centered calculus (SSCC), a calculus for modelling service-based systems, suitable to describe both service composition (orchestration) and the protocols that services follow when invoked (conversation). The calculus includes primitives for defining and invoking services, for isolating conversations (called sessions) among clients and servers, and for orchestrating services. The calculus is equipped with a reduction and a labelled transition semantics related by an equivalence result. SSCC provides a good trade-off between expressive power for modelling and simplicity for analysis. We assess the expressive power by modelling van der Aalst workflow patterns and an automotive case study from the European project Sensoria. For analysis, we present a simple type system ensuring compatibility of client and service protocols. We also study the behavioural theory of the calculus, highlighting some axioms that capture the behaviour of the different primitives. As a final application of the theory, we define and prove correct some program transformations. These allow to start modelling a system from a typical UML Sequence Diagram, and then transform the specification to match the service-oriented programming style, thus simplifying its implementation using web services technology.
- Tighter integration in dl-programsPublication . Cruz-Filipe, L.; Engrácia, P.; Gaspar, G.; Henriques, R.; Nunes, I.; Santos, D.We introduce a mechanism called lifting to share predicates between the two components of a dl-program, integrating them in a tighter way. Using lifting, one can reason about the predicates being shared both via the description logic knowledge base and via Datalogstyle rules, and the deductions one makes are automatically reflected globally on both components. This is a capability not directly present in dl-programs, since changes to the knowledge base only affect the queries where they occur. We show that lifting has nice theoretical properties, making it suitable for modular design of dl-programs. Furthermore, dlprogram processors can easily incorporate lifting as a new operator, and we have extended dlvhex to work with dl-programs with lifting.