Sciweavers

3738 search results - page 254 / 748
» Parametrized Logic Programming
Sort
View
FSTTCS
1999
Springer
15 years 10 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
ISQED
2009
IEEE
126views Hardware» more  ISQED 2009»
16 years 1 months ago
Robust differential asynchronous nanoelectronic circuits
Abstract — Nanoelectronic design faces unprecedented reliability challenges and must achieve noise immunity and delay insensitiveness in the presence of prevalent defects and sig...
Bao Liu
WLP
2004
Springer
15 years 12 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä
KSEM
2010
Springer
15 years 4 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard
ECOOP
2009
Springer
16 years 7 months ago
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
Jan Smans, Bart Jacobs 0002, Frank Piessens