Recent Submissions

  • The ordering principle in a fragment of approximate counting 

    Atserias Peri, Albert; Thapen, Neil (2014)
    Article
    Open Access
    The ordering principle states that every finite linear order has a least element. We show that, in the relativized setting, the surjective weak pigeonhole principle for polynomial time functions does not prove a Herbrandized ...
  • Process discovery algorithms using numerical abstract domains 

    Carmona Vargas, Josep; Cortadella Fortuny, Jordi (2014-12-01)
    Article
    Open Access
    The discovery of process models from event logs has emerged as one of the crucial problems for enabling the continuous support in the life-cycle of an information system. However, in a decade of process discovery research, ...
  • Firefighting as a game 

    Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Molter, Hendrik (2014-12-10)
    Article
    Restricted access - publisher's policy
    The Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of diseases and the containment ...
  • Lower bounds for DNF-refutations of a relativized weak pigeonhole principle 

    Atserias Peri, Albert; Müller, Moritz; Oliva Valls, Sergi (2015-06-01)
    Article
    Open Access
    The relativized weak pigeonhole principle states that if at least 2n out of n(2) pigeons fly into n holes, then some hole must be doubly occupied. We prove that every DNF-refutation of the CNF encoding of this principle ...
  • Bounded-width QBF is PSPACE-complete 

    Atserias Peri, Albert; Oliva Valls, Sergi (2014-11-01)
    Article
    Restricted access - publisher's policy
    Tree-width and path-width are two well-studied parameters of structures that measure their similarity to a tree and a path, respectively. We show that QBF on instances with constant path-width, and hence constant tree-width, ...
  • A boolean rule-based approach for manufacturability-aware cell routing 

    Cortadella Fortuny, Jordi; Petit Silvestre, Jordi; Gómez Fernández, Sergio; Moll Echeto, Francisco de Borja (2014-03-01)
    Article
    Open Access
    An approach for cell routing using gridded design rules is proposed. It is technology-independent and parameterizable for different fabrics and design rules, including support for multiple-patterning lithography. The core ...
  • Area-optimal transistor folding for 1-D gridded cell design 

    Cortadella Fortuny, Jordi (2013-11)
    Article
    Open Access
    The 1-D design style with gridded design rules is gaining ground for addressing the printability issues in subwavelength photolithography. One of the synthesis problems in cell generation is transistor folding, which ...
  • Partially definable forcing and bounded arithmetic 

    Atserias Peri, Albert; Müller, Moritz (2015-02-01)
    Article
    Restricted access - publisher's policy
    We describe a method of forcing against weak theories of arithmetic and its applications in propositional proof complexity.
  • Trustworthiness in P2P: performance behaviour of two fuzzy-based systems for JXTA-overlay platform 

    Spaho, Evjola; Sakamoto, Shinji; Barolli, Leonard; Xhafa Xhafa, Fatos; Ikeda, Makoto (Springer, 2014-09-01)
    Article
    Restricted access - publisher's policy
    Peer-to-peer (P2P) networks, will be very important for future distributed systems and applications. In such networks, peers are heterogeneous in providing the services and they do not have the same competence of reliability. ...
  • Measuring precision of modeled behavior 

    Adriansyah, Arya; Muñoz Gama, Jorge; Carmona Vargas, Josep; Van Dongen, Boudewijn; van der Aalst, Wil M. P. (2015-02-01)
    Article
    Restricted access - publisher's policy
    Conformance checking techniques compare observed behavior (i.e., event logs) with modeled behavior for a variety of reasons. For example, discrepancies between a normative process model and recorded behavior may point to ...

View more