294 search results - page 13 / 59 » Relation between Semantic Completeness and Syntax Completene... |
139
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
149
click to vote
PPDP
2007
Springer
15 years 12 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
142
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
140
click to vote
DEXAW
1997
IEEE
15 years 10 months ago
1997
IEEE
Current workflow management systems (WFMSs) are only applicable in a reliable and secure manner, if the business process (BP) to be supported is wellstructured. As ad hoc deviatio...
182
click to vote
IJSWIS
2006
15 years 5 months ago
2006
Popular online social networks such as Friendster and MySpace do more than simply reveal the superficial structure of social connectedness--the rich meanings bottled within social...