-
1
-
-
0035209101
-
Faster sat and smaller bdds via common function structure
-
Fadi Aloul, Igor Markov, and Karem Sakallah. Faster sat and smaller bdds via common function structure. In ICCAD'O1
-
ICCAD'O1
-
-
Aloul, F.1
Markov, I.2
Sakallah, K.3
-
2
-
-
84880803815
-
-
http://www.eecs.umich.cdurfaloul/benchmarks.html.
-
-
-
-
3
-
-
0001958310
-
Counting models using connected components
-
Roberto Bayardo and Joseph Pehoushek. Counting models using connected components. In AAAI'00.
-
AAAI'00
-
-
Bayardo, R.1
Pehoushek, J.2
-
4
-
-
84937409052
-
Using recursive decomposition to construct elimination orders, jointrees and dtrees
-
Trends in Artificial Intelligence, Springer-Verlag
-
Adnan Darwichc and Mark Hopkins. Using recursive decomposition to construct elimination orders, jointrees and dtrees. In Trends in Artificial Intelligence, Lecture notes in AI, 2143, pages 180 191. Springer-Verlag, 2001.
-
(2001)
Lecture Notes in AI
, vol.2143
, pp. 180-191
-
-
Darwichc, A.1
Hopkins, M.2
-
5
-
-
0035250750
-
Recursive conditioning
-
Adnan Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001.
-
(2001)
Artificial Intelligence
, vol.126
, Issue.1-2
, pp. 5-41
-
-
Darwiche, A.1
-
6
-
-
84880811696
-
A compiler for deterministic decomposable negation normal form
-
Adnan Darwiche. A compiler for deterministic decomposable negation normal form. In AAA! '02.
-
AAA! '02
-
-
Darwiche, A.1
-
7
-
-
84881072062
-
A computing procedure for quantification theory
-
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. JACM, 7:201-215, 1960.
-
(1960)
JACM
, vol.7
, pp. 201-215
-
-
Davis, M.1
Putnam, H.2
-
8
-
-
84919401135
-
A machine program for theorem proving
-
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. JACM, (5)7:394-397, 1962.
-
(1962)
JACM
, vol.7
, Issue.5
, pp. 394-397
-
-
Davis, M.1
Logemann, G.2
Loveland, D.3
-
9
-
-
84880775867
-
Directional resolution: The Davis-Putnam procedure
-
revisited.
-
Rina Dechter and Irina Rish. Directional resolution: The Davis-Putnam procedure, revisited. In KR '94.
-
KR '94
-
-
Dechter, R.1
Rish, I.2
-
10
-
-
0000076111
-
Heuristics based on unit propagation for satisfiability problems
-
Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In IJCAI' 97,
-
IJCAI' 97
-
-
Li, C.M.1
Anbulagan2
-
12
-
-
84880782500
-
-
http://www.lri.fr/'simon/satex.
-
-
-
-
13
-
-
84880781177
-
-
http://www.intellektik.informatik.tudarmstadt.de/SATLIB.
-
-
-
-
14
-
-
84880833022
-
Grasp a new search algorithm for satisfiability
-
Joao Silva and Karem Sakallah. Grasp a new search algorithm for satisfiability. In ICCAD'96.
-
ICCAD'96
-
-
Silva, J.1
Sakallah, K.2
-
15
-
-
84880768786
-
-
http://www.ee.princeton.edu/chaff/zchaff.php.
-
-
-
|