Satisfiability

Results: 637



#Item
51Planning as Satisfiability: Heuristics Jussi Rintanen Institute for Integrated and Intelligent Systems, Griffith University, Queensland, Australia Abstract Reduction to SAT is a very successful approach to solving hard c

Planning as Satisfiability: Heuristics Jussi Rintanen Institute for Integrated and Intelligent Systems, Griffith University, Queensland, Australia Abstract Reduction to SAT is a very successful approach to solving hard c

Add to Reading List

Source URL: pdfs.semanticscholar.org

- Date: 2015-07-28 20:07:32
    52Proofs in Satisfiability Modulo Theories Pascal Fontaine (Inria, Loria, U. Lorraine) SAT/SMT Summer School 2015 Stanford

    Proofs in Satisfiability Modulo Theories Pascal Fontaine (Inria, Loria, U. Lorraine) SAT/SMT Summer School 2015 Stanford

    Add to Reading List

    Source URL: www.cs.nyu.edu

    - Date: 2015-07-17 17:31:37
      53Journal on Satisfiability, Boolean Modeling and ComputationUniversal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories Francesco Alberti

      Journal on Satisfiability, Boolean Modeling and ComputationUniversal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories Francesco Alberti

      Add to Reading List

      Source URL: jsat.ewi.tudelft.nl

      - Date: 2011-12-31 10:54:19
        54Model-Constructing Satisfiability Calculus A Model-Based Approach to SMT Dejan Jovanović SRI International

        Model-Constructing Satisfiability Calculus A Model-Based Approach to SMT Dejan Jovanović SRI International

        Add to Reading List

        Source URL: www.cs.nyu.edu

        - Date: 2015-07-16 01:29:46
          55QCIR-G14: A Non-Prenex Non-CNF Format for Quantified Boolean Formulas QBF Gallery 2014 http://qbf.satisfiability.org/gallery/ April 8, 2014

          QCIR-G14: A Non-Prenex Non-CNF Format for Quantified Boolean Formulas QBF Gallery 2014 http://qbf.satisfiability.org/gallery/ April 8, 2014

          Add to Reading List

          Source URL: qbf.satisfiability.org

          - Date: 2014-08-18 10:39:39
            56Journal on Satisfiability, Boolean Modeling and Computation–76  DepQBF: A Dependency-Aware QBF Solver system description Florian Lonsing Armin Biere

            Journal on Satisfiability, Boolean Modeling and Computation–76 DepQBF: A Dependency-Aware QBF Solver system description Florian Lonsing Armin Biere

            Add to Reading List

            Source URL: jsat.ewi.tudelft.nl

            - Date: 2010-08-13 10:16:00
              57Microsoft Word - BlankPage

              Microsoft Word - BlankPage

              Add to Reading List

              Source URL: www.cs.miami.edu

              Language: English - Date: 2007-08-16 08:58:53
              58On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

              On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

              Add to Reading List

              Source URL: www.mancoosi.org

              Language: English - Date: 2012-12-16 04:54:55
              59Curriculum Vitae: Alexis C. Kaporis  Contact information Address :  Phone:

              Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

              Add to Reading List

              Source URL: students.ceid.upatras.gr

              Language: English - Date: 2006-02-09 03:56:19
              60CONTRIBUTED TALK ABSTRACTS 1.2  JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

              CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel

              Add to Reading List

              Source URL: www.fields.utoronto.ca

              Language: English - Date: 2011-07-27 15:26:23