903 search results - page 154 / 181 » Completeness Results for Memory Logics |
141
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
149
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
140
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
152
click to vote
IFSA
2003
Springer
15 years 11 months ago
2003
Springer
In fuzzy modeling (FM), the quantity and quality of the training set is crucial to properly grasp the behavior of the system being modeled. However, the available data are often n...
181
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
Due to significant improvements in the capabilities of small devices such as PDAs and smart phones, these devices can not only consume but also provide Web Services. The dynamic n...