4217 search results - page 49 / 844 » Computational indistinguishability logic |
158
click to vote
ICTAC
2005
Springer
15 years 11 months ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
167
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We develop a logic for reasoning about object-oriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for self-reference in...
167
click to vote
ZUM
2000
Springer
15 years 9 months ago
2000
Springer
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
158
click to vote
NC
2007
15 years 5 months ago
2007
In quantum computational logic meanings of sentences are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We co...
165
click to vote
IJCAI
2001
15 years 7 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...