Abstract-- We present the short-circuit code transformation technique, intended for embedded compilers. The transformation technique optimizes conditional blocks in high-level prog...
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...