CSL B

29 papers

YearTitle / Authors
1999Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings
Georg Gottlob, Etienne Grandjean, Katrin Seyr
1998An Upper Bound for Minimal Resolution Refutations.
Hans Kleine Büning
1998Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie.".
Jacques Riche, Robert K. Meyer
1998Characteristic Properties of Majorant-Computability over the Reals.
Margarita V. Korovina, Oleg V. Kudinov
1998Choice Construct and Lindström Logics.
H. Khanh Hoang
1998Complexity Classes and Rewrite Systems with Polynomial Interpretation.
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
1998Computational Adequacy in an Elementary Topos.
Alex K. Simpson
1998Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures.
Elena Pezzoli
1998Descriptive Complexity, Lower Bounds and Linear Time.
Thomas Schwentick
1998Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion.
Gilles Barthe
1998Invariant Definability and P/
Johann A. Makowsky
1998Logical Relations and Inductive/Coinductive Types.
Thorsten Altenkirch
1998Many-Valued First-Order Logics with Probabilistic Semantics.
Thomas Lukasiewicz
1998Monadic NP and Graph Minors.
Martin Kreidler, Detlef Seese
1998Monotone Fixed-Point Types and Strong Normalization.
Ralph Matthes
1998Morphisms and Partitions of V-sets.
Richard Statman
1998Normalization of Typable Terms by Superdevelopments.
Zurab Khasidashvili, Adolfo Piperno
1998On an Optimal Deterministic Algorithm for SAT.
Zenon Sadowski
1998On the Complexity of H-Subsumption.
Reinhard Pichler
1998On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases.
Fosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi
1998On the Power of Quantifers in First-Order Algebraic Specification.
David Kempe, Arno Schöegge
1998Quantifers and the System KE: Some Surprising Results.
Uwe Egly
1998Quantifier Elimination in Fuzzy Logic.
Matthias Baaz, Helmut Veith
1998RPO Constraint Solving Is in NP.
Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma
1998Revision Programming = Logic Programming + Integrity Constraints.
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski
1998Subtyping Functional+Nonempty Record Types.
Sergei G. Vorobyov
1998Testing for Finite State Systems.
Mihalis Yannakakis, David Lee
1998Theorems af Péter and Parsons in Computer Programming.
Ján Komara, Paul J. Voda
1998Trakhtenbrot Theorem and Fuzzy Logic.
Petr Hájek