000 | 03972nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-48855-2 | ||
003 | DE-He213 | ||
005 | 20240423132546.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540488552 _9978-3-540-48855-2 |
||
024 | 7 |
_a10.1007/10703163 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aComputer Science Logic _h[electronic resource] : _b12th International Workshop, CSL'98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings / _cedited by Georg Gottlob, Etienne Grandjean, Katrin Seyr. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aX, 442 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1584 |
|
505 | 0 | _aInvited Papers -- Trakhtenbrot Theorem and Fuzzy Logic -- Descriptive Complexity, Lower Bounds and Linear Time -- Testing of Finite State Systems -- Contributed Papers -- On the Power of Quantifiers in First-Order Algebraic Specification -- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases -- Revision Programming = Logic Programming + Integrity Constraints -- Quantifiers and the System KE: Some Surprising Results -- Choice Construct and Lindström Logics -- Monadic NP and Graph Minors -- Invariant Definability and P/poly -- Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures -- An Upper Bound for Minimal Resolution Refutations -- On an Optimal Deterministic Algorithm for SAT -- Characteristic Properties of Majorant-Computability Over the Reals -- Theorems of Péter and Parsons in Computer Programming -- Kripke, Belnap, Urquhart and Relevant Decidability & Complexity -- Existence and Uniqueness of Normal Forms in Pure Type Systems with ??-conversion -- Normalization of Typable Terms by Superdevelopments -- Subtyping Functional+Nonempty Record Types -- Monotone Fixed-Point Types and Strong Normalization -- Morphisms and Partitions of V-sets -- Computational Adequacy in an Elementary Topos -- Logical Relations and Inductive/Coinductive Types -- On the Complexity of H-Subsumption -- Complexity Classes and Rewrite Systems with Polynomial Interpretation -- RPO Constraint Solving Is in NP -- Quantifier Elimination in Fuzzy Logic -- Many-Valued First-Order Logics with Probabilistic Semantics. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMathematical logic. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aMathematical Logic and Foundations. |
700 | 1 |
_aGottlob, Georg. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aGrandjean, Etienne. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSeyr, Katrin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540659228 |
776 | 0 | 8 |
_iPrinted edition: _z9783662186176 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1584 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/10703163 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189105 _d189105 |