Sciweavers

48 search results - page 3 / 10
» Achieving Flexibility In Unification Formalisms
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 1 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
AIME
1995
Springer
14 years 1 months ago
Coordinating Taxonomies: Key to Re-Usable Concept Representations
: A unified controlled medical vocabulary has been cited as one of the grand challenges facing Medical Informatics. We would restate this challenge as ‘achieving a re-usable and ...
Alan L. Rector
APN
2006
Springer
14 years 1 months ago
Nested Nets for Adaptive Systems
We consider nested nets, i.e. Petri nets in which tokens can be Petri nets themselves. We study value semantics of nested nets rather than reference semantics, and apply nested ne...
Kees M. van Hee, Irina A. Lomazova, Olivia Oanea, ...
IJAR
2000
140views more  IJAR 2000»
13 years 9 months ago
Belief updating in multiply sectioned Bayesian networks without repeated local propagations
Multiply sectioned Bayesian networks (MSBNs) provide a coherent and flexible formalism for representing uncertain knowledge in large domains. Global consistency among subnets in a...
Yang Xiang
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 4 months ago
The Rigorous Implementation of a Fair Exchange Protocol for Non-repudiable Web Service Interactions - a case study
The correct implementation of security protocols is a challenging task. To achieve a high degree of confidence in an implementation, as with any software, ideally one requires bot...
Nick Cook, Paul Robinson, Santosh K. Shrivastava