3515 search results - page 134 / 703 » On the semantics of Strategy Logic |
193
click to vote
PPDP
2007
Springer
16 years 1 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...
168
click to vote
ECAI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. As far as we know, there is no multi-agent system allowing to talk both about choices of agents or groups of agents, strategies, and about sufficiently rich actions. This...
319
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
243
click to vote
ALP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
181
click to vote
JSA
2000
15 years 7 months ago
2000
As the density of VLSI circuits increases it becomes attractive to integrate dedicated test logic on a chip. This Built-in Self-Test (BIST) approach not only offers economic benef...