GRASP—A New Search Algorithm for Satisfiability (1185834), страница 5
Текст из файла (страница 5)
Dissertation, Department of ComputerScience, Stanford University, STAN-CS-90-1302, February1990.T. Schiex and G. Verfaillie, “Nogood Recording for Static andDynamic Constraint Satisfaction Problems,” in Proceedings ofthe International Conference on Tools with Artificial Intelligence,pp. 48-55, 1993.M. H. Schulz and E. Auth, “Improved Deterministic Test Pattern Generation with Applications to Redundancy Identification,” IEEE Transactions on Computer-Aided Design, vol.
8, no.7, pp. 811-816, July 1989.J. P. M. Silva and K. A. Sakallah, “Dynamic Search-SpacePruning Techniques in Path Sensitization,” in Proc. IEEE/ACM Design Automation Conference (DAC), pp. 705-711, June1994, San Diego, California.J. P. M. Silva, Search Algorithms for Satisfiability Problems inCombinational Switching Circuits, Ph.D. Dissertation, Department of Electrical Engineering and Computer Science, University of Michigan, May 1995.J. P. M. Silva and K.
A. Sakallah, “GRASP—A New SearchAlgorithm for Satisfiability,” Technical Report TR-CSE-29296, University of Michigan, April 1996.R. M. Stallman and G. J. Sussman, “Forward Reasoning andDependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis,” Artificial Intelligence, vol. 9, pp.135-196, October 1977.P. R. Stephan, R. K. Brayton and A. L.
Sangiovanni-Vincentelli, “Combinational Test Generation Using Satisfiability,”Memorandum no. UCB/ERL M92/112, Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, October 1992.R. Zabih and D. A. McAllester, “A Rearrangement SearchStrategy for Determining Propositional Satisfiability,” in Proceedings of the National Conference on Artificial Intelligence, pp.155-160, 1988..
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
