scholarly journals Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms

2020 ◽  
Vol 34 (02) ◽  
pp. 1918-1925 ◽  
Author(s):  
Ulle Endriss
Keyword(s):  
Classical Result ◽  
Sufficient Conditions ◽  
Sat Solving ◽  
Basic Notion ◽  
Axiomatic Analysis ◽  
Preservation Theorem ◽  
Powerful Approach ◽  
Sat Solver ◽  
Matching Mechanism ◽  
Central Result

We develop a powerful approach that makes modern SAT solving techniques available as a tool to support the axiomatic analysis of economic matching mechanisms. Our central result is a preservation theorem, establishing sufficient conditions under which the possibility of designing a matching mechanism meeting certain axiomatic requirements for a given number of agents carries over to all scenarios with strictly fewer agents. This allows us to obtain general results about matching by verifying claims for specific instances using a SAT solver. We use our approach to automatically derive elementary proofs for two new impossibility theorems: (i) a strong form of Roth's classical result regarding the impossibility of designing mechanisms that are both stable and strategyproof and (ii) a result establishing the impossibility of guaranteeing stability while also respecting a basic notion of cross-group fairness (so-called gender-indifference).

scholarly journals Dolius: A Distributed Parallel SAT Solving Framework

10.29007/hvqt ◽  
2018 ◽  
Author(s):  
Gilles Audemard ◽  
Benoît Hoessen ◽  
Saïd Jabbour ◽  
Cédric Piette
Keyword(s):  
Shared Memory ◽  
State Of The Art ◽  
Divide And Conquer ◽  
Sat Solving ◽  
Sat Solvers ◽  
Sat Solver

Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running several times the same solver with different parameters. In this paper, we propose a tool called Dolius, mainly based on the divide and conquer paradigm. In contrast to most current parallel efficient engines, Dolius does not need shared memory, can be distributed, and scales well when a large number of computing units is available. Furthermore, our tool contains an API allowing to plug any SAT solver in a simple way.

Semigroup Compactifications of Direct and Semidirect Products

1983 ◽  
Vol 26 (2) ◽  
pp. 233-240 ◽  
Author(s):  
Paul Milnes
Keyword(s):  
Direct Product ◽  
Semidirect Product ◽  
Classical Result ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Direct Products ◽  
Almost Periodic ◽  
Semidirect Products ◽  
Semigroup Compactifications ◽  
Necessary And Sufficient

AbstractA classical result of I. Glicksberg and K. de Leeuw asserts that the almost periodic compactification of a direct product S × T of abelian semigroups with identity is (canonically isomorphic to) the direct product of the almost periodic compactiflcations of S and T. Some efforts have been made to generalize this result and recently H. D. Junghenn and B. T. Lerner have proved a theorem giving necessary and sufficient conditions for an F-compactification of a semidirect product S⊗σT to be a semidirect product of compactiflcations of S and T. A different such theorem is presented here along with a number of corollaries and examples which illustrate its scope and limitations. Some behaviour that can occur for semidirect products, but not for direct products, is exposed

An integral representation for a generalised variation of a function

1974 ◽  
Vol 11 (2) ◽  
pp. 225-229 ◽  
Author(s):  
A.M. Russell
Keyword(s):  
Integral Representation ◽  
Classical Result ◽  
Closed Interval ◽  
Sufficient Conditions ◽  
Variation Of A Function ◽  
Image Position

In this note we present sufficient conditions for the continuity of the total kth variation of a function defined on a closed interval [a, b]. We also give an integral representation for total feth variation, thus obtaining an extension of the classical result

scholarly journals SAT solving experiments in Vampire

10.29007/5l47 ◽  
2018 ◽  
Author(s):  
Armin Biere ◽  
Ioan Dragan ◽  
Laura Kovács ◽  
Andrei Voronkov
Keyword(s):  
State Of The Art ◽  
Theorem Prover ◽  
Sat Solving ◽  
First Order ◽  
Automated Theorem Prover ◽  
Sat Solver ◽  
Overall Performance

In order to better understand how well a state of the art SAT solver would behave in the framework of a first-order automated theorem prover we have decided to integrate Lingeling, best performing SAT solver, inside Vampire’s AVATAR framework. In this paper we propose two ways of integrating a SAT solver inside of Vampire and evaluate overall performance of this combination. Our experiments show that by using a state of the art SAT solver in Vampire we manage to solve more problems. Surprisingly though, there are cases where combination of the two solvers does not always prove to generate best results.

Unique Extension and Product Measures

1967 ◽  
Vol 19 ◽  
pp. 757-763 ◽  
Author(s):  
Norman Y. Luther
Keyword(s):  
Classical Result ◽  
Sufficient Conditions ◽  
Finite Measure ◽  
Necessary And Sufficient Conditions ◽  
Product Measure ◽  
Unique Extension ◽  
Product Measures ◽  
Image Position ◽  
Necessary And Sufficient ◽  
Finite Measures

Following (2) we say that a measure μ on a ring is semifinite ifClearly every σ-finite measure is semifinite, but the converse fails.In § 1 we present several reformulations of semifiniteness (Theorem 2), and characterize those semifinite measures μ on a ring that possess unique extensions to the σ-ring generated by (Theorem 3). Theorem 3 extends a classical result for σ-finite measures (3, 13.A). Then, in § 2, we apply the results of § 1 to the study of product measures; in the process, we compare the “semifinite product measure” (1; 2, pp. 127ff.) with the product measure described in (4, pp. 229ff.), finding necessary and sufficient conditions for their equality; see Theorem 6 and, in relation to it, Theorem 7.

Chapter 9. Preprocessing in SAT Solving

2021 ◽  
Author(s):  
Armin Biere ◽  
Matti Järvisalo ◽  
Benjamin Kiesl
Keyword(s):  
Normal Form ◽  
Conjunctive Normal Form ◽  
Boolean Satisfiability ◽  
Sat Solving ◽  
Speed Up ◽  
Sat Solver ◽  
Main Ideas ◽  
Simplification Techniques

Preprocessing has become a key component of the Boolean satisfiability (SAT) solving workflow. In practice, preprocessing is situated between the encoding phase and the solving phase, with the aim of decreasing the total solving time by applying efficient simplification techniques on SAT instances to speed up the search subsequently performed by a SAT solver. In this chapter, we overview key preprocessing techniques proposed in the literature. While the main focus is on techniques applicable to formulas in conjunctive normal form (CNF), we also selectively cover main ideas for preprocessing structural and higher-level SAT instance representations.

Aubry set for asymptotically sub-additive potentials

2016 ◽  
Vol 16 (02) ◽  
pp. 1660009 ◽  
Author(s):  
Eduardo Garibaldi ◽  
João Tiago Assunção Gomes
Keyword(s):  
Dynamical Systems ◽  
Spectral Radius ◽  
Sufficient Conditions ◽  
Optimization Theory ◽  
Joint Spectral Radius ◽  
Maximum Value ◽  
Ergodic Optimization ◽  
Aubry Set ◽  
Central Result ◽  
Topological Dynamical Systems

Given a topological dynamical systems [Formula: see text], consider a sequence of continuous potentials [Formula: see text] that is asymptotically approached by sub-additive families. In a generalized version of ergodic optimization theory, one is interested in describing the set [Formula: see text] of [Formula: see text]-invariant probabilities that attain the following maximum value [Formula: see text] For this purpose, we extend the notion of Aubry set, denoted by [Formula: see text]. Our central result provides sufficient conditions for the Aubry set to be a maximizing set, i.e. [Formula: see text] belongs to [Formula: see text] if, and only if, its support lies on [Formula: see text]. Furthermore, we apply this result to the study of the joint spectral radius in order to show the existence of periodic matrix configurations approaching this value.

scholarly journals Tuning Parallel SAT Solvers

10.29007/z3g2 ◽  
2019 ◽  
Author(s):  
Thorsten Ehlers ◽  
Dirk Nowotka
Keyword(s):  
Model Checking ◽  
Database Management ◽  
Bounded Model Checking ◽  
Experimental Results ◽  
Massively Parallel ◽  
Sat Solving ◽  
Sat Solvers ◽  
Sat Solver ◽  
The Impact

In this paper we present new implementation details and benchmarking results for our parallel portfolio solver TopoSAT2. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1, 000 solver threads in parallel. Furthermore, we go back to the roots of portfolio SAT solving, and discuss the impact of diversifying the solver by using different restart- , branching- and clause database management heuristics. We show that these techniques can be used to tune the solver towards different problems. However, in a case study on formulas derived from Bounded Model Checking problems we see the best performance when using a rather simple clause exchange strategy. We show details of these tests and discuss possible explanations for this phenomenon.As computing times on massively-parallel clusters are expensive, we consider it especially interesting to share these kind of experimental results.

scholarly journals Community Structure in Industrial SAT Instances

2019 ◽  
Vol 66 ◽  
pp. 443-472
Author(s):  
Carlos Ansótegui ◽  
Maria Luisa Bonet ◽  
Jesús Giráldez-Cru ◽  
Jordi Levy ◽  
Laurent Simon
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Graph Model ◽  
Underlying Structure ◽  
Original Structure ◽  
Sat Solving ◽  
Random Graph Model ◽  
Sat Solvers ◽  
Sat Solver ◽  
Remarkable Progress

Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them. In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances.

scholarly journals Perfect matchings in graphs with prescribed local restrictions

2019 ◽  
Vol 63 (4) ◽  
pp. 408-420
Author(s):  
Pavel A. Irzhavski ◽  
Yury L. Orlovich
Keyword(s):  
Regular Graph ◽  
Classical Result ◽  
Perfect Matching ◽  
Sufficient Conditions ◽  
Perfect Matchings

A graph is called K1,p-restricted (p ≥ 3) if for every vertex of the graph there are at least p - 2 edges between any p neighbours of the vertex. In this article, new sufficient conditions for existence of a perfect matching in K1,p-restricted graphs are established. In particular, J. Petersen’s classical result that every 2-edge connected 3-regular graph contains a perfect matching follows from these conditions.

Sign in / Sign up

Export Citation Format

Share Document