SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Automated Reasoning

Volumn 15, Issue 3, 1995, Pages 359-383

Branching rules for satisfiability

(2) Hooker, J N a Vinay, V b

a CARNEGIE MELLON UNIVERSITY (United States)

b DRDO (India)

Author keywords

algorithms; branching; Jeroslaw Wang rule; satisfiability

Indexed keywords

EID: 0000427802 PISSN: 01687433 EISSN: 15730670 Source Type: Journal
DOI: 10.1007/BF00881805 Document Type: Article

Times cited : (92)

References (26)

1
- 84935431270
- Amini, M. M. and Racer, M.: A variable-depth-search heuristic for the generalized assignment problem, Management Science, to appear.

2
- 84935458507
- Technical report, 110, Universität Paderborn, Germany
- (1992) Report on a SAT Competition
- Böhm, H.¹

3
- 84935420207
- Cook, S. A.: The complexity of theorem-proving procedures, in Proc. 3rd Annual ACM Symp. on the Theory of Computing, 1971, pp. 151–158.

4
- 84935519127
- Crawford, J.: Problems contributed to DIMACS. For information contact Crawford at AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ, 07974-0636 USA, e-mail jc@research.att.com.

5
- 84881072062
- A computing procedure for quantification theory
- (1960) Journal of the ACM , vol.7 , pp. 201-215
- Davis, M.¹ Putnam, H.²

6
- 84935417660
- Dubois, O.: Problems contributed to DIMACS. For information contact Dubois at Laforia, CNRS-Université Paris 6, 4 place Jussieu, 75252 Paris cedex 05, France, e-mail dubois@laforia.ibp.fr.

7
- 84935416519
- Dubois, O., Andre, P., Boufkhad, Y., and Carlier, J.: SAT versus UNSAT, manuscript, Laforia, CNRS-Université Paris 6, 4 place Jussieu, 75252 Paris cedex 05, France, 1993, e-mail dubois@laforia.ibp.fr.

8
- 0000973460
- Problems and results on 3-chromatic hypergraphs and some related questions
- North-Holland, Amsterdam
- (1975) Infinite and Finite Sets
- Erdös, P.¹ Lovász, L.²

9
- 84893458679
- University of Pennsylvania, Philadelphia, PA, 19104 USA, CA
- (1993) Failed literals in the Davis-Putnam procedure for SAT
- Freeman, T.W.¹

10
- 84935510832
- Gallo, G. and Pretolani, D.: A new algorithm for the propositional satisfiability problem, report TR-3/90, Dip. di Informatica, Universitá di Pisa, Discrete Applied Mathematics, to appear.

11
- 0024701533
- Algorithms for testing the satisfiability of propositional formulae
- (1989) J. Logic programming , vol.7 , pp. 45-61
- Gallo, G.¹ Urbani, G.²

12
- 0001596897
- Empirical analysis of heuristics
- Lawler, Lenstra, Rinnooy, Kan, Schmoys, Wiley, New York
- (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , pp. 207-249
- Golden, B.L.¹ Stewart, W.R.²

13
- 0001676868
- A computational study of sastifiability algorithms for propositional logic
- (1994) ORSA Journal on Computing , vol.6 , pp. 423-435
- Harche, F.¹ Hooker, J.N.² Thompson, G.³

14
- 0001157019
- Needed: An empirical science of algorithms
- (1994) Operations Research , vol.42 , pp. 201-212
- Hooker, J.N.¹

15
- 0000675599
- Branch and cut solution of inference problems in propositional logic
- (1990) Annals of Mathematics and AI , vol.1 , pp. 123-139
- Hooker, J.N.¹ Fedjki, C.²

16
- 84935471190
- Iwama, K., Albeta, H., and Miyano, E.: Random generation of satisfiable and unsatisfiable CNF predicates, in Proc. of 12th IFIP World Computer Congress, 1992, pp. 322–328. For further information contact Eiji Miyano, Dept. of Computer Science and Communication Engineering, Kyushu University, Fukuoka 812, Japan, e-mail miyano@csce.kyushu-u.ac.jp.

17
- 0000234006
- Solving propositional satisfiability problems
- (1990) Annals of Mathematics and AI , vol.1 , pp. 167-187
- Jeroslow, R.¹ Wang, J.²

18
- 34249840942
- A continuous approach to inductive inference
- (1992) Mathematical Programming , vol.57 , pp. 215-238
- Kamath, A.¹ Karmarkar, N.² Ramakrishnan, K.³ Resende, M.⁴

19
- 0018661080
- Controlled experimental design for statistical comparison of integer programming algorithms
- (1980) Management Science , vol.25 , pp. 1258-1271
- Lin, B.W.¹ Rardin, R.L.²

20
- 0003720332
- North-Holland, Amsterdam
- (1978) Automated Theorem Proving: A Logical Basis
- Loveland, D.W.¹

21
- 84935487732
- Mitterreiter, I. and Radermacher, F. J.: Experiments on the running time behavior of some algorithms solving propositional logic problems, manuscript, Forschungsinstitut für anwendungsorientierte Wissensverarbeitung, Ulm, Germany, 1991.

22
- 0003578580
- Marcel Dekker, New York
- (1985) Design and Analysis of Experiments
- Petersen, R.G.¹

23
- 84935518261
- Pretolani, D.: Efficiency and stability of hypergraph SAT algorithms, manuscript, Dip. di Informatica, Univ. di Pisa, Corso Itali 40, 56125 Pisa, Italy. For information on problems contact e-mail pretola@di.unipi.it.

24
- 84935419279
- Spencer, J.: Ten Lectures on the Probabilistic Method, Regional Conference Series in Applied Mathematics 52, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1987.

25
- 84935481251
- Van Gelder, A. and Tsuji, Y. K.: Satisfiability testing with more reasoning and less guessing, manuscript, University of California, Santa Cruz, CA, USA, 1994. For information on problems contact e-mail avg@cs.ucsc.edu or tsuji@cs.ucsc.edu.

26
- 0025238253
- Compact normal forms in propositional logic and integer programming formulations
- (1990) Computers and Operations Research , vol.90 , pp. 309-314
- Wilson, J.M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.