University of Limerick Institutional Repository

Browsing LERO - Project partner authors by Author "Belov, Anton"

DSpace Repository

Browsing LERO - Project partner authors by Author "Belov, Anton"

Sort by: Order: Results:

  • Belov, Anton; Marques-Silva, Joao (IOS Press, 2012)
    Algorithms for extraction of Minimally Unsatisfiable Subformulas (MUSes) of CNF formulas find a wide range of practical applications, including product configuration, knowledge-based validation, hardware and software ...
  • Belov, Anton; Janota, Mikolas; Lynce, Inês; Marques-Silva, Joao (Springer, 2012)
    A propositional formula in Conjunctive Normal Form (CNF) may contain redundant clauses | clauses whose removal from the for- mula does not a ect the set of its models. Identi cation of redundant clauses is important ...
  • Belov, Anton; Ivrii, Alexander; Matsliah, Arie; Marques-Silva, Joao (Springer-Verlag, 2012)
    In this paper we address the following problem: given an unsatisfiable CNF formula F, find a minimal subset of variables of F that constitutes the set of variables in some unsatisfiable core of F. This problem, known as ...
  • Belov, Anton; Lynce, Inês; Marques-Silva, Joao (IOS Press, 2012)
    Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware and software design and verification. MUSes also find ...

Search ULIR


Browse

My Account

Statistics