Complexity analysis of propositional resolution with autarky pruning (English)
- New search for: Gelder, Allen Van
- New search for: Gelder, Allen Van
In:
Discrete applied mathematics
;
96
; 195-222
;
1999
-
ISSN:
- Article (Journal) / Print
-
Title:Complexity analysis of propositional resolution with autarky pruning
-
Contributors:Gelder, Allen Van ( author )
-
Published in:Discrete applied mathematics ; 96 ; 195-222
-
Publisher:
- New search for: Elsevier
-
Place of publication:Amsterdam [u.a.]
-
Publication date:1999
-
ISSN:
-
ZDBID:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 31.12 / 31.80 / 31.12 / 31.80
- Further information on Basic classification
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 96
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Editorial(s)| 1999
- 3
-
Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)Battiti, Roberto et al. | 1999
- 29
-
Maximum renamable Horn sub-CNFsBoros, Endre et al. | 1999
- 41
-
Satisfiability threshold for random XOR-CNF formulasCreignou, Nadia et al. | 1999
- 55
-
Bidual Horn functions and extensionsEiter, Thomas et al. | 1999
- 55
-
Bidual Horn functions and extensions - optimal compressionEiter, T. / Ibaraki, T. / Makino, K. et al. | 1999
- 89
-
An algorithm for the class of pure implicational formulasFranco, John et al. | 1999
- 107
-
A remark on random 2-SATGoerdt, Andreas et al. | 1999
- 111
-
The Multi-SAT algorithmGu, Jun et al. | 1999
- 127
-
The complexity of the falsifiability problem for pure implicational formulasHeusch, Peter et al. | 1999
- 139
-
Resolution remains hard under equivalenceKleine Büning, Hans et al. | 1999
- 149
-
On a generalization of extended resolutionKullmann, O. et al. | 1999
- 177
-
The symmetry rule in propositional logicUrquhart, Alasdair et al. | 1999
- 195
-
Complexity analysis of propositional resolution with autarky pruningGelder, Allen Van et al. | 1999
- 223
-
Elliptic approximations of propositional formulaeMaaren, Hans van et al. | 1999
- 247
-
Accuracy of techniques for the logical analysis of dataAnthony, Martin et al. | 1999
- 259
-
From logical gates synthesis to chromatic bicritical cluttersBenzaken, C. et al. | 1999
- 307
-
Minimum self-dual decompositions of positive dual-minor Boolean functionsBioch, Jan C. et al. | 1999
- 327
-
Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraintsChiu, Steve Y. et al. | 1999
- 337
-
On connected Boolean functionsEkin, Oya et al. | 1999
- 363
-
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functionsGurvich, V. et al. | 1999
- 375
-
Best second order bounds for two-terminal network reliability with dependent edge failuresHansen, Pierre et al. | 1999
- 395
-
Mixed logical-linear programmingHooker, J.N. et al. | 1999
- 443
-
Inner-core and outer-core functions of partially defined Boolean functionsMakino, Kazuhisa et al. | 1999
- 461
-
Semidefinite programming relaxations for the graph partitioning problemWolkowicz, Henry et al. | 1999
- 481
-
Index| 1999