University of Limerick Institutional Repository

Browsing LERO - Project partner authors by Author "FCT"

DSpace Repository

Browsing LERO - Project partner authors by Author "FCT"

Sort by: Order: Results:

  • Tennina, Stefano; Bouroche, Mélanie; Braga, Pedro; Gomes, Ricardo; Alves, Mario; Mirza, Farrukh; Ciriello, Vincenzo; Carrozza, Gabriella; Oliveira, Pedro; Cahill, Vinny (IEEE Computer Society, 2011)
    Wireless sensor networks (WSNs) have attracted growing interest in the last decade as an infrastructure to support a diversity of ubiquitous computing and cyber-physical systems. However, most research work has focused on ...
  • 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 ...
  • 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; 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 ...
  • 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 ...
  • 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