Sciweavers

529 search results - page 88 / 106
» Causal Time Calculus
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
DCC
2004
IEEE
14 years 7 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
HICSS
2003
IEEE
116views Biometrics» more  HICSS 2003»
14 years 25 days ago
Modeling Instrumental Conditioning - The Behavioral Regulation Approach
Basically, instrumental conditioning is learning through consequences: Behavior that produces positive results (high “instrumental response”) is reinforced, and that which pro...
Jose J. Gonzalez, Agata Sawicka
OTM
2007
Springer
14 years 1 months ago
Parallelizing Tableaux-Based Description Logic Reasoning
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
Thorsten Liebig, Felix Müller
LPAR
2004
Springer
14 years 27 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel