764 search results - page 139 / 153 » On the Expressibility of Stable Logic Programming |
105
click to vote
PAM
2012
Springer
13 years 7 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
118
click to vote
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
214
click to vote
POPL
2006
ACM
16 years 17 min ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
104
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
103
click to vote
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...