Computer science logic : 12th international workshop, CSL '98 : [7th] annual conference of the EACSL, Brno, Czech Republic, August, 1998 : proceedings
Сохранить в:
| Корпоративные авторы: | , |
|---|---|
| Другие авторы: | , , |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
1584 |
| Предметы: | |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
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, 12th international workshop, CSL '98, annual conference of the EACSL, Brno, Czech Republic, August, 1998, proceedings, Georg Gottlob, Etienne Grandjean, Katrin Seyr (eds.), 1999, Berlin, Springer, 1 vol. (X-429 p.), Lecture notes in computer science, 3-540-65922-6 • Computer Science Logic, Texte imprimé, 9783662186176 |
Оглавление:
- Invited Papers
- Trakhtenbrot Theorem and Fuzzy Logic
- Descriptive Complexity, Lower Bounds and Linear Time
- Testing of Finite State Systems
- Contributed Papers
- On the Power of Quantifiers in First-Order Algebraic Specification
- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases
- Revision Programming = Logic Programming + Integrity Constraints
- Quantifiers and the System KE: Some Surprising Results
- Choice Construct and Lindström Logics
- Monadic NP and Graph Minors
- Invariant Definability and P/poly
- Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures
- An Upper Bound for Minimal Resolution Refutations
- On an Optimal Deterministic Algorithm for SAT
- Characteristic Properties of Majorant-Computability Over the Reals
- Theorems of Péter and Parsons in Computer Programming
- Kripke, Belnap, Urquhart and Relevant Decidability & Complexity
- Existence and Uniqueness of Normal Forms in Pure Type Systems with ??-conversion
- Normalization of Typable Terms by Superdevelopments
- Subtyping Functional+Nonempty Record Types
- Monotone Fixed-Point Types and Strong Normalization
- Morphisms and Partitions of V-sets
- Computational Adequacy in an Elementary Topos
- Logical Relations and Inductive/Coinductive Types
- On the Complexity of H-Subsumption
- Complexity Classes and Rewrite Systems with Polynomial Interpretation
- RPO Constraint Solving Is in NP
- Quantifier Elimination in Fuzzy Logic
- Many-Valued First-Order Logics with Probabilistic Semantics.