5 research outputs found

    Smoke Test Planning using Answer Set Programming

    Get PDF
    Smoke testing is an important method to increase stability and reliability of hardware- gramming, Testing depending systems. Due to concurrent access to the same physical resource and the impracticality of the use of virtualization, smoke testing requires some form of planning. In this paper, we propose to decompose test cases in terms of atomic actions consisting of preconditions and effects. We present a solution based on answer set programming with multi-shot solving that automatically generates short parallel test plans. Experiments suggest that the approach is feasible for non-inherently sequential test cases and scales up to thousands of test cases

    Multiple agent possibilistic logic

    Get PDF
    International audienceThe paper presents a ‘multiple agent’ logic where formulas are pairs of the form (a, A), made of a proposition a and a subset of agents A. The formula (a, A) is intended to mean ‘(at least) all agents in A believe that a is true’. The formal similarity of such formulas with those of possibilistic logic, where propositions are associated with certainty levels, is emphasised. However, the subsets of agents are organised in a Boolean lattice, while certainty levels belong to a totally ordered scale. The semantics of a set of ‘multiple agent’ logic formulas is expressed by a mapping which associates a subset of agents with each interpretation (intuitively, the maximal subset of agents for whom this interpretation is possibly true). Soundness and completeness results are established. Then a joint extension of the multiple agent logic and possibilistic logic is outlined. In this extended logic, propositions are then associated with both sets of agents and certainty levels. A formula then expresses that ‘all agents in set A believe that a is true at least at some level’. The semantics is then given in terms of fuzzy sets of agents that find an interpretation more or less possible. A specific feature of possibilistic logic is that the inconsistency of a knowledge base is a matter of degree. The proposed setting enables us to distinguish between the global consistency of a set of agents and their individual consistency (where both can be a matter of degree). In particular, given a set of multiple agent possibilistic formulas, one can compute the subset of agents that are individually consistent to some degree

    SAT Competition 2020

    Get PDF
    The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition. (C) 2021 The Authors. Published by Elsevier B.V.Peer reviewe

    SAT Competition 2020

    Get PDF
    The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition

    Partitioning algorithms for induced subgraph problems

    Get PDF
    This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-hard problems that involve finding a large induced subgraph contained by each of two input graphs: the induced subgraph isomorphism problem and the maximum common induced subgraph problem. The MCSPLIT algorithms resemble forward-checking constrant programming algorithms, but use problem-specific data structures that allow multiple, identical domains to be stored without duplication. These data structures enable fast, simple constraint propagation algorithms and very fast calculation of upper bounds. Versions of these algorithms for both sparse and dense graphs are described and implemented. The resulting algorithms are over an order of magnitude faster than the best existing algorithm for maximum common induced subgraph on unlabelled graphs, and outperform the state of the art on several classes of induced subgraph isomorphism instances. A further advantage of the MCSPLIT data structures is that variables and values are treated identically; this allows us to choose to branch on variables representing vertices of either input graph with no overhead. An extensive set of experiments shows that such two-sided branching can be particularly beneficial if the two input graphs have very different orders or densities. Finally, we turn from subgraphs to supergraphs, tackling the problem of finding a small graph that contains every member of a given family of graphs as an induced subgraph. Exact and heuristic techniques are developed for this problem, in each case using a MCSPLIT algorithm as a subroutine. These algorithms allow us to add new terms to two entries of the On-Line Encyclopedia of Integer Sequences
    corecore