Recent Submissions

  • From process models to chatbots 

    López Cuenca, Francisco Anselmo; Sánchez Ferreres, Josep; Carmona Vargas, Josep; Padró, Lluís (Springer, 2019)
    Conference report
    Open Access
    The effect of digital transformation in organizations needs to go beyond automation, so that human capabilities are also augmented. A possibility in this direction is to make formal representations of processes more ...
  • Structural computation of alignments of business processes over partial orders 

    Taymouri, Farbod; Carmona Vargas, Josep (Institute of Electrical and Electronics Engineers (IEEE), 2019)
    Conference report
    Open Access
    Relating event data and process models is becoming an important element for organizations. This paper presents a novel approach for aligning traces and process models. The approach is based on the structural theory of Petri ...
  • Generalized alignment-based trace clustering of process behavior 

    Boltenhagen, Mathilde; Chatain, Thomas; Carmona Vargas, Josep (Springer, 2019)
    Conference report
    Open Access
    Process mining techniques use event logs containing real process executions in order to mine, align and extend process models. The partition of an event log into trace variants facilitates the understanding and analysis ...
  • Approximate computation of alignments of business processes through relaxation labelling 

    Padró, Lluís; Carmona Vargas, Josep (Springer, 2019)
    Conference report
    Open Access
    A fundamental problem in conformance checking is aligning event data with process models. Unfortunately, existing techniques for this task are either complex, or can only be applicable to restricted classes of models. This ...
  • Formal reasoning on natural language descriptions of processes 

    Sánchez Ferreres, Josep; Burattin, Andrea; Carmona Vargas, Josep; Montali, Marco; Padró, Lluís (Springer, 2019)
    Conference report
    Open Access
    The existence of unstructured information that describes processes represents a challenge in organizations, mainly because this data cannot be directly referred into process-aware ecosystems due to ambiguities. Still, this ...
  • Encoding conformance checking artefacts in SAT 

    Boltenhagen, Mathilde; Chatain, Thomas; Carmona Vargas, Josep (Springer, 2019)
    Conference report
    Open Access
    Conformance checking strongly relies on the computation of artefacts, which enable reasoning on the relation between observed and modeled behavior. This paper shows how important conformance artefacts like alignments, ...
  • Measuring investment opportunities under uncertainty 

    Castro Rabal, Jorge; Gabarró Vallès, Joaquim; Serna Iglesias, María José (Springer, 2019)
    Conference report
    Open Access
    In order to make sound economic decisions it is important to measure the possibilities offered by a market in relation to investments. Provided an investment scheme S = (r; R1, . . . , Rn), where r is a lower bound on the ...
  • An agent-based model of the emergence and evolution of a language system for boolean coordination 

    Sierra Santibáñez, Josefina (International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2019)
    Conference report
    Restricted access - publisher's policy
    This paper presents an agent-based model for studying the emergence and evolution of a language system for Boolean coordination. The model has been implemented and tested by conducting a series of experiments that show ...
  • Refining the imprecise meaning of non-determinism in the Web by strategic games 

    Castro Rabal, Jorge; Gabarró Vallès, Joaquim; Serna Iglesias, María José (Springer, 2019)
    Conference report
    Open Access
    Nowadays interactions with the World Wide Web are ubiquitous. Users interact through a number of steps consisting of site calls and handling results that can be automatized as orchestrations. Orchestration results have ...
  • A biased random key genetic algorithm for the weighted independent domination problem 

    Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2019)
    Conference lecture
    Open Access
    This work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed ...
  • Resolution lower bounds for refutation statements 

    Garlik, Michal (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019)
    Conference report
    Open Access
    For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolutionrefutations of a propositional statement that the formula has a resolution refutation. We describethree applications. (1) An ...
  • Homomorphism problems for first-order definable structures 

    Klin, Bartek; Lasota, Slawomir; Ochremiak, Joanna Regina; Torunczyk, Szymon Abram (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016)
    Conference report
    Open Access
    We investigate several variants of the homomorphism problem: given two relational structures, is there a homomorphism from one to the other? The input structures are possibly infinite, but definable by first-order ...

View more