default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th CSL 1998: Brno, Czech Republic
- Georg Gottlob, Etienne Grandjean, Katrin Seyr:
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
Invited Papers
- Petr Hájek:
Trakhtenbrot Theorem and Fuzzy Logic. 1-8 - Thomas Schwentick:
Descriptive Complexity, Lower Bounds and Linear Time. 9-28 - Mihalis Yannakakis, David Lee:
Testing for Finite State Systems. 29-44
Contributed Papers
- David Kempe, Arno Schöegge:
On the Power of Quantifers in First-Order Algebraic Specification. 45-57 - Fosca Giannotti, Giuseppe Manco
, Mirco Nanni, Dino Pedreschi:
On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases. 58-72 - V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski:
Revision Programming = Logic Programming + Integrity Constraints. 73-89 - Uwe Egly:
Quantifers and the System KE: Some Surprising Results. 90-104 - H. Khanh Hoang:
Choice Construct and Lindström Logics. 105-125 - Martin Kreidler, Detlef Seese:
Monadic NP and Graph Minors. 126-141 - Johann A. Makowsky:
Invariant Definability and P/poly. 142-158 - Elena Pezzoli:
Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures. 159-170 - Hans Kleine Büning:
An Upper Bound for Minimal Resolution Refutations. 171-178 - Zenon Sadowski:
On an Optimal Deterministic Algorithm for SAT. 179-187 - Margarita V. Korovina, Oleg V. Kudinov:
Characteristic Properties of Majorant-Computability over the Reals. 188-203 - Ján Komara, Paul J. Voda:
Theorems af Péter and Parsons in Computer Programming. 204-223 - Jacques Riche, Robert K. Meyer:
Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie.". 224-240 - Gilles Barthe:
Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion. 241-259 - Zurab Khasidashvili, Adolfo Piperno:
Normalization of Typable Terms by Superdevelopments. 260-282 - Sergei G. Vorobyov:
Subtyping Functional+Nonempty Record Types. 283-297 - Ralph Matthes:
Monotone Fixed-Point Types and Strong Normalization. 298-312 - Richard Statman:
Morphisms and Partitions of V-sets. 313-322 - Alex K. Simpson:
Computational Adequacy in an Elementary Topos. 323-342 - Thorsten Altenkirch:
Logical Relations and Inductive/Coinductive Types. 343-354 - Reinhard Pichler:
On the Complexity of H-Subsumption. 355-371 - Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation. 372-384 - Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma:
RPO Constraint Solving Is in NP. 385-398 - Matthias Baaz, Helmut Veith:
Quantifier Elimination in Fuzzy Logic. 399-414 - Thomas Lukasiewicz:
Many-Valued First-Order Logics with Probabilistic Semantics. 415-429
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
