In industrial practice, information on the software field quality of a product is available too late in the software lifecycle to guide affordable corrective action. An important ...
Nachiappan Nagappan, Laurie Williams, Mladen A. Vo...
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
In a 2002 paper, we combined fuzzy logic with discrete-event systems (DESs) and established an automaton model of fuzzy DESs (FDESs). The model can effectively represent determinis...
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
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, ...