Sciweavers

21 search results - page 4 / 5
» What Is a Real-World SAT Instance
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 7 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
ASPDAC
2004
ACM
87views Hardware» more  ASPDAC 2004»
14 years 27 days ago
ShatterPB: symmetry-breaking for pseudo-Boolean formulas
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
COOPIS
2002
IEEE
14 years 12 days ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman
BIRTHDAY
2006
Springer
13 years 11 months ago
Coordination of Actions in an Autonomous Robotic System
Robots are autonomous agents whose actions are performed in the real world during a period of time. There are a number of general constraints on such actions, for example that the ...
Erik Sandewall