5158 search results - page 686 / 1032 » Generalization of the Dempster-Shafer Theory |
227
click to vote
ECSQARU
2005
Springer
16 years 10 days ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
195
click to vote
EMSOFT
2005
Springer
16 years 10 days ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
181
click to vote
EMSOFT
2005
Springer
16 years 10 days ago
2005
Springer
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...
186
click to vote
FASE
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Coalgebra has in recent years been recognized as the framework of choice for the treatment of reactive systems at an appropriate level of generality. Proofs about the rea...
175
click to vote
FOSSACS
2005
Springer
16 years 10 days ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...