Sciweavers

93 search results - page 9 / 19
» On the Computational Representation of Classical Logical Con...
Sort
View
IJAR
2010
91views more  IJAR 2010»
13 years 5 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
EUSFLAT
2001
13 years 8 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
SEUS
2005
IEEE
14 years 28 days ago
A Strategy for Application-Transparent Integration of Nomadic Computing Domains
Nomadic computing environments are composed of heterogeneous mobile computing domains. Unfortunately, the service discovery platforms suitable for each domain are scarcely interop...
Domenico Cotroneo, Cristiano di Flora, Massimo Fic...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 27 days ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
CSR
2008
Springer
13 years 7 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky