400 search results - page 22 / 80 » Reasoning About Hidden Mechanisms |
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
AAMAS
2005
Springer
14 years 9 months ago
2005
Springer
Intentional agent systems are increasingly being used in a wide range of complex applications. Capabilities has recently been introduced into some of these systems as a software en...
179
click to vote
LPNMR
2011
Springer
14 years 16 days ago
2011
Springer
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
109
click to vote
ENTCS
2006
14 years 9 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...