Essays about: "SAT solvers"

Showing result 1 - 5 of 12 essays containing the words SAT solvers.

  1. 1. Synthesis of Neural Networks using SAT Solvers

    University essay from Stockholms universitet/Institutionen för data- och systemvetenskap

    Author : Ludvig Warpe; August Johnson Palm; [2023]
    Keywords : Neural networks; Boolean satisfiability problems; SAT solvers;

    Abstract : Artificial neural networks (ANN) have found extensive use in solving real-world problems in recent years, where their exceptional information processing is the main advantage. Facing increasingly complex problems, there is a need to improve their information processing. READ MORE

  3. 2. Explainable Product Configuration for Telecom via Constraint Reasoning

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Paul Häusner; [2022]
    Keywords : ;

    Abstract : Product Configuration is one of the most successful applications of Artificial Intelligence and is widely adopted in industry. Nowadays,intelligent systems not only have to be able to generate outputs but these outputs are desired to be understandable and interpretable to humans. READ MORE

  4. 3. Feature Extraction from an SMT Problem

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Fredrik Wärngård; [2021]
    Keywords : ;

    Abstract : One way of solving complex satisfiability problems is by using the method of SMT(Satisfiability Modulo Theories). For satisfiability problems that are harder to solve than trivial ones, we could very well save ourselves a lot of time if we choose the most suitable solver immediately. READ MORE

  5. 4. On the Structure of Resolution Refutations Generated by Modern CDCL Solvers

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Johan Lindblad; [2019]
    Keywords : ;

    Abstract : Modern solvers for the Boolean satisfiability problem (SAT) that are based on conflict-driven clause learning (CDCL) are known to be able to solve some instances significantly more efficiently than older kinds of solvers such as ones using the Davis-Putnam-Logemann-Loveland (DPLL) algorithm. In addition to solving instances that can be satisfied, SAT solvers will implicitly generate proofs of unsatisfiability for formulae that are unsatisfiable. READ MORE

  6. 5. Study of efficient techniques for implementing a Pseudo-Boolean solver based on cutting planes

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Aleix Sacrest Gascon; [2017]
    Keywords : ;

    Abstract : Most modern SAT solvers are based on resolution and CNF representation. The performance of these has improved a great deal in the past decades. But still they have some drawbacks such as the slow efficiency in solving some compact formulas e.g. READ MORE