Sciweavers

2303 search results - page 331 / 461
» On the logic of argumentation theory
Sort
View
WOODPECKER
2001
15 years 8 months ago
Proposal for a formal foundation of RM-ODP concepts
Abstract. This paper presents an approach for formalizing the RM-ODP (Reference Model for Open Distributed Processing), an ISO and ITU standard. The goal of this formalization is t...
Andrey Naumenko, Alain Wegmann, Guy Genilloud, Wil...
202
Voted
DLT
1993
15 years 8 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
UAI
1989
15 years 8 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
GG
2008
Springer
15 years 8 months ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto
164
Voted
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 7 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff