12. CSL 1998: Brno, Czech Republic

Georg Gottlob, Etienne Grandjean, Katrin Seyr (Eds.): Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings. Lecture Notes in Computer Science 1584 Springer 1999, ISBN 3-540-65922-6 BibTeX

@proceedings{DBLP:conf/csl/1998,
  editor    = {Georg Gottlob and
               Etienne Grandjean and
               Katrin Seyr},
  title     = {Computer Science Logic, 12th International Workshop, CSL '98,
               Annual Conference of the EACSL, Brno, Czech Republic, August
               24-28, 1998, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1584},
  year      = {1999},
  isbn      = {3-540-65922-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

Petr Hájek: Trakhtenbrot Theorem and Fuzzy Logic. 1-8 BibTeX
Thomas Schwentick: Descriptive Complexity, Lower Bounds and Linear Time. 9-28 BibTeX
Mihalis Yannakakis, David Lee: Testing for Finite State Systems. 29-44 BibTeX

Contributed Papers

David Kempe, Arno Schöegge: On the Power of Quantifers in First-Order Algebraic Specification. 45-57 BibTeX
Fosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi: On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases. 58-72 BibTeX
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski: Revision Programming = Logic Programming + Integrity Constraints. 73-89 BibTeX
Uwe Egly: Quantifers and the System KE: Some Surprising Results. 90-104 BibTeX
H. Khanh Hoang: Choice Construct and Lindström Logics. 105-125 BibTeX
Martin Kreidler, Detlef Seese: Monadic NP and Graph Minors. 126-141 BibTeX
Johann A. Makowsky: Invariant Definability and P/poly. 142-158 BibTeX
Elena Pezzoli: Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures. 159-170 BibTeX
Hans Kleine Büning: An Upper Bound for Minimal Resolution Refutations. 171-178 BibTeX
Zenon Sadowski: On an Optimal Deterministic Algorithm for SAT. 179-187 BibTeX
Margarita V. Korovina, Oleg V. Kudinov: Characteristic Properties of Majorant-Computability over the Reals. 188-203 BibTeX
Ján Komara, Paul J. Voda: Theorems af Péter and Parsons in Computer Programming. 204-223 BibTeX
Jaques Riche, Robert K. Meyer: Belnap, Urquhart and Relevant Decidability & Complexity. ``Das ist nicht Mathematik, das ist Theologie.''. 224-240 BibTeX
Gilles Barthe: Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion. 241-259 BibTeX
Zurab Khasidashvili, Adolfo Piperno: Normalization of Typable Terms by Superdevelopments. 260-282 BibTeX
Sergei G. Vorobyov: Subtyping Functional+Nonempty Record Types. 283-297 BibTeX
Ralph Matthes: Monotone Fixed-Point Types and Strong Normalization. 298-312 BibTeX
Richard Statman: Morphisms and Partitions of V-sets. 313-322 BibTeX
Alex K. Simpson: Computational Adequacy in an Elementary Topos. 323-342 BibTeX
Thorsten Altenkirch: Logical Relations and Inductive/Coinductive Types. 343-354 BibTeX
Reinhard Pichler: On the Complexity of H-Subsumption. 355-371 BibTeX
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet: Complexity Classes and Rewrite Systems with Polynomial Interpretation. 372-384 BibTeX
Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma: RPO Constraint Solving Is in NP. 385-398 BibTeX
Matthias Baaz, Helmut Veith: Quantifier Elimination in Fuzzy Logic. 399-414 BibTeX
Thomas Lukasiewicz: Many-Valued First-Order Logics with Probabilistic Semantics. 415-429 BibTeX