4217 search results - page 25 / 844 » Computational indistinguishability logic |
COMMA
2008
14 years 11 months ago
2008
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
ICPP
1996
IEEE
15 years 1 months ago
1996
IEEE
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...