Sciweavers

240 search results - page 30 / 48
» Constrained Partial Deduction
Sort
View
CONTEXT
2007
Springer
14 years 1 months ago
Contexts and Ontologies in Schema Matching
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
Paolo Bouquet
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
IAT
2005
IEEE
14 years 1 months ago
Analyzing Myopic Approaches for Multi-Agent Communication
Choosing when to communicate is a fundamental problem in multi-agent systems. This problem becomes particularly hard when communication is constrained and each agent has different...
Raphen Becker, Victor R. Lesser, Shlomo Zilberstei...
CSFW
2000
IEEE
13 years 12 months ago
Secure Composition of Untrusted Code: Wrappers and Causality Types
We consider the problem of assembling concurrent software systems from untrusted or partially trusted o -the-shelf components, using wrapper programs to encapsulate components and...
Peter Sewell, Jan Vitek
AMAST
1998
Springer
13 years 11 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak