89 search results - page 8 / 18 » Weak Conditional Logics of Normality |
TPLP
2002
13 years 7 months ago
2002
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
IDEAS
2002
IEEE
14 years 16 days ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
CHES
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose new models for directly evaluating DPA leakage from logic information in CMOS circuits. These models are based on the transition probability for each gate...
DEON
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...