Short-circuit logic
نویسندگان
چکیده
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of propositional logic (PL) that can be defined by short-circuit evaluation and implies the set of consequences defined by a module SCL. The module SCL is defined using Hoare’s conditional, a ternary connective comparable to if-then-else, and implies all identities that follow from four basic axioms for the conditional and can be expressed in PL (e.g., axioms for associativity of conjunction and double negation shift). In the absence of side effects, short-circuit evaluation characterizes PL. However, short-circuit logic admits the possibility to model side effects. We use sequential conjunction as a primitive connective because it immediately relates to short-circuit evaluation. Sequential conjunction gives rise to many different short-circuit logics. The first extreme case is FSCL (free short-circuit logic), which characterizes the setting in which evaluation of each atom (propositional variable) can yield a side effect. The other extreme case is MSCL (memorizing short-circuit logic), the most identifying variant we distinguish below PL. In MSCL, only static side effects can be modelled, while sequential conjunction is non-commutative. We provide sets of equations for FSCL and MSCL, and for MSCL we have a completeness result. Extending MSCL with one simple axiom yields SSCL (static short-circuit logic, or sequential PL), for which we also provide a completeness result. We briefly discuss two variants in between FSCL and MSCL, among which a logic that admits the contraction of atoms and of their negations.
منابع مشابه
Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملSatisfiability of Short Circuit Logic
The logical connectives typically found in programming languages are similar to their mathematical counterparts, yet different due to their short-circuit behaviour – when evaluating them, the second argument is only evaluated if the first argument is not sufficient to determine the result. Combined with the possibility of side-effects, this creates a different type of logic called Short Circuit...
متن کاملA New Highly Controllable and Accurate Algorithm for Defuzzifier Circuit Implementation
Defuzzifier circuit is one of the most important parts of fuzzy logic controllers that determine the output accuracy. The Center Of Gravity method (COG) is one of the most accurate methods that so far been presented for defuzzification. In this paper, a simple algorithm is presented to generate triangular output membership functions in the Mamdani method using the multiplier/divider circuit and...
متن کاملEstimation of Propagation Delay considering Short-Circuit Current for Static CMOS Gates
| We present formula of propagation delay for static CMOS logic gates considering short-circuit current and current owing through gate capacitance and using the n-th power law MOSFET model which considers velocity saturation e ects. The short circuit current is represented by a piece-wise linear function, which enables detailed analysis of the transient behavior of a CMOS inverter. We found tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1010.3674 شماره
صفحات -
تاریخ انتشار 2010