Sciweavers

503 search results - page 32 / 101
» Interpolative Boolean Logic
Sort
View
112
Voted
IPPS
2003
IEEE
15 years 6 months ago
Addressable Procedures for Logic and Arithmetic Operations with DNA Strands
In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA represent...
Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
15 years 7 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
ICTAI
2008
IEEE
15 years 7 months ago
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
Éric Grégoire, Bertrand Mazure, C&ea...
108
Voted
ECAI
2010
Springer
15 years 2 months ago
Majority Merging: from Boolean Spaces to Affine Spaces
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...
Jean-François Condotta, Souhila Kaci, Pierr...
121
Voted
TLCA
2005
Springer
15 years 6 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger