Sciweavers

Share
TVLSI
2002
111views more  TVLSI 2002»
9 years 9 months ago
Circular BIST with state skipping
Circular built-in self-test (BIST) is a "test per clock" scheme that offers many advantages compared with conventional BIST approaches in terms of low area overhead, simp...
Nur A. Touba
TC
1998
9 years 9 months ago
Using Decision Diagrams to Design ULMs for FPGAs
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
Zeljko Zilic, Zvonko G. Vranesic
NDJFL
1998
100views more  NDJFL 1998»
9 years 9 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
LOGCOM
2002
124views more  LOGCOM 2002»
9 years 9 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
JSYML
2002
114views more  JSYML 2002»
9 years 9 months ago
Interpolation for First Order S5
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
Melvin Fitting
JSYML
2002
170views more  JSYML 2002»
9 years 9 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
JOLLI
2002
141views more  JOLLI 2002»
9 years 9 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod
JAIR
1998
97views more  JAIR 1998»
9 years 9 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
IGPL
1998
64views more  IGPL 1998»
9 years 9 months ago
Formulas for which Contraction is Admissible
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...
Arnon Avron
JAR
2002
72views more  JAR 2002»
9 years 9 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
books