139 search results - page 16 / 28 » Models of set theory with definable ordinals |
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
GROUP
2003
ACM
14 years 1 months ago
2003
ACM
Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of inte...
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
SBMF
2010
Springer
13 years 2 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
APCCM
2006
13 years 9 months ago
2006
Current enterprise systems rely heavily on the modelling and enactment of business processes. One of the key criteria for a business process is to represent not just the behaviour...