4217 search results - page 23 / 844 » Computational indistinguishability logic |
166
click to vote
ASIAN
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
103
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
AAAI
1990
14 years 11 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the a-calculus, a minimal calcu...
125
click to vote
TLCA
1993
Springer
15 years 1 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...