Computer Science Logic: 12th International Workshop, CSL’98, by Petr Hájek (auth.), Georg Gottlob, Etienne Grandjean, Katrin

By Petr Hájek (auth.), Georg Gottlob, Etienne Grandjean, Katrin Seyr (eds.)

This publication constitutes the strictly refereed post-workshop complaints of the twelfth overseas Workshop on machine technological know-how good judgment, CSL '98, held because the Annual convention of the eu organization on desktop technological know-how good judgment in Brno, Czech Republic in August 1998.
The 25 revised complete papers offered have been conscientiously reviewed and chosen in the course of rounds of reviewing and revision. additionally integrated are 3 reviewed invited papers. The papers span the entire scope of computing device technology good judgment and mathematical foundations and characterize the state-of-the-art within the zone.

Show description

Read or Download Computer Science Logic: 12th International Workshop, CSL’98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998. Proceedings PDF

Similar computers books

Computer Vision – ACCV 2007: 8th Asian Conference on Computer Vision, Tokyo, Japan, November 18-22, 2007, Proceedings, Part II

The 2 quantity set LNCS 4843 and LNCS 4844 constitutes the refereed lawsuits of the eighth Asian convention on computing device imaginative and prescient, ACCV 2007, held in Tokyo, Japan, in November 2007. The forty six revised complete papers, three planary and invited talks, and a hundred thirty revised poster papers of the 2 volumes have been conscientiously reviewed and seleceted from 551 submissions.

Extra info for Computer Science Logic: 12th International Workshop, CSL’98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998. Proceedings

Example text

Fagin. Generalized first–order spectra and polynomial–time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43–73, 1974. 10 18. R. Fagin. Monadic generalized spectra. Zeitschrift f¨ ur Mathematische Logik und Grundlagen der Mathematik, 21:89–96, 1975. 10, 14 19. R. Fagin. Easier ways to win logical games. In Proceedings of the DIMACS Workshop on Finite Models and Descriptive Complexity. American Mathematical Society, 1997. 24 20. R. Fagin, L.

Book and Sheila A. Greibach. Quasi-realtime languages. Mathematical System Theory, 4(2):97–111, 1970. 20 7. R. B¨ uchi. Weak second-order arithmetic and finite automata. Z. Math. , 6:66–92, 1960. 22 8. Stephen A. Cook. A hierarchy for nondeterministic time complexity. Journal of Computer and System Sciences, 7(4):343–353, August 1973. 9 9. S. Cosmadakis. Logical reducibility and monadic NP. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 52–61, 1993. 23 10. M. de Rougemont. Second-order and inductive definability on finite structures.

Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic, 55(1):113–150, 1990. 14, 23 26 Thomas Schwentick 3. M. Ajtai, R. Fagin, and L. Stockmeyer. The closure of monadic NP. IBM Research Report RJ 10092, 1997. 24 4. Sanjeev Arora and Ronald Fagin. On winning strategies in Ehrenfeucht–Fra¨ıss´e games. Theoretical Computer Science, 174(1–2):97–121, 1997. 24 5. Theodore Baker, John Gill, and Robert Solovay. Relativizations of the P =? N P question. SIAM Journal on Computing, 4(4):431–442, December 1975.

Download PDF sample

Rated 4.73 of 5 – based on 42 votes