LEADER 03383nam 22006375 450 001 996465329103316 005 20200705172937.0 010 $a3-540-68458-1 024 7 $a10.1007/BFb0028290 035 $a(CKB)1000000000234465 035 $a(SSID)ssj0000321692 035 $a(PQKBManifestationID)11246333 035 $a(PQKBTitleCode)TC0000321692 035 $a(PQKBWorkID)10280942 035 $a(PQKB)10458615 035 $a(DE-He213)978-3-540-68458-9 035 $a(PPN)15521411X 035 $a(EXLCZ)991000000000234465 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aBounded Incremental Computation$b[electronic resource] /$fby G. Ramalingam 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (XII, 196 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1089 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61320-X 327 $aOn incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions. 330 $aIncremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1089 606 $aAlgorithms 606 $aCombinatorics 606 $aComputers 606 $aOperating systems (Computers) 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputers. 615 0$aOperating systems (Computers). 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aComputation by Abstract Devices. 615 24$aOperating Systems. 676 $a004/.01/5114 700 $aRamalingam$b G$4aut$4http://id.loc.gov/vocabulary/relators/aut$0754223 906 $aBOOK 912 $a996465329103316 996 $aBounded Incremental Computation$92831521 997 $aUNISA LEADER 04641nam 22006135 450 001 996466137003316 005 20200701225016.0 010 $a3-540-45008-4 024 7 $a10.1007/10722086 035 $a(CKB)1000000000548797 035 $a(SSID)ssj0000321538 035 $a(PQKBManifestationID)11232826 035 $a(PQKBTitleCode)TC0000321538 035 $a(PQKBWorkID)10279782 035 $a(PQKB)10467648 035 $a(DE-He213)978-3-540-45008-5 035 $a(MiAaPQ)EBC3087414 035 $a(PPN)155196405 035 $a(EXLCZ)991000000000548797 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomated Reasoning with Analytic Tableaux and Related Methods$b[electronic resource] $eInternational Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings /$fedited by Roy Dyckhoff 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (X, 440 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v1847 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67697-X 320 $aIncludes bibliographical references. 327 $aInvited Lectures -- Tableau Algorithms for Description Logics -- Modality and Databases -- Local Symmetries in Propositional Logic -- Comparison -- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison -- Consistency Testing: The RACE Experience -- Benchmark Analysis with FaCT -- MSPASS: Modal Reasoning by Translation and First-Order Resolution -- TANCS-2000 Results for DLP -- Evaluating *SAT on TANCS 2000 Benchmarks -- Research Papers -- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations -- A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus -- An Analytic Calculus for Quantified Propositional Gödel Logic -- A Tableau Method for Inconsistency-Adaptive Logics -- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning -- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics -- Variants of First-Order Modal Logics -- Complexity of Simple Dependent Bimodal Logics -- Properties of Embeddings from Int to S4 -- Term-Modal Logics -- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics -- Dual Intuitionistic Logic Revisited -- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions -- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints -- Matrix-Based Inductive Theorem Proving -- Monotonic Preorders for Free Variable Tableaux -- The Mosaic Method for Temporal Logics -- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5 -- A Tableau Calculus for Equilibrium Entailment -- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory -- Tableau Calculus for Only Knowing and Knowing At Most -- A Tableau-Like Representation Framework for Efficient Proof Reconstruction -- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson?s Arithmetic Q -- System Descriptions -- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO -- E-SETHEO: An Automated3 Theorem Prover. 410 0$aLecture Notes in Artificial Intelligence ;$v1847 606 $aArtificial intelligence 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aArtificial intelligence. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 14$aArtificial Intelligence. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Formal Languages. 676 $a006.3/33 702 $aDyckhoff$b Roy$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTABLEAUX 2000 906 $aBOOK 912 $a996466137003316 996 $aAutomated Reasoning with Analytic Tableaux and Related Methods$9772640 997 $aUNISA