Computer Science Logic 12th International Workshop, CSL'98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Gottlob, Georg (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Grandjean, Etienne (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Seyr, Katrin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
Έκδοση:1st ed. 1999.
Σειρά:Lecture Notes in Computer Science, 1584
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Invited 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.