Sciweavers

2272 search results - page 253 / 455
» A Calculus for
Sort
View
ACTA
1998
64views more  ACTA 1998»
15 years 4 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
AAECC
2010
Springer
123views Algorithms» more  AAECC 2010»
15 years 2 months ago
Algebraic change-point detection
Abstract Elementary techniques from operational calculus, differential algebra, and noncommutative algebra lead to a new approach for change-point detection, which is an important ...
Michel Fliess, Cédric Join, Mamadou Mboup
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 1 months ago
A Proof Theoretic Analysis of Intruder Theories
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
Alwen Tiu, Rajeev Goré, Jeremy E. Dawson
JLP
2011
155views more  JLP 2011»
14 years 11 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
153
Voted
LOGCOM
2010
152views more  LOGCOM 2010»
14 years 11 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli