4290 search results - page 187 / 858 » Formal Approaches to Teamwork |
144
click to vote
SAS
1993
Springer
15 years 10 months ago
1993
Springer
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
118
click to vote
ISSAC
1990
Springer
15 years 10 months ago
1990
Springer
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
151
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
154
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
This paper addresses the frame problem for programming theories that support both sharing and encapsulation through specification variables. The concept of dynamic frames is introd...
178
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...