2432 search results - page 242 / 487 » Cryptographic logical relations |
224
click to vote
WCFLP
2005
ACM
16 years 5 days ago
2005
ACM
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
179
click to vote
SAT
2005
Springer
16 years 3 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
163
click to vote
TCS
2008
15 years 6 months ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
210
click to vote
DLOG
2010
15 years 4 months ago
2010
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
293
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...