Georg Gottlob, Etienne Grandjean, Katrin Seyr
Proceedings of the 12th International Workshop on Computer Science Logic / Annual Conference of the EACSL
CSL, 1998.

@proceedings{CSL-1998,
	address       = "Brno, Czech Republic",
	editor        = "Georg Gottlob and Etienne Grandjean and Katrin Seyr",
	isbn          = "3-540-65922-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th International Workshop on Computer Science Logic / Annual Conference of the EACSL}",
	volume        = 1584,
	year          = 1998,
}

Contents (28 items)

6 ×#logic
5 ×#complexity
4 ×#on the
3 ×#normalisation
2 ×#bound
2 ×#constraints
2 ×#finite
2 ×#first-order
2 ×#fuzzy
2 ×#semantics

CSL-1998-Hajek #fuzzy #logic #theorem

Trakhtenbrot Theorem and Fuzzy Logic (PH), pp. 1–8.

CSL-1998-Schwentick #bound #complexity #linear

Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.

CSL-1998-YannakakisL #finite #testing

Testing for Finite State Systems (MY, DL), pp. 29–44.

CSL-1998-KempeS #algebra #first-order #on the #power of #specification

On the Power of Quantifers in First-Order Algebraic Specification (DK, AS), pp. 45–57.

CSL-1998-GiannottiMNP #database #effectiveness #logic #nondeterminism #on the #semantics

On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases (FG, GM, MN, DP), pp. 58–72.

CSL-1998-MarekPT #constraints #logic programming

Revision Programming = Logic Programming + Integrity Constraints (VWM, IP, MT), pp. 73–89.

CSL-1998-Egly

Quantifers and the System KE: Some Surprising Results (UE), pp. 90–104.

CSL-1998-Hoang #logic

Choice Construct and Lindström Logics (HKH), pp. 105–125.

CSL-1998-KreidlerS #graph #monad

Monadic NP and Graph Minors (MK, DS), pp. 126–141.

CSL-1998-Makowsky #invariant

Invariant Definability and P/poly (JAM), pp. 142–158.

CSL-1998-Pezzoli #complexity #finite #game studies

Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures (EP), pp. 159–170.

CSL-1998-Buning #bound

An Upper Bound for Minimal Resolution Refutations (HKB), pp. 171–178.

CSL-1998-Sadowski #algorithm #on the #satisfiability

On an Optimal Deterministic Algorithm for SAT (ZS), pp. 179–187.

CSL-1998-KorovinaK

Characteristic Properties of Majorant-Computability over the Reals (MVK, OVK), pp. 188–203.

CSL-1998-KomaraV #programming #theorem

Theorems af Péter and Parsons in Computer Programming (JK, PJV), pp. 204–223.

CSL-1998-RicheM #complexity #decidability

Belnap, Urquhart and Relevant Decidability & Complexity. “Das ist nicht Mathematik, das ist Theologie.” (JR, RKM), pp. 224–240.

CSL-1998-Barthe #normalisation #type system

Existence and Uniqueness of Normal Forms in Pure Type Systems with βη-Conversion (GB), pp. 241–259.

CSL-1998-KhasidashviliP #normalisation

Normalization of Typable Terms by Superdevelopments (ZK, AP), pp. 260–282.

CSL-1998-Vorobyov #functional #type system

Subtyping Functional+Nonempty Record Types (SGV), pp. 283–297.

CSL-1998-Matthes #fixpoint #normalisation

Monotone Fixed-Point Types and Strong Normalization (RM), pp. 298–312.

CSL-1998-Statman #morphism

Morphisms and Partitions of V-sets (RS), pp. 313–322.

CSL-1998-Simpson

Computational Adequacy in an Elementary Topos (AKS), pp. 323–342.

CSL-1998-Altenkirch #induction #logic

Logical Relations and Inductive/Coinductive Types (TA), pp. 343–354.

CSL-1998-Pichler #complexity #on the

On the Complexity of H-Subsumption (RP), pp. 355–371.

CSL-1998-BonfanteCMT #complexity #polynomial #term rewriting

Complexity Classes and Rewrite Systems with Polynomial Interpretation (GB, AC, JYM, HT), pp. 372–384.

CSL-1998-NarendranRV #constraints #theorem proving

RPO Constraint Solving Is in NP (PN, MR, RMV), pp. 385–398.

CSL-1998-BaazV #fuzzy #logic #quantifier

Quantifier Elimination in Fuzzy Logic (MB, HV), pp. 399–414.

CSL-1998-Lukasiewicz #first-order #logic #probability #semantics

Many-Valued First-Order Logics with Probabilistic Semantics (TL), pp. 415–429.