io-port.net

io-port 05907438 Tveretina, Olga; Sinz, Carsten; Zantema, Hans

Ordered binary decision diagrams, pigeonhole formulas and beyond. (English)

J. Satisf. Boolean Model. Comput. 7, No. 1, 35-58 (2010).

1

PDF XML AMS-TeX TEXT BIBTeX

io-port 05907437 Jin, Jiwei; Zhao, Xishun

Resolution on quantified generalized clause-sets. (English)

J. Satisf. Boolean Model. Comput. 7, No. 1, 17-34 (2010).

2

PDF XML AMS-TeX TEXT BIBTeX

io-port 05907436 Langlois, Marina; Sloan, Robert H.; Turán, György

Horn upper bounds and renaming. (English)

J. Satisf. Boolean Model. Comput. 7, No. 1, 1-15 (2010).

3

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897039 Heras, Federico; Bañeres, David

The impact of Max-SAT resolution-based preprocessors on local search solvers. (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 89-126 (2010).

4

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897038 Giunchiglia, Enrico; Marin, Paolo; Narizzano, Massimo

QuBE7.0. (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 83-88 (2010).

5

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897037 Balint, Adrian; Gall, Daniel; Kapler, Gregor; Retz, Robert

Experiment design and administration for computer clusters for SAT-solvers (EDACC). (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 77-82 (2010).

6

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897036 Lonsing, Florian; Biere, Armin

DepQBF: A dependency-aware QBF solver. (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 71-76 (2010).

7

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897035 Pulina, Luca; Tacchella, Armando

AQME’10. (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 65-70 (2010).

8

PDF XML AMS-TeX TEXT BIBTeX

io-port 05897034 Le Berre, Daniel; Parrain, Anne

The Sat4j library, release 2.2. (English)

J. Satisf. Boolean Model. Comput. 7, No. 2-3, 59-64 (2010).

9

PDF XML AMS-TeX TEXT BIBTeX

io-port 05620837 Hamadi, Youssef; Jabbour, Said; Sais, Lakhdar

ManySAT: a parallel SAT solver. (English)

J. Satisf. Boolean Model. Comput. 6, No. 4, 245-262 (2009).

10

PDF XML AMS-TeX TEXT BIBTeX

io-port 05620836 Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka

Incorporating clause learning in grid-based randomized SAT solving. (English)

J. Satisf. Boolean Model. Comput. 6, No. 4, 223-244 (2009).

11

PDF XML AMS-TeX TEXT BIBTeX

io-port 05620835 Schubert, Tobias; Lewis, Matthew; Becker, Bernd

PaMiraXT: parallel SAT solving with threads and message passing. (English)

J. Satisf. Boolean Model. Comput. 6, No. 4, 203-222 (2009).

12

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613976 Brummayer, Robert; Biere, Armin

Lemmas on demand for the extensional theory of arrays. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 165-201 (2009).

13

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613975 Hertel, Alexander; Urquhart, Alasdair

Algorithms and complexity results for input and unit resolution. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 141-164 (2009).

14

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613973 Chu, Geoffrey; Harwood, Aaron; Stuckey, Peter J.

Cache conscious data structures for Boolean satisfiability solvers. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 99-120 (2009).

15

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613972 Gil, Luís; Flores, Paulo; Silveira, Luís Miguel

PMSat: a parallel version of MiniSAT. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 71-98 (2009).

16

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613971 Hirsch, Edward A.; Kojevnikov, Arist; Kulikov, Alexander S.; Nikolenko, Sergey I.

Complexity of semialgebraic proofs with restricted degree of falsity. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 53-69 (2009).

17

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613970 Gershman, Roman; Strichman, Ofer

{\sc HaifaSat}: a SAT solver based on an abstraction/refinement model. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 33-51 (2009).

18

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613969 Haus, Utz-Uwe; Truemper, Klaus; Weismantel, Robert

Linear satisfiability algorithm for 3CNF formulas of certain signaling networks. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 13-32 (2009).

19

PDF XML AMS-TeX TEXT BIBTeX

io-port 05613968 Szeider, Stefan

Matched formulas and backdoor sets. (English)

J. Satisf. Boolean Model. Comput. 6, No. 1-3, 1-12 (2009).

20

PDF XML AMS-TeX TEXT BIBTeX