Boolean

Results: 2137



#Item
51

Boolean Evaluation with a Pairing and Unpairing Function Paul Tarau1 Brenda Luderman2

Add to Reading List

Source URL: logic.cse.unt.edu

- Date: 2012-09-29 04:27:11
    52

    Affine Functional Programs as Higher-order Boolean Circuits Damiano Mazza∗ CNRS, LIPN, Universit´e Paris 13, Sorbonne Paris Cit´e Implicit computational complexity. Loosely speakin

    Add to Reading List

    Source URL: conf.researchr.org

      53

      Solution Enumeration for Projected Boolean Search Problems Martin Gebser, Benjamin Kaufmann, and Torsten Schaub? Institut f¨ur Informatik, Universit¨at Potsdam, August-Bebel-Str. 89, DPotsdam, Germany Abstract.

      Add to Reading List

      Source URL: www.cs.uni-potsdam.de

      - Date: 2010-09-08 14:19:25
        54

        Journal on Satisfiability, Boolean Modeling and Computation Controlling a Solver Execution with the runsolver Tool system description Olivier Roussel

        Add to Reading List

        Source URL: jsat.ewi.tudelft.nl

        - Date: 2011-11-21 09:15:26
          55

          1 Non-deterministic Phase Semantics and the Undecidability of Boolean BI DOMINIQUE LARCHEY-WENDLING, LORIA – CNRS DIDIER GALMICHE, LORIA – University Henri Poincar´e We solve the open problem of the decidability of

          Add to Reading List

          Source URL: www.lsv.ens-cachan.fr

          - Date: 2014-03-15 21:53:30
            56

            Boolean Satisfiability (SAT) p1 p2 . .

            Add to Reading List

            Source URL: www.cs.tau.ac.il

            - Date: 2015-03-31 11:53:54
              57

              Journal on Satisfiability, Boolean Modeling and Computation–236 Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure∗ Martin Fr¨ anzle

              Add to Reading List

              Source URL: jsat.ewi.tudelft.nl

              - Date: 2007-05-22 16:56:57
                58

                Journal on Satisfiability, Boolean Modeling and ComputationPackUp: Tools for Package Upgradability Solving∗ system description Mikol´ aˇ

                Add to Reading List

                Source URL: jsat.ewi.tudelft.nl

                - Date: 2012-01-12 08:43:36
                  59

                  Input/Output Format and Solver Requirements for the Competitions of Pseudo-Boolean Solvers Olivier ROUSSEL Vasco M ANQUINHO

                  Add to Reading List

                  Source URL: www.cril.univ-artois.fr

                  - Date: 2012-11-12 12:21:31
                    60

                    Algebraic Polynomial-based Synthesis for Abstract Boolean Network Analysis Peter Backeman1,2 , Sara-Jane Dunn2 , Boyan Yordanov2 , and Christoph M. Wintersteiger2 1

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2016-06-22 02:47:46
                      UPDATE