نتایج جستجو برای: sat model
تعداد نتایج: 2114181 فیلتر نتایج به سال:
Die rasante technologische Entwicklung der letzten zwei Jahrzehnte ermöglicht heute die dauerhafte Speicherung riesiger Datenmengen durch den Computer. In fast allen Wissenschaften werden große Datenmengen gespeichert, die analysiert und verstanden werden müssen. Aber nicht nur in der Wissenschaft, sondern auch in kommerziellen Anwendungen und auch im alltäglichen Leben entstehen große Datenmen...
The evolution of SAT algorithms over the last decade has motivated the application of SAT to model checking, initially through the use of SAT in bounded model checking and, more recently, in unbounded model checking. This paper provides an overview of modern SAT algorithms, SAT-based bounded model checking and some of the most promising approaches for unbounded model checking, namely induction ...
One of the most studied models SAT is random SAT. In this model, instances are composed from clauses chosen uniformly randomly and independently each other. This model may be unsatisfactory in that it fails to describe various features instances, arising real-world applications. Various modifications have been suggested define industrial Here, we focus mainly on aspect community structure. Name...
Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F . The model counting problem is denoted as #SAT. Model counting is an essential tool in probabilistic reasoning. In this paper, we introduce the problem of model counting projected on a subset of original variables that we call priority variables P ⊆ V. The task is to com...
A complete SAT-based model checking algorithm for contextfree processes is presented. We reduce proof search in local model checking to Boolean satisfiability. Bounded proof search can therefore be performed by SAT solvers. Moreover, the completion of proof search is reduced to Boolean unsatisfiability and hence can be checked by SAT solvers. By encoding the local model checking algorithm in [1...
Bankrechtliche Meldepflichten sind nicht erst seit der Finanzkrise ein relevantes Forschungsfeld. Jedoch werden insbesondere Methoden zur Unterstützung eines rechtsund regelkonformen Berichtswesens derzeit in der Forschung unzureichend betrachtet. Mit der Entwicklung einer Methode zur Modellierung und Analyse von Berichtsregulierungen mit dem Fokus auf den Finanzsektor wird ein Weg aufgezeigt, ...
Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world, SAT instances. However, the process of development and testing of new SAT solving techniques is conditioned to the finite and reduced number of known industrial benchmarks. Therefore, new models of random SAT instances generation that capture realistically the features of real-world problems can be benefi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید