Computer science logic : 12th international workshop, CSL ’98 : annual conference of the EACSL, Brno, Czech Republic, August, 1998 : proceedings

Computer Science Logic: 12th International Workshop, CSL’98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998. Proceedings
Author: Georg Gottlob, Etienne Grandjean, Katrin Seyr
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-65922-8
DOI: 10.1007/10703163

Table of Contents:

• Trakhtenbrot Theorem and Fuzzy Logic
• Descriptive Complexity, Lower Bounds and Linear Time
• Testing of Finite State Systems
• 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

Includes bibliographical references