Sciweavers

304 search results - page 18 / 61
» Analysis of the paraconsistency in some logics
Sort
View
ESOP
1998
Springer
13 years 11 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
TIME
2005
IEEE
14 years 1 months ago
Analysis of Timed Processes with Data Using Algebraic Transformations
The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...
Michel A. Reniers, Yaroslav S. Usenko
ISIPTA
2003
IEEE
119views Mathematics» more  ISIPTA 2003»
14 years 23 days ago
Analysis of Local or Asymmetric Dependencies in Contingency Tables using the Imprecise Dirichlet Model
We consider the statistical problem of analyzing the association between two categorical variables from cross-classified data. The focus is put on measures which enable one to st...
Jean-Marc Bernard
DLOG
2008
13 years 9 months ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
ICCSA
2005
Springer
14 years 1 months ago
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
Almudena Alcaide, Juan M. Estévez-Tapiador,...