Sciweavers

8828 search results - page 103 / 1766
» Formal methods in practice
Sort
View
ICFCA
2009
Springer
15 years 11 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
16 years 4 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
FMCAD
2008
Springer
15 years 5 months ago
A Write-Based Solver for SAT Modulo the Theory of Arrays
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...
168
Voted
ACST
2006
15 years 5 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara