DocumentCode
3171777
Title
An implementation of the Davis-Putnam procedure using network structures
Author
Yang, Hsin-Tai ; Wu, Chih-Hung ; Lee, Shie-Jue
Author_Institution
Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
Volume
5
fYear
1995
fDate
22-25 Oct 1995
Firstpage
4245
Abstract
The satisfiability (SAT) problem is an important topic in many AI applications, such as theorem proving, decision making, etc. One of the widely adopted approach for SAT problems is the Davis-Putnam procedure (1960). In this paper, we propose an implementation of the Davis-Putnam procedure based on the RETE-like network. By this way, we can gain much efficiency in both CPU time and memory usage
Keywords
artificial intelligence; computability; directed graphs; AI; CPU time efficiency; Davis-Putnam procedure; RETE-like network; decision making; memory usage efficiency; network structures; satisfiability problem; theorem proving; Artificial intelligence; Councils; Data structures; Decision making; Expert systems; Logic; Pattern matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-2559-1
Type
conf
DOI
10.1109/ICSMC.1995.538458
Filename
538458
Link To Document