764 search results - page 87 / 153 » On the Expressibility of Stable Logic Programming |
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
113
click to vote
ESOP
2006
Springer
15 years 3 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
ICFP
2000
ACM
15 years 4 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
135
click to vote
ISSTA
2012
ACM
13 years 2 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
193
click to vote
POPL
2006
ACM
16 years 4 days ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...