Sciweavers

610 search results - page 49 / 122
» Using SAT in QBF
Sort
View
COCO
2003
Springer
64views Algorithms» more  COCO 2003»
14 years 1 months ago
Proving SAT does not have Small Circuits with an Application to the Two
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...
Lance Fortnow, Aduri Pavan, Samik Sengupta
LPAR
2005
Springer
14 years 1 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
ACSD
2004
IEEE
113views Hardware» more  ACSD 2004»
13 years 11 months ago
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
ECAI
2008
Springer
13 years 9 months ago
WWW sits the SAT: Measuring Relational Similarity on the Web
Abstract. Measuring relational similarity between words is important in numerous natural language processing tasks such as solving analogy questions and classifying noun-modifier r...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
IGARSS
2010
13 years 2 months ago
Enhanced Cloud algorithm from collocated CALIPSO, CloudSat and MODIS global boundary layer lapse rate studies
Coincident profile information from CALIPSO's lidar and CloudSat's radar offers a unique opportunity to map the vertical structure of clouds over the globe with accuraci...
Sunny Sun-Mack, Patrick Minnis, Seiji Kato, Yan Ch...