Computer science logic : 4th workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990 : proceedings
The workshop Computer Science Logic '90 was held at the Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL '89 at the University of Kaiserslautern (see LNCS 440), CSL '88 at the University of Duisberg (see LNCS 385), an...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
533 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Autre contributeur : Wolfgang Schönfeld (ed.) Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer science logic, 4th workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, proceedings, E. Börger, H. Kleine Büning, M. M. Richter ... [et al.] (eds), 1991, Berlin, Springer-Verlag, 1 vol. (viii-399 p.), Lecture notes in computer science, 3-540-54487-9 • Computer Science Logic, Texte imprimé, 9783662181416 |
Sumário:
- Monadic second order logic, tree automata and forbidden minors
- On the reduction theory for average case complexity
- From prolog algebras towards WAM-A mathematical study of implementation
- A formal operational semantics for languages of type Prolog III
- Efficiency considerations on goal-directed forward chaining for logic programs
- Decision problems for tarski and presburger arithmetics extended with sets
- A fast garbage collection algorithm for WAM based PROLOG
- A resolution variant deciding some classes of clause sets
- Subclasses of quantified boolean formulas
- Algorithmic proof with diminishing resources part 1
- Cutting plane versus frege proof systems
- RAM with compact memory: a realistic and robust model of computation
- Randomness and turing reducibility restraints
- Towards an efficient tableau proof procedure for multiple-valued logics
- Interactive proof systems: Provers, rounds, and error bounds
- Logics for belief dependence
- A generalization of stability and its application to circumscription of positive introspective knowledge
- The complexity of adaptive error-correcting codes
- Ramsey's theorem in bounded arithmetic
- Nontrivial lower bounds for some NP-problems on directed graphs
- Expansions and models of autoepistemic theories
- On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle
- On the tracking of loops in automated deductions
- The gap-language-technique revisited.