University of Limerick Institutional Repository

Browsing LERO - Project partner authors by Author "Marques-Silva, Joao"

DSpace Repository

Browsing LERO - Project partner authors by Author "Marques-Silva, Joao"

Sort by: Order: Results:

  • Heras, Federico; Morgado, Antonio; Marques-Silva, Joao (Springer, 2012)
    Weighted Partial MaxSAT (WPMS) is a well-known optimization variant of Boolean Satisfiability (SAT) that finds a wide range of practical applications.WPMS divides the formula in two sets of clauses: The hard clauses ...
  • Morgado, Antonio; Heras, Federico; Marques-Silva, Joao (Springer, 2012)
    Maximum Satisfiability (MaxSAT) and its weighted variants are wellknown optimization formulations of Boolean Satisfiability (SAT). Motivated by practical applications, recent years have seen the development of ...
  • Bordeaux, Lucas; Marques-Silva, Joao (Springer, 2012)
    When we encode constraints as Boolean formulas, a natural question is whether the encoding ensures a ”propagation completeness” property: is the basic unit propagation mechanism able to deduce all the literals that ...
  • Heras, Federico; Morgado, Antonio; Marques-Silva, Joao (Springer, 2012)
    This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the ...
  • Morgado, Antonio; Liffiton, Mark; Marques-Silva, Joao (2012)
    Enumeration of Minimal Correction Sets (MCS) finds a wide range of practical applications, including the identification of Minimal Unsatisfiable Subsets (MUS) used in verifying the complex control logic of microprocessor ...
  • 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 ...
  • Chen, Huan; Marques-Silva, Joao (Association for Computing Machinery, 2012)
    Boolean function bi-decomposition is pervasive in logic synthesis. Bi-decomposition entails the decomposition of a Boolean function into two other simpler functions connected by a simple two-input gate. Existing solutions ...
  • 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 ...
  • Janota, Mikolas; Lynce, Inês; Manquinho, Vasco; Marques-Silva, Joao (IOS Press, 2012)
    This paper presents PackUp1. (PACKage UPgradability with Boolean formulations) a framework for solving the the software package upgradability problem. Earlier versions of the framework (cudf2msu, cudf2pbo) participated ...
  • Chen, Huan; Janota, Mikolas; Marques-Silva, Joao (IEEE Computer Society, 2012)
    Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bidecomposition are often based on BDDs ...
  • Cordeiro, Lucas; Fischer, Bernd; Marques-Silva, Joao (IEEE Computer Society, 2012)
    Propositional bounded model checking has been applied successfully to verify embedded software but remains limited by increasing propositional formula sizes and the loss of high-level information during the translation ...
  • Janota, Mikolas; Klieber, William; Marques-Silva, Joao; Clarke, Edmund (Springer, 2012)
    We propose two novel approaches for using Counterexample- Guided Abstraction Re nement (CEGAR) in Quanti ed Boolean Formula (QBF) solvers. The rst approach develops a recursive algorithm whose search is driven by CEGAR ...
  • Chen, Huan; Marques-Silva, Joao (IOS Press, 2012)
    Automatic Test Pattern Generation (ATPG) is arguably one of the practical applications that motivated the development of modern Boolean Satisfiability (SAT) solvers in the mid 90s. Despite the interest of using SAT in ...
  • 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