Computer Science Logic 12th International Workshop, CSL'98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings / edited by Georg Gottlob, Etienne Grandjean, Katrin Seyr.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Gottlob, Georg (Editor), Grandjean, Etienne (Editor), Seyr, Katrin (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
Edition:	1st ed. 1999.
Series:	Lecture Notes in Computer Science, 1584 Springer eBook Collection.
Subjects:	Artificial intelligence. Mathematical logic. Programming languages (Electronic computers). Computer logic. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

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.

Similar Items