Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer science logic : 12th international workshop, csl'98, annual conference of the eacsl, brno, czech republic, august 24-28, 1998, proceedings / / edited by 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 / / edited by Georg Gottlob, Etienne Grandjean, Katrin Seyr |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (X, 442 p.) |
| Disciplina | 004.015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer logic |
| ISBN | 3-540-48855-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910144420703321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer science logic : 12th international workshop, csl'98, annual conference of the eacsl, brno, czech republic, august 24-28, 1998, proceedings / / edited by 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 / / edited by Georg Gottlob, Etienne Grandjean, Katrin Seyr |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (X, 442 p.) |
| Disciplina | 004.015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer logic |
| ISBN | 3-540-48855-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465960903316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||