top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
Autore Porkoláb Zoltán
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (398 pages)
Disciplina 005.11
Altri autori (Persone) ZsókViktória
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Software engineering
Compilers (Computer programs)
Computer science
Programming Techniques
Software Engineering
Compilers and Interpreters
Computer Science Logic and Foundations of Programming
ISBN 3-031-42833-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Main Lectures -- Writing Internet of Things Applications with Task Oriented Programming -- 1 Introduction -- 1.1 Internet of Things -- 1.2 Task Oriented Programming -- 1.3 iTask -- 1.4 TOP for the IoT -- 1.5 Structure of the Paper -- 2 mTask system architecture -- 2.1 Blink -- 2.2 Language -- 2.3 Class Based Shallow Embedding -- 2.4 DSL design -- 2.5 Backends -- 2.6 Bytecode -- 2.7 Skeleton -- 3 mTask language -- 3.1 Expressions -- 3.2 Functions -- 3.3 Basic Tasks -- 3.4 Parallel Task Combinators -- 3.5 Threaded Blinking -- 3.6 Sequential Task Combinators -- 3.7 Shared Data Source -- 3.8 Lifted Shared Data Sources -- 3.9 Interactive Blinking -- 3.10 Peripherals -- 4 IoT applications with TOP -- 4.1 Hardware and Client -- 4.2 Temperature -- 4.3 LED matrix -- 4.4 Temperature Plotter -- 5 Related Work -- 5.1 Interpretation -- 5.2 Task Oriented Programming -- 5.3 Functional Reactive Programming -- 5.4 Functional Programming -- 5.5 Multitasking -- 5.6 mTask history -- 6 Discussion -- A Embedded Domain Specific Language Techniques -- A.1 Deep Embedding -- A.2 Shallow Embedding -- B iTask reference -- B.1 Types -- B.2 Editors -- B.3 Task Combinators -- B.4 Shared Data Sources -- B.5 Extra Task Combinators -- B.6 Examples -- C How to Install -- C.1 Fetch the CEFP distribution -- C.2 Setup -- C.3 Compile the Test Program -- C.4 Setup the Microcontroller Unit -- D Solutions -- References -- Paint Your Programs Green: On the Energy Efficiency of Data Structures -- 1 Introduction -- 2 Data Structures Libraries -- 2.1 Haskell Data Structures -- 2.2 Java Data Structures -- 3 Experimental Setup -- 3.1 Haskell Operations -- 3.2 Java Operations -- 3.3 Measuring Energy Consumption -- 4 Comparing Data Structure Energy Consumption -- 4.1 Haskell Data Structures -- 4.2 Java Data Structures -- 5 Related Work.
6 Conclusions -- References -- Energy Efficient Software in an Engineering Course -- 1 Introduction -- 2 Energy Efficient Software in Higher Education -- 2.1 Sustainable Development and Its Dimentions -- 2.2 Sustainable Development in Higher Education -- 2.3 Energy Efficient Software in Higher Education -- 3 Software Analysis and Testing with a Green Flavor -- 3.1 Green Software: A Multidisciplinary Module -- 3.2 Green Software: Module Objectives -- 3.3 Green Software: Module Supporting Tools -- 4 Energy Efficent Software: Students Assessment -- 4.1 A Catalog of Energy Smells and Refactorings -- 4.2 Students Grades -- 5 Conclusions -- References -- Utilizing Rail Traffic Control Simulator in Verified Software Development Courses -- 1 Introduction -- 2 TD/TS2JC Toolset -- 2.1 Train Director -- 2.2 TS2JavaConn -- 2.3 Communication with Control Modules -- 3 Control Modules and Configuration Files -- 3.1 Non-parametric Module -- 3.2 Parametric Module -- 4 Teaching Verified Software Development in B-Method with TD/TS2JC Toolset -- 4.1 Software Development Process of B-Method -- 4.2 B-Language -- 4.3 Abstract Specification -- 4.4 Refinement to Implementation -- 4.5 Three Sections Control Module Development Project -- 5 Conclusion -- References -- The Role of Functional Programming in Management and Orchestration of Virtualized Network Resources -- 1 Introduction -- 2 Background -- 3 Network Evolution -- 3.1 Cloud Computing Platforms -- 3.2 Network Function Virtalisation and Software Defined Network -- 4 Management and Orchestration of Virtualized Network Resources -- 4.1 Design Principles for Implementing Autonomic Behavior -- 4.2 Current State -- 5 OpenStack -- 5.1 Graphical User Interface for Manipulating Virtual Resources -- 5.2 Authentification and Authorisation Functions -- 5.3 Management of Disk Images -- 5.4 Network Management Functions.
5.5 Management of Virtual Instances -- 5.6 Management of Persistent Memory -- 5.7 Management of Object Storage -- 5.8 Performance Measurement Functions -- 5.9 Orchestration Functions -- 6 Examples -- 6.1 Example 1 -- 6.2 Example 2 -- 6.3 Example 3 -- 6.4 Example 4 -- 7 Use Cases from Industry and Reflection on Design Principles -- 7.1 Virtualisation of Mobile Switching Centre -- 7.2 Management Functions for Reliable and Stable Operation -- 8 Discussion -- 9 Conclusion -- References -- Towards Better Tool Support for Code Comprehension -- 1 Introduction -- 2 Model of Code Comprehension -- 2.1 Top-Down Models -- 2.2 Bottom-Up Models -- 2.3 Other Approaches -- 2.4 The Role of Concept Location -- 3 Nature of the Problems -- 3.1 Growing Complexity -- 3.2 Knowledge Erosion -- 3.3 Multiple Views of the Software Based on Various Information Sources -- 3.4 Communication Barriers -- 3.5 Multiple Programming Languages -- 3.6 Hard to Deploy New Tools -- 3.7 Requirement of Open Extensibility -- 3.8 API Usage -- 4 State of the Art -- 5 The CodeCompass Architecture -- 5.1 Layers of the Architecture -- 5.2 Web User Interface -- 5.3 Language Server Protocol -- 5.4 Performance -- 6 Important Design Workflows -- 6.1 Bug Investigation -- 6.2 Feature Development Planning and Estimation -- 6.3 Refactoring -- 6.4 Knowledge Transfer and Newcomers' Catch-Up -- 7 User Acceptance in Real Production -- 8 Conclusion and Future Work -- References -- Balanced Distributed Computation Patterns -- 1 Introduction -- 2 Go Essentials -- 2.1 Syntax of Basic Language Elements -- 3 Concurrent Programming -- 3.1 Goroutine -- 3.2 WaitGroup -- 3.3 Mutual Exclusion -- 3.4 Channels -- 3.5 Select -- 3.6 Concurrency Principles -- 3.7 Parallelism -- 3.8 Concurrent Job Processing -- 4 Advanced Message Queueing Protocol (AMQP) -- 4.1 AMQP Components -- 4.2 Connection and Channel.
4.3 Safe Message Delivery in Go -- 4.4 Prefetch -- 4.5 AMQP at Network Failures -- 4.6 AMQP Management -- 4.7 AMQP Advantages -- 4.8 AMQP Usage -- 4.9 AMQP 0.9.1 Model -- 4.10 Go RabbitMQ Client Library -- 5 Distributed Programming -- 5.1 RabbitMQ Hello World -- 5.2 RabbitMQ Exchange -- 5.3 RabbitMQ Shared Queue -- 5.4 Parallel Receive -- 5.5 Distributed Job Processing -- 5.6 Distributed Pipeline -- 5.7 Distributed Divide and Conquer -- 6 Testing Performances -- 7 Related Work -- 8 Conclusion -- A Code Listings and Outputs -- A.1 Parallel Receive -- A.2 Distributed Job Processing with Shared Response Queue, Version2 -- A.3 Distributed Job Processing with Private Response Queue, Version3 -- A.4 Distributed Job Processing with Worker Generator, Version4 -- A.5 Distributed Pipeline with Connection Confirmation (Version 2) -- A.6 Distributed Pipeline with Worker Generator (Version 3) -- A.7 Distributed Divide and Conquer -- B Task for Readers -- References -- PhD Workshop -- Tunnel Parsing -- 1 Introduction -- 2 Parsing Overview -- 3 Problem -- 4 Tunnel Parsing Algorithm -- 4.1 Tunnels -- 4.2 Routers -- 4.3 Segments -- 4.4 Control Layer -- 5 Results -- 6 Conclusion -- References -- Finding Code Clone Refactoring Techniques by Mapping Clone Context -- 1 Introduction -- 2 Background and Related Work -- 2.1 Clone Context Analysis -- 2.2 Clone Refactoring -- 3 Context Analysis of Clones -- 3.1 Relation -- 3.2 Location -- 3.3 Contents -- 4 CloneRefactor -- 5 Experimental Setup -- 5.1 The Corpus -- 5.2 Tool Validation -- 6 Results -- 6.1 Relation -- 6.2 Location -- 6.3 Contents -- 7 Discussion -- 8 Conclusion -- References -- Code Quality Metrics for Functional Features in Modern Object-Oriented Languages -- 1 Introduction -- 2 Problem Analysis -- 3 Candidate Measures -- 3.1 Number of Lambda-Functions Used in a Class (LC) -- 3.2 Source Lines of Lambda (SLOL).
3.3 Lambda Score (LSc) -- 3.4 Number of Lambda-Functions Using Mutable Field Variables in a Class (LMFV) -- 3.5 Number of Lambda-Functions Using Mutable Local Variables in a Class (LMLV) -- 3.6 Number of Lambda-Functions with Side-Effects Used in a Class (LSE) -- 3.7 Number of Non-terminated Collection Queries in a Class (UTQ) -- 4 Experimental Setup -- 4.1 Methodology -- 4.2 Relating Functional Constructs to Error-Proneness -- 4.3 Measuring Functional Constructs -- 4.4 Measuring Error-Proneness -- 4.5 Dataset -- 5 Experimental Evaluation -- 6 Threats to Validity -- 7 Related Work -- 8 Conclusion and Discussion -- References -- An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms -- 1 Introduction -- 2 Related Work -- 2.1 Energy Complexity Model -- 2.2 Empirical Studies on Cache Efficiency -- 2.3 Empirical Studies on Energy Efficiency -- 3 Algorithms for Matrix Transposition -- 4 Methodology and Experimental Setup -- 4.1 Experimental Setup -- 4.2 Performance Counter Measurement Tools -- 4.3 Intermediate Machine Code Generation Tool -- 5 Experimental Analysis -- 6 Conclusion and Future Work -- References -- Author Index.
Record Nr. UNINA-9910754096803321
Porkoláb Zoltán  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
Composability, Comprehensibility and Correctness of Working Software [[electronic resource] ] : 8th Summer School, CEFP 2019, Budapest, Hungary, June 17–21, 2019, Revised Selected Papers / / edited by Zoltán Porkoláb, Viktória Zsók
Autore Porkoláb Zoltán
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (398 pages)
Disciplina 005.11
Altri autori (Persone) ZsókViktória
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Software engineering
Compilers (Computer programs)
Computer science
Programming Techniques
Software Engineering
Compilers and Interpreters
Computer Science Logic and Foundations of Programming
ISBN 3-031-42833-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Main Lectures -- Writing Internet of Things Applications with Task Oriented Programming -- 1 Introduction -- 1.1 Internet of Things -- 1.2 Task Oriented Programming -- 1.3 iTask -- 1.4 TOP for the IoT -- 1.5 Structure of the Paper -- 2 mTask system architecture -- 2.1 Blink -- 2.2 Language -- 2.3 Class Based Shallow Embedding -- 2.4 DSL design -- 2.5 Backends -- 2.6 Bytecode -- 2.7 Skeleton -- 3 mTask language -- 3.1 Expressions -- 3.2 Functions -- 3.3 Basic Tasks -- 3.4 Parallel Task Combinators -- 3.5 Threaded Blinking -- 3.6 Sequential Task Combinators -- 3.7 Shared Data Source -- 3.8 Lifted Shared Data Sources -- 3.9 Interactive Blinking -- 3.10 Peripherals -- 4 IoT applications with TOP -- 4.1 Hardware and Client -- 4.2 Temperature -- 4.3 LED matrix -- 4.4 Temperature Plotter -- 5 Related Work -- 5.1 Interpretation -- 5.2 Task Oriented Programming -- 5.3 Functional Reactive Programming -- 5.4 Functional Programming -- 5.5 Multitasking -- 5.6 mTask history -- 6 Discussion -- A Embedded Domain Specific Language Techniques -- A.1 Deep Embedding -- A.2 Shallow Embedding -- B iTask reference -- B.1 Types -- B.2 Editors -- B.3 Task Combinators -- B.4 Shared Data Sources -- B.5 Extra Task Combinators -- B.6 Examples -- C How to Install -- C.1 Fetch the CEFP distribution -- C.2 Setup -- C.3 Compile the Test Program -- C.4 Setup the Microcontroller Unit -- D Solutions -- References -- Paint Your Programs Green: On the Energy Efficiency of Data Structures -- 1 Introduction -- 2 Data Structures Libraries -- 2.1 Haskell Data Structures -- 2.2 Java Data Structures -- 3 Experimental Setup -- 3.1 Haskell Operations -- 3.2 Java Operations -- 3.3 Measuring Energy Consumption -- 4 Comparing Data Structure Energy Consumption -- 4.1 Haskell Data Structures -- 4.2 Java Data Structures -- 5 Related Work.
6 Conclusions -- References -- Energy Efficient Software in an Engineering Course -- 1 Introduction -- 2 Energy Efficient Software in Higher Education -- 2.1 Sustainable Development and Its Dimentions -- 2.2 Sustainable Development in Higher Education -- 2.3 Energy Efficient Software in Higher Education -- 3 Software Analysis and Testing with a Green Flavor -- 3.1 Green Software: A Multidisciplinary Module -- 3.2 Green Software: Module Objectives -- 3.3 Green Software: Module Supporting Tools -- 4 Energy Efficent Software: Students Assessment -- 4.1 A Catalog of Energy Smells and Refactorings -- 4.2 Students Grades -- 5 Conclusions -- References -- Utilizing Rail Traffic Control Simulator in Verified Software Development Courses -- 1 Introduction -- 2 TD/TS2JC Toolset -- 2.1 Train Director -- 2.2 TS2JavaConn -- 2.3 Communication with Control Modules -- 3 Control Modules and Configuration Files -- 3.1 Non-parametric Module -- 3.2 Parametric Module -- 4 Teaching Verified Software Development in B-Method with TD/TS2JC Toolset -- 4.1 Software Development Process of B-Method -- 4.2 B-Language -- 4.3 Abstract Specification -- 4.4 Refinement to Implementation -- 4.5 Three Sections Control Module Development Project -- 5 Conclusion -- References -- The Role of Functional Programming in Management and Orchestration of Virtualized Network Resources -- 1 Introduction -- 2 Background -- 3 Network Evolution -- 3.1 Cloud Computing Platforms -- 3.2 Network Function Virtalisation and Software Defined Network -- 4 Management and Orchestration of Virtualized Network Resources -- 4.1 Design Principles for Implementing Autonomic Behavior -- 4.2 Current State -- 5 OpenStack -- 5.1 Graphical User Interface for Manipulating Virtual Resources -- 5.2 Authentification and Authorisation Functions -- 5.3 Management of Disk Images -- 5.4 Network Management Functions.
5.5 Management of Virtual Instances -- 5.6 Management of Persistent Memory -- 5.7 Management of Object Storage -- 5.8 Performance Measurement Functions -- 5.9 Orchestration Functions -- 6 Examples -- 6.1 Example 1 -- 6.2 Example 2 -- 6.3 Example 3 -- 6.4 Example 4 -- 7 Use Cases from Industry and Reflection on Design Principles -- 7.1 Virtualisation of Mobile Switching Centre -- 7.2 Management Functions for Reliable and Stable Operation -- 8 Discussion -- 9 Conclusion -- References -- Towards Better Tool Support for Code Comprehension -- 1 Introduction -- 2 Model of Code Comprehension -- 2.1 Top-Down Models -- 2.2 Bottom-Up Models -- 2.3 Other Approaches -- 2.4 The Role of Concept Location -- 3 Nature of the Problems -- 3.1 Growing Complexity -- 3.2 Knowledge Erosion -- 3.3 Multiple Views of the Software Based on Various Information Sources -- 3.4 Communication Barriers -- 3.5 Multiple Programming Languages -- 3.6 Hard to Deploy New Tools -- 3.7 Requirement of Open Extensibility -- 3.8 API Usage -- 4 State of the Art -- 5 The CodeCompass Architecture -- 5.1 Layers of the Architecture -- 5.2 Web User Interface -- 5.3 Language Server Protocol -- 5.4 Performance -- 6 Important Design Workflows -- 6.1 Bug Investigation -- 6.2 Feature Development Planning and Estimation -- 6.3 Refactoring -- 6.4 Knowledge Transfer and Newcomers' Catch-Up -- 7 User Acceptance in Real Production -- 8 Conclusion and Future Work -- References -- Balanced Distributed Computation Patterns -- 1 Introduction -- 2 Go Essentials -- 2.1 Syntax of Basic Language Elements -- 3 Concurrent Programming -- 3.1 Goroutine -- 3.2 WaitGroup -- 3.3 Mutual Exclusion -- 3.4 Channels -- 3.5 Select -- 3.6 Concurrency Principles -- 3.7 Parallelism -- 3.8 Concurrent Job Processing -- 4 Advanced Message Queueing Protocol (AMQP) -- 4.1 AMQP Components -- 4.2 Connection and Channel.
4.3 Safe Message Delivery in Go -- 4.4 Prefetch -- 4.5 AMQP at Network Failures -- 4.6 AMQP Management -- 4.7 AMQP Advantages -- 4.8 AMQP Usage -- 4.9 AMQP 0.9.1 Model -- 4.10 Go RabbitMQ Client Library -- 5 Distributed Programming -- 5.1 RabbitMQ Hello World -- 5.2 RabbitMQ Exchange -- 5.3 RabbitMQ Shared Queue -- 5.4 Parallel Receive -- 5.5 Distributed Job Processing -- 5.6 Distributed Pipeline -- 5.7 Distributed Divide and Conquer -- 6 Testing Performances -- 7 Related Work -- 8 Conclusion -- A Code Listings and Outputs -- A.1 Parallel Receive -- A.2 Distributed Job Processing with Shared Response Queue, Version2 -- A.3 Distributed Job Processing with Private Response Queue, Version3 -- A.4 Distributed Job Processing with Worker Generator, Version4 -- A.5 Distributed Pipeline with Connection Confirmation (Version 2) -- A.6 Distributed Pipeline with Worker Generator (Version 3) -- A.7 Distributed Divide and Conquer -- B Task for Readers -- References -- PhD Workshop -- Tunnel Parsing -- 1 Introduction -- 2 Parsing Overview -- 3 Problem -- 4 Tunnel Parsing Algorithm -- 4.1 Tunnels -- 4.2 Routers -- 4.3 Segments -- 4.4 Control Layer -- 5 Results -- 6 Conclusion -- References -- Finding Code Clone Refactoring Techniques by Mapping Clone Context -- 1 Introduction -- 2 Background and Related Work -- 2.1 Clone Context Analysis -- 2.2 Clone Refactoring -- 3 Context Analysis of Clones -- 3.1 Relation -- 3.2 Location -- 3.3 Contents -- 4 CloneRefactor -- 5 Experimental Setup -- 5.1 The Corpus -- 5.2 Tool Validation -- 6 Results -- 6.1 Relation -- 6.2 Location -- 6.3 Contents -- 7 Discussion -- 8 Conclusion -- References -- Code Quality Metrics for Functional Features in Modern Object-Oriented Languages -- 1 Introduction -- 2 Problem Analysis -- 3 Candidate Measures -- 3.1 Number of Lambda-Functions Used in a Class (LC) -- 3.2 Source Lines of Lambda (SLOL).
3.3 Lambda Score (LSc) -- 3.4 Number of Lambda-Functions Using Mutable Field Variables in a Class (LMFV) -- 3.5 Number of Lambda-Functions Using Mutable Local Variables in a Class (LMLV) -- 3.6 Number of Lambda-Functions with Side-Effects Used in a Class (LSE) -- 3.7 Number of Non-terminated Collection Queries in a Class (UTQ) -- 4 Experimental Setup -- 4.1 Methodology -- 4.2 Relating Functional Constructs to Error-Proneness -- 4.3 Measuring Functional Constructs -- 4.4 Measuring Error-Proneness -- 4.5 Dataset -- 5 Experimental Evaluation -- 6 Threats to Validity -- 7 Related Work -- 8 Conclusion and Discussion -- References -- An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms -- 1 Introduction -- 2 Related Work -- 2.1 Energy Complexity Model -- 2.2 Empirical Studies on Cache Efficiency -- 2.3 Empirical Studies on Energy Efficiency -- 3 Algorithms for Matrix Transposition -- 4 Methodology and Experimental Setup -- 4.1 Experimental Setup -- 4.2 Performance Counter Measurement Tools -- 4.3 Intermediate Machine Code Generation Tool -- 5 Experimental Analysis -- 6 Conclusion and Future Work -- References -- Author Index.
Record Nr. UNISA-996558467403316
Porkoláb Zoltán  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XLII, 755 p. 22 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Machine theory
Theory of Computation
Data Science
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
ISBN 3-319-50062-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cameo of a Consummate Computabilist -- Surfing with Rod -- Prequel to the Cornell Computer Science Department -- Some Questions in Computable Mathematics -- Introduction to Autoreducibility and Mitoticity -- The Complexity of Complexity -- Bounded Pushdown Dimension vs Lempel Ziv Information Density -- On Being Rod's Graduate Student -- Herrmann's Beautiful Theorem on Computable Partial Orderings -- Effectiveness of Hindman's Theorem for Bounded Sums -- Reverse Mathematics of Matroids -- Weakly Represented Families in Reverse Mathematics -- The Vitali Covering Theorem in the Weihrauch Lattice -- Parallel and Serial Jumps of Weak König's Lemma -- Effectively Existentially-Atomic Structures -- Irreducibles and Primes in Computable Integral Domains -- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey -- Enumeration Reducibility and Computable Structure Theory -- Strength and Weakness in Computable Structure Theory -- On Constructive Nilpotent Groups -- Computable Model Theory over the Reals -- The Lattice of Computably Enumerable Vector Spaces -- Injection Structures Specified by Finite State Transducers -- A Survey on Universal Computably Enumerable Equivalence Relations -- Higher Computability -- Σ1 1 in Every Real in a Σ1 1 Class of Reals is Σ1 -- A Survey of Results on the D-C.E. and N-C.E. Degrees -- There Are no Maximal D.C.E. WTT-Degrees -- A Rigid Cone in the Truth-Table Degrees with Jump -- Asymptotic Density and the Theory of Computability : A Partial Survey -- On Splits of Computably Enumerable Sets -- 1-Generic Degrees Bounding Minimal Degrees Revisited -- Nondensity of Double Bubbles in the D.C.E. Degrees -- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets -- Permutations of the Integers Induce Only the Trivial Automorphism of the Turing Degrees -- On the Reals which Cannot Be Random -- A Note on the Differences of Computably Enumerable Reals -- Effective Bi-immunity and Randomness -- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals -- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions -- Algorithmic Statistics: Forty Years Later -- Lowness, Randomness, and Computable Analysis. .
Record Nr. UNISA-996465509103316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XLII, 755 p. 22 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Machine theory
Theory of Computation
Data Science
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
ISBN 3-319-50062-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cameo of a Consummate Computabilist -- Surfing with Rod -- Prequel to the Cornell Computer Science Department -- Some Questions in Computable Mathematics -- Introduction to Autoreducibility and Mitoticity -- The Complexity of Complexity -- Bounded Pushdown Dimension vs Lempel Ziv Information Density -- On Being Rod's Graduate Student -- Herrmann's Beautiful Theorem on Computable Partial Orderings -- Effectiveness of Hindman's Theorem for Bounded Sums -- Reverse Mathematics of Matroids -- Weakly Represented Families in Reverse Mathematics -- The Vitali Covering Theorem in the Weihrauch Lattice -- Parallel and Serial Jumps of Weak König's Lemma -- Effectively Existentially-Atomic Structures -- Irreducibles and Primes in Computable Integral Domains -- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey -- Enumeration Reducibility and Computable Structure Theory -- Strength and Weakness in Computable Structure Theory -- On Constructive Nilpotent Groups -- Computable Model Theory over the Reals -- The Lattice of Computably Enumerable Vector Spaces -- Injection Structures Specified by Finite State Transducers -- A Survey on Universal Computably Enumerable Equivalence Relations -- Higher Computability -- Σ1 1 in Every Real in a Σ1 1 Class of Reals is Σ1 -- A Survey of Results on the D-C.E. and N-C.E. Degrees -- There Are no Maximal D.C.E. WTT-Degrees -- A Rigid Cone in the Truth-Table Degrees with Jump -- Asymptotic Density and the Theory of Computability : A Partial Survey -- On Splits of Computably Enumerable Sets -- 1-Generic Degrees Bounding Minimal Degrees Revisited -- Nondensity of Double Bubbles in the D.C.E. Degrees -- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets -- Permutations of the Integers Induce Only the Trivial Automorphism of the Turing Degrees -- On the Reals which Cannot Be Random -- A Note on the Differences of Computably Enumerable Reals -- Effective Bi-immunity and Randomness -- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals -- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions -- Algorithmic Statistics: Forty Years Later -- Lowness, Randomness, and Computable Analysis. .
Record Nr. UNINA-9910484452903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XX, 363 p. 26 illus.)
Disciplina 303.4833
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Machine theory
Algorithms
Software engineering
Compilers (Computer programs)
Computer Science Logic and Foundations of Programming
Theory of Computation
Formal Languages and Automata Theory
Software Engineering
Compilers and Interpreters
ISBN 3-642-38164-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Use of a Canonical Hidden-Variable Space in Quantum Mechanics -- Imperfect Information in Logic and Concurrent Games -- Compositional Quantum Logic -- The Algebra of Directed Acyclic Graphs -- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits -- Payoffs, Intensionality and Abstraction in Games -- On the Theory of Composition in Physics -- On the Functor 2 -- Quantum Speedup and Categorical Distributivity -- Unifying Semantics for Concurrent Programming -- Unfixing the Fixpoint: The Theories of the λY -Calculus -- Continuous Domain Theory in Logical Form -- Presheaf Models of Quantum Computation: An Outline -- Nothing Can Be Fixed -- Dialogue Categories and Frobenius Monoids -- Anatomy of a Domain of Continuous Random Variables II -- Towards Nominal Abramsky -- Techniques for Formal Modelling and Analysis of Quantum Systems -- Quantum Field Theory for Legspinners -- Bicompletions of Distance Matrices -- Partial Recursive Functions and Finality -- Breaking the Atom with Samson -- Reasoning about Strategies -- Domain Theory in Topical Form -- Kolmogorov Complexity of Categories.
Record Nr. UNISA-996466181003316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky [[electronic resource] ] : Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday / / edited by Bob Coecke, Luke Ong, Prakash Panangaden
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XX, 363 p. 26 illus.)
Disciplina 303.4833
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Machine theory
Algorithms
Software engineering
Compilers (Computer programs)
Computer Science Logic and Foundations of Programming
Theory of Computation
Formal Languages and Automata Theory
Software Engineering
Compilers and Interpreters
ISBN 3-642-38164-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Use of a Canonical Hidden-Variable Space in Quantum Mechanics -- Imperfect Information in Logic and Concurrent Games -- Compositional Quantum Logic -- The Algebra of Directed Acyclic Graphs -- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits -- Payoffs, Intensionality and Abstraction in Games -- On the Theory of Composition in Physics -- On the Functor 2 -- Quantum Speedup and Categorical Distributivity -- Unifying Semantics for Concurrent Programming -- Unfixing the Fixpoint: The Theories of the λY -Calculus -- Continuous Domain Theory in Logical Form -- Presheaf Models of Quantum Computation: An Outline -- Nothing Can Be Fixed -- Dialogue Categories and Frobenius Monoids -- Anatomy of a Domain of Continuous Random Variables II -- Towards Nominal Abramsky -- Techniques for Formal Modelling and Analysis of Quantum Systems -- Quantum Field Theory for Legspinners -- Bicompletions of Distance Matrices -- Partial Recursive Functions and Finality -- Breaking the Atom with Samson -- Reasoning about Strategies -- Domain Theory in Topical Form -- Kolmogorov Complexity of Categories.
Record Nr. UNINA-9910483887903321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computation, Physics and Beyond [[electronic resource] ] : International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers / / edited by Michael J. Dinneen, Bakhadyr Khoussainov, Prof. Andre Nies
Computation, Physics and Beyond [[electronic resource] ] : International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers / / edited by Michael J. Dinneen, Bakhadyr Khoussainov, Prof. Andre Nies
Edizione [1st ed. 2012.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica 1 online resource (XIII, 427 p. 64 illus.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Machine theory
Computer science
Computer science—Mathematics
Formal Languages and Automata Theory
Theory of Computation
Computer Science Logic and Foundations of Programming
Mathematics of Computing
Lògica informàtica
Sistemes adaptatius
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-642-27654-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Art of Reaching the Age of Sixty -- Calude as Father of One of the Computer Science Journals -- Random Semicomputable Reals Revisited -- Constructing the In mum of Two Projections -- Bounded Randomness -- A Note on Blum Static Complexity Measures -- A Program-Size Complexity Measure for Mathematical Problems and Conjectures -- On Degrees of Randomness and Genetic Randomness -- Hartmanis-Stearns Conjecture on Real Time and Transcendence -- Learning Families of Closed Sets in Matroids -- Invariance and Universality of Complexity -- Demuth's Path to Randomness (extended abstract) -- Correcting Codes -- Some Transfinite Generalisations of Gödel's Incompleteness Theorem -- Phase Transition between Unidirectionality and Bidirectionality -- Computer Runtimes and the Length of Proofs -- Symmetry of Information: A Closer Look -- How Much Information Can There Be in a Real Number? -- Mathematics, Metaphysics and the Multiverse -- Exponential Decay in Quantum Mechanics -- Randomness Increases Order in Biological Evolution -- Haunted Quantum Contextuality Versus Value Indefiniteness -- Outerplanar Graphs and Delaunay Triangulations -- Representing Reaction Systems by Trees -- Derivatives of Regular Expressions and An Application -- Triangular and Hexagonal Tile Self-Assembly Systems -- dP Automata versus Right-Linear Simple Matrix Grammars -- State Complexity of Kleene-Star Operations on Trees -- Composition Sequences and Synchronizing Automata -- On the Connected Partition Dimension of a Wheel Related Graph.
Record Nr. UNISA-996465936303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
Edizione [1st ed. 2000.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Descrizione fisica 1 online resource (XXXVIII, 1382 p. 33 illus.)
Disciplina 004/.01/5113
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Artificial intelligence
Software engineering
Computer systems
Machine theory
Computer science
Computer programming
Artificial Intelligence
Software Engineering
Computer System Implementation
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
Programming Techniques
ISBN 3-540-44957-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic.
Record Nr. UNISA-996465565903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
Edizione [1st ed. 2000.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Descrizione fisica 1 online resource (XXXVIII, 1382 p. 33 illus.)
Disciplina 004/.01/5113
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Artificial intelligence
Software engineering
Computer systems
Machine theory
Computer science
Computer programming
Artificial Intelligence
Software Engineering
Computer System Implementation
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
Programming Techniques
ISBN 3-540-44957-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic.
Record Nr. UNINA-9910143626303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computer Aided Systems Theory - EUROCAST 2007 [[electronic resource] ] : 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers / / edited by Roberto Moreno Díaz, Franz Pichler, Alexis Quesada Arencibia
Computer Aided Systems Theory - EUROCAST 2007 [[electronic resource] ] : 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers / / edited by Roberto Moreno Díaz, Franz Pichler, Alexis Quesada Arencibia
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XXXVIII, 1236 p.)
Disciplina 620.00285
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer-aided engineering
Computer simulation
Pattern recognition systems
Artificial intelligence
Computer science
Microprocessors
Computer architecture
Computer-Aided Engineering (CAD, CAE) and Design
Computer Modelling
Automated Pattern Recognition
Artificial Intelligence
Computer Science Logic and Foundations of Programming
Processor Architectures
ISBN 3-540-75867-4
Classificazione 004
MSR 580f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Systems Theory and Simulation: Formal Approaches -- Computation and Simulation in Modelling Biological Systems -- Intelligent Information Processing -- Computers in Education -- Grid Computing -- Applied Formal Verification -- Cellular Automata -- Computer Vision -- Heuristic Problem Solving -- Signal Processing Architectures -- Robotics and Robotic Soccer -- Cybercars and Intelligent Vehicles -- Artificial Intelligence Components.
Record Nr. UNISA-996466100003316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui