4217 search results - page 64 / 844 » Computational indistinguishability logic |
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
100
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
SWAP
2008
14 years 11 months ago
2008
Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on the...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
SYNTHESE
2008
14 years 9 months ago
2008
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...