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 [[electronic resource] ] : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith
| Computer Science Logic [[electronic resource] ] : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 548 p. 64 illus.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Software engineering Machine theory Artificial intelligence Theory of Computation Programming Techniques Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence |
| ISBN |
1-280-38839-0
9786613566317 3-642-15205-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010. |
| Record Nr. | UNISA-996466570003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer science logic : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010 ; proceedings / / Anuj Dawar, Helmut Veith (eds.)
| Computer science logic : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010 ; proceedings / / Anuj Dawar, Helmut Veith (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2010 |
| Descrizione fisica | 1 online resource (XIV, 548 p. 64 illus.) |
| Disciplina | 004.015113 |
| Altri autori (Persone) |
DawarAnuj
VeithHelmut |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer logic
Logic, Symbolic and mathematical |
| ISBN |
1-280-38839-0
9786613566317 3-642-15205-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010. |
| Record Nr. | UNINA-9910482993203321 |
| Berlin ; ; New York, : Springer, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe
| How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVIII, 756 p. 42 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
| ISBN | 3-642-30870-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465321303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language, Information and Computation [[electronic resource] ] : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings / / edited by Anuj Dawar, Ruy de Queiroz
| Logic, Language, Information and Computation [[electronic resource] ] : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings / / edited by Anuj Dawar, Ruy de Queiroz |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 259 p. 28 illus.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Computer programming Computers Mathematical logic Computer logic Algorithms Programming Languages, Compilers, Interpreters Programming Techniques Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-38743-2
9786613565358 3-642-13824-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics -- A CTL-Based Logic for Program Abstractions -- Application of Logic to Integer Sequences: A Survey -- The Two-Variable Fragment with Counting Revisited -- Intuitionistic Logic and Computability Theory -- Foundations of Satisfiability Modulo Theories -- Logical Form as a Determinant of Cognitive Processes -- Formal Lifetime Reliability Analysis Using Continuous Random Variables -- Modal Logics with Counting -- Verification of the Completeness of Unification Algorithms à la Robinson -- Mechanisation of PDA and Grammar Equivalence for Context-Free Languages -- On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations -- Decidability and Undecidability Results on the Modal ?-Calculus with a Natural Number-Valued Semantics -- Solving the Implication Problem for XML Functional Dependencies with Properties -- On Anaphora and the Binding Principles in Categorial Grammar -- Feasible Functions over Co-inductive Data -- Interval Valued Fuzzy Coimplication -- Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures -- Intersection Type Systems and Explicit Substitutions Calculi -- Generalising Conservativity. |
| Record Nr. | UNISA-996465619303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, language, information and computation : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010 : proceedings / / Anuj Dawar, Ruy de Queiroz (eds.)
| Logic, language, information and computation : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010 : proceedings / / Anuj Dawar, Ruy de Queiroz (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (X, 259 p. 28 illus.) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
DawarAnuj
QueirozRuy J. G. B. de |
| Collana |
LNCS sublibrary. SL 7, Artificial intelligence
Lecture notes in artificial intelligence |
| Soggetto topico | Logic, Symbolic and mathematical |
| ISBN |
1-280-38743-2
9786613565358 3-642-13824-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics -- A CTL-Based Logic for Program Abstractions -- Application of Logic to Integer Sequences: A Survey -- The Two-Variable Fragment with Counting Revisited -- Intuitionistic Logic and Computability Theory -- Foundations of Satisfiability Modulo Theories -- Logical Form as a Determinant of Cognitive Processes -- Formal Lifetime Reliability Analysis Using Continuous Random Variables -- Modal Logics with Counting -- Verification of the Completeness of Unification Algorithms à la Robinson -- Mechanisation of PDA and Grammar Equivalence for Context-Free Languages -- On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations -- Decidability and Undecidability Results on the Modal ?-Calculus with a Natural Number-Valued Semantics -- Solving the Implication Problem for XML Functional Dependencies with Properties -- On Anaphora and the Binding Principles in Categorial Grammar -- Feasible Functions over Co-inductive Data -- Interval Valued Fuzzy Coimplication -- Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures -- Intersection Type Systems and Explicit Substitutions Calculi -- Generalising Conservativity. |
| Record Nr. | UNINA-9910484385903321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||