143 search results - page 17 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
146
click to vote
TLDI
2010
ACM
15 years 8 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
ESWS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
102
click to vote
ICFEM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
100
click to vote
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
209
click to vote
POPL
2009
ACM
16 years 9 days ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...