國立高雄大學圖資館 |

Language: English

Back

Efficient solving of large arithmeti...

Herde, Christian.

Efficient solving of large arithmetic constraint systems with complex Boolean structureproof engines for the analysis of hybrid discrete-continuous systems /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Efficient solving of large arithmetic constraint systems with complex Boolean structureby Christian Herde.
Reminder of title:	proof engines for the analysis of hybrid discrete-continuous systems /
Author:	Herde, Christian.
Published:	Wiesbaden :Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden,2011.
Description:	xvi, 163 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Automatic theorem proving.
Online resource:	http://dx.doi.org/10.1007/978-3-8348-9949-1
ISBN:	9783834899491 (electronic bk.)

Efficient solving of large arithmetic constraint systems with complex Boolean structureproof engines for the analysis of hybrid discrete-continuous systems /
Herde, Christian.

Efficient solving of large arithmetic constraint systems with complex Boolean structureproof engines for the analysis of hybrid discrete-continuous systems /[electronic resource] :by Christian Herde. - Wiesbaden :Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden,2011. - xvi, 163 p. :ill., digital ;24 cm.

ISBN: 9783834899491 (electronic bk.)Subjects--Topical Terms:

206222
Automatic theorem proving.

LC Class. No.: QA76.9.A96 / H47 2011

Dewey Class. No.: 004.015113

Efficient solving of large arithmetic constraint systems with complex Boolean structureproof engines for the analysis of hybrid discrete-continuous systems /
LDR:00866nmm 2200229 a 4500 001 294128
003 Springer
005 20110720162629.0
006 m d
007 cr nn 008maaau
008 110816s2011 gw s j eng d
020 $a 9783834899491 (electronic bk.)
020 $a 9783834814944 (paper)
035 $a 978-3-8348-1494-4
050 0 4 $a QA76.9.A96 $b H47 2011
082 0 4 $a 004.015113 $2 22
090 $a QA76.9.A96 $b H541 2011
100 1 $a Herde, Christian. $3 511516
245 1 0 $a Efficient solving of large arithmetic constraint systems with complex Boolean structure $h [electronic resource] : $b proof engines for the analysis of hybrid discrete-continuous systems / $c by Christian Herde.
260 $a Wiesbaden : $b Vieweg+Teubner Verlag / Springer Fachmedien Wiesbaden GmbH, Wiesbaden, $c 2011.
300 $a xvi, 163 p. : $b ill., digital ; $c 24 cm.
650 0 $a Automatic theorem proving. $3 206222
650 0 $a Constraints (Artificial intelligence) $3 239341
650 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Computer Science, general. $3 274540
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-8348-9949-1
950 $a Computer Science (Springer-11645)