Sciweavers

295 search results - page 28 / 59
» SAT, SMT and Applications
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 6 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ICTAI
2003
IEEE
15 years 7 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 7 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
SAT
2007
Springer
126views Hardware» more  SAT 2007»
15 years 8 months ago
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach
Unmanned aerial vehicles (UAVs) represent an important class of networked robotic applications that must be both highly dependable and autonomous. This paper addresses sensor deplo...
Fadi A. Aloul, Nagarajan Kandasamy
CHARME
2005
Springer
130views Hardware» more  CHARME 2005»
15 years 7 months ago
Improvements to the Implementation of Interpolant-Based Model Checking
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
João P. Marques Silva