Sciweavers

283 search results - page 34 / 57
» Solving Over-Constrained Problems with SAT
Sort
View
ECAI
2008
Springer
13 years 11 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
SAT
2007
Springer
126views Hardware» more  SAT 2007»
14 years 3 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
SAT
2004
Springer
111views Hardware» more  SAT 2004»
14 years 2 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak
EPIA
1997
Springer
14 years 1 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
14 years 3 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort