000			01792nam a22004935i 4500
001			978-3-642-21581-0
003			DE-He213
005			20130515022216.0
007			cr nn 008mamaa
008			110610s2011 gw | s |||| 0|eng d
020			_a9783642215810 _9978-3-642-21581-0
024	7		_a10.1007/978-3-642-21581-0 _2doi
050		4	_aQA76.9.L63
050		4	_aQA76.5913
050		4	_aQA76.63
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
082	0	4	_a005.1015113 _223
100	1		_aSakallah, Karem A.
245	1	0	_aTheory and Applications of Satisfiability Testing - SAT 2011 _h[electronic resource] : _b14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings / _cedited by Karem A. Sakallah, Laurent Simon.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v6695
650		0	_aComputer science.
650		0	_aLogic design.
650		0	_aComputer software.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aLogic Design.
700	1		_aSimon, Laurent.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642215803
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6695
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-21581-0
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c85228 _d85228