國立虎尾科技大學 |

Reachability Problems = 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Reachability Problems/ edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
Reminder of title:	15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /
other author:	Bell, Paul C.
Description:	XVIII, 165 p. 16 illus., 6 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Artificial Intelligence. -
Online resource:	https://doi.org/10.1007/978-3-030-89716-1
ISBN:	9783030897161

Reachability Problems = 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /
Reachability Problems15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /[electronic resource] :edited by Paul C. Bell, Patrick Totzke, Igor Potapov. - 1st ed. 2021. - XVIII, 165 p. 16 illus., 6 illus. in color.online resource. - Theoretical Computer Science and General Issues,130352512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-.

Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

ISBN: 9783030897161

Standard No.: 10.1007/978-3-030-89716-1doiSubjects--Topical Terms:

646849
Artificial Intelligence.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Reachability Problems = 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings /
LDR:02295nam a22004095i 4500 001 1059411
003 DE-He213
005 20220223055025.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030897161 $9 978-3-030-89716-1
024 7 $a 10.1007/978-3-030-89716-1 $2 doi
035 $a 978-3-030-89716-1
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Reachability Problems $h [electronic resource] : $b 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings / $c edited by Paul C. Bell, Patrick Totzke, Igor Potapov.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVIII, 165 p. 16 illus., 6 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 13035
505 0 $a Invited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-.
520 $a Chapter ‘Recent Advances on Reachability Problems for Valence Systems’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 2 4 $a Artificial Intelligence. $3 646849
650 0 $a Computer science. $3 573171
650 0 $a Artificial intelligence. $3 559380
650 0 $a Software engineering. $3 562952
650 0 $a Computer engineering. $3 569006
650 0 $a Computer networks . $3 1365720
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Computer Engineering and Networks. $3 1365733
700 1 $a Bell, Paul C. $e editor. $1 https://orcid.org/0000-0003-2620-635X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361977
700 1 $a Totzke, Patrick. $e editor. $1 https://orcid.org/0000-0001-5274-8190 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361978
700 1 $a Potapov, Igor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 793384
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030897154
776 0 8 $i Printed edition: $z 9783030897178
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-89716-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)