Sciweavers

503 search results - page 12 / 101
» Interpolative Boolean Logic
Sort
View
SYNTHESE
2008
68views more  SYNTHESE 2008»
14 years 9 months ago
Some remarks on the bearing of model theory on the theory of theories
The present paper offers some remarks on the significance of first order model theory for our understanding of theories, and more generally, for our understanding of the "stru...
William Demopoulos
97
Voted
JAR
2000
77views more  JAR 2000»
14 years 9 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
DAC
2006
ACM
15 years 10 months ago
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
Jin S. Zhang, Alan Mishchenko, Robert K. Brayton, ...
70
Voted
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
15 years 9 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
TCS
2010
14 years 7 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...