2152 search results - page 184 / 431 » On Automating the Calculus of Relations |
166
click to vote
LICS
2007
IEEE
16 years 24 days ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
166
click to vote
CSL
2007
Springer
16 years 20 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
150
click to vote
ECOWS
2007
Springer
16 years 20 days ago
2007
Springer
Service composition and service statefulness are key concepts in Web Service system programming. In this paper we present JOLIE, which is the full implementation of our formal cal...
161
click to vote
SEMWEB
2007
Springer
16 years 18 days ago
2007
Springer
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
146
click to vote
LICS
2006
IEEE
16 years 15 days ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...