Sciweavers

971 search results - page 7 / 195
» Approximate Satisfiability and Equivalence
Sort
View
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
14 years 2 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
ICS
2010
Tsinghua U.
14 years 1 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
ICLP
2009
Springer
14 years 10 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
ASM
2010
ASM
14 years 6 months ago
Synchronous Message Passing and Semaphores: An Equivalence Proof
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
Iain Craig, Egon Börger
MST
2008
119views more  MST 2008»
13 years 9 months ago
Logical Equivalence for Subtyping Object and Recursive Types
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
Steffen van Bakel, Ugo de'Liguoro