Edizione	[1st ed. 2017.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica	1 online resource (XVIII, 319 p. 58 illus.)
Disciplina	005.1015113
Collana	Programming and Software Engineering
Soggetto topico	Computer logic Software engineering Programming languages (Electronic computers) Mathematical logic Computer communication systems Computer programming Logics and Meanings of Programs Software Engineering Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Computer Communication Networks Programming Techniques
ISBN	3-319-51046-0
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Bill Roscoe, on his 60th Birthday -- A Tribute to Bill Roscoe, on the Occasion of his 60th Birthday -- Herding Cats, Oxford Style -- Stealthy Protocols: Metrics and Open Problems -- A Specification Theory of Real-Time Processes -- Towards Verification of Cyber-Physical Systems with UTP and Isabelle/HOL -- FDR: From Theory to Industrial Application -- Information Flow, Distributed Systems, and Refinement, by Example -- Abstractions for Transition Systems with Applications to Stubborn Sets -- A Hybrid Relational Modelling Language -- What Makes Petri Nets Harder to Verify: Stack or Data -- Analysing Lock-Free Linearizable Datatypes Using CSP -- Discrete Random Variables over Domains, Revisited -- A Demonic Lattice of Information -- A Brief History of Security Protocols -- More Stubborn Set Methods for Process Algebras -- A Branching Time Model of CSP -- Virtualization Based Development. .
Record Nr.	UNINA-9910483113703321

Autore	Royer James S
Edizione	[1st ed. 1987.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987
Descrizione fisica	1 online resource (VIII, 188 p.)
Disciplina	005.1015113
Collana	Lecture Notes in Computer Science
Soggetto topico	Computer logic Mathematical logic Programming languages (Electronic computers) Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations
ISBN	3-540-47846-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Motivations, background, and basic definitions -- Effective numberings, completions, and control structures -- Some special effective numberings -- Characterizations of acceptability -- Independence of control structures -- General programming properties of effective numberings of subrecursive classes.
Record Nr.	UNISA-996465788303316

Edizione	[1st ed. 2019.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica	1 online resource (XIII, 662 p. 1230 illus., 14 illus. in color.)
Disciplina	006.332 005.1015113
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Artificial intelligence Computer science Information technology—Management Software engineering Computer networks Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Computer Application in Administrative Data Processing Software Engineering Computer Communication Networks
ISBN	3-030-22102-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction -- Hierarchic Superposition Revisited -- Theory Combination: Beyond Equality Sharing -- Initial Steps Towards a Family of Regular-Like Plan Description Logics -- Reasoning with Justifiable Exceptions in EL_\bot Contextualized Knowledge Repositories -- Strong Explanations for Nonmonotonic Reasoning -- A KLM Perspective on Defeasible Reasoning for Description Logics -- Temporal Logic Programs with Temporal Description Logic Axioms -- The What-To-Ask Problem for Ontology-Based Peers -- From Model Completeness to Verification of Data Aware Processes -- Situation Calculus meets Description Logics -- Provenance Analysis: A Perspective for Description Logics? -- Extending EL^++ with Linear Constraints on the Probability of Axioms -- Effective query answering with Ontologies and DBoxes -- Checking the Data Complexity of Ontology-Mediated Queries: a Case Study with Non-Uniform CSPs and Polyanna -- Perceptual Context in Cognitive Hierarchies -- Do Humans Reason with E-Matchers? -- Pseudo-contractions as gentle repairs -- FunDL: A Family of Feature-Based Description Logics, with Applications in Querying Structured Data Sources -- Some Thoughts on Forward Induction in Multi-Agent-Path Finding Under Destination Uncertainty -- Temporally Attributed Description Logics -- Explaining Axiom Pinpointing -- Asymmetric Unification and Disunification -- Building and Combining Matching Algorithms -- Presburger Concept Cardinality Constraints in Very Expressive Description Logics -- A Note on Unification, Subsumption and Unification Type -- 15 Years of Consequence-Based Reasoning -- Maximum Entropy Calculations for the Probabilistic Description Logic ALC^ME -- Automating Automated Reasoning: The Case of Two Generic Automated Reasoning Tools -- On Bounded-Memory Stream Data Processing with Description Logics.
Record Nr.	UNINA-9910337835703321

Edizione	[1st ed. 2020.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica	1 online resource (X, 245 p. 327 illus., 9 illus. in color.)
Disciplina	005.1015113
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Computer science Artificial intelligence Machine theory Database management Computer Science Logic and Foundations of Programming Artificial Intelligence Formal Languages and Automata Theory Database Management
ISBN	3-030-62536-2
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Mutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ω-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II.
Record Nr.	UNISA-996418213203316