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.
Abstract State Machines 2003: Advances in Theory and Practice [[electronic resource] ] : 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings / / edited by Egon Börger, Angelo Gargantini, Elvinia Riccobene
| Abstract State Machines 2003: Advances in Theory and Practice [[electronic resource] ] : 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings / / edited by Egon Börger, Angelo Gargantini, Elvinia Riccobene |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Computer science Software engineering Programming languages (Electronic computers) Mathematical logic Theory of Computation Logics and Meanings of Programs Computer Science, general Software Engineering Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-36498-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Software Testing Research and Practice -- Abstract State Processes -- Recent Advances in Refinement -- Partial Updates Exploration II -- Experiments with Test Case Generation and Runtime Analysis -- A Framework for Proving Contract-Equipped Classes -- Mobile UNITY Schemas for Agent Coordination -- UML and Concurrency -- Research Papers -- A Unified Formal Specification and Analysis of the New Java Memory Models -- Modelling Conditional Knowledge Discovery and Belief Revision by Abstract State Machines -- Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks -- Remarks on Turbo ASMs for Functional Equations and Recursion Schemes -- Integrating UML Static and Dynamic Views and Formalizing the Interaction Mechanism of UML State Machines -- The Hidden Computation Steps of Turbo Abstract State Machines -- Using Spin to Generate Tests from ASM Specifications -- Interfacing ASM with the MDG Tool -- ASMs versus Natural Semantics: A Comparison with New Insights -- Quantum Computing and Abstract State Machines -- Consistent Integration for Sequential Abstract State Machines -- Deciding the Verification Problem for Abstract State Machines -- An ASM Semantics of UML Derived from the Meta-model and Incorporating Actions -- Privacy, Abstract Encryption and Protocols: An ASM Model - Part I -- A Framework for Modeling the Semantics of Expression Evaluation with Abstract State Machines -- Extended Abstracts -- Using AsmL for Runtime Verification -- Modeling Information Services on the Basis of ASM Semantics -- Designing the Parlay Call-Control Using ASMs -- Test Case Generation from AsmL Specifications -- Teaching ASMs, Teaching with ASMs: Opportunities in Undergraduate Education -- Using ASM Specifications for Compiler Testing -- ASMs as Integration Platform towards Verification and Validation of Distributed Production Control Systems at Multiple Levels of Abstraction -- AsmL Specification of a Ptolemy II Scheduler -- ASM Specification of Database Systems -- The Computable Kernel of ASM -- A Non-standard Approach to Operational Semantics for Timed Systems -- Parallelism versus Nondeterminism — On the Semantics of Abstract State Machines. |
| Record Nr. | UNISA-996465645203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Abstract State Machines 2003: Advances in Theory and Practice : 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings / / edited by Egon Börger, Angelo Gargantini, Elvinia Riccobene
| Abstract State Machines 2003: Advances in Theory and Practice : 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings / / edited by Egon Börger, Angelo Gargantini, Elvinia Riccobene |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Computer science Software engineering Programming languages (Electronic computers) Mathematical logic Theory of Computation Logics and Meanings of Programs Computer Science, general Software Engineering Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-36498-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Software Testing Research and Practice -- Abstract State Processes -- Recent Advances in Refinement -- Partial Updates Exploration II -- Experiments with Test Case Generation and Runtime Analysis -- A Framework for Proving Contract-Equipped Classes -- Mobile UNITY Schemas for Agent Coordination -- UML and Concurrency -- Research Papers -- A Unified Formal Specification and Analysis of the New Java Memory Models -- Modelling Conditional Knowledge Discovery and Belief Revision by Abstract State Machines -- Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks -- Remarks on Turbo ASMs for Functional Equations and Recursion Schemes -- Integrating UML Static and Dynamic Views and Formalizing the Interaction Mechanism of UML State Machines -- The Hidden Computation Steps of Turbo Abstract State Machines -- Using Spin to Generate Tests from ASM Specifications -- Interfacing ASM with the MDG Tool -- ASMs versus Natural Semantics: A Comparison with New Insights -- Quantum Computing and Abstract State Machines -- Consistent Integration for Sequential Abstract State Machines -- Deciding the Verification Problem for Abstract State Machines -- An ASM Semantics of UML Derived from the Meta-model and Incorporating Actions -- Privacy, Abstract Encryption and Protocols: An ASM Model - Part I -- A Framework for Modeling the Semantics of Expression Evaluation with Abstract State Machines -- Extended Abstracts -- Using AsmL for Runtime Verification -- Modeling Information Services on the Basis of ASM Semantics -- Designing the Parlay Call-Control Using ASMs -- Test Case Generation from AsmL Specifications -- Teaching ASMs, Teaching with ASMs: Opportunities in Undergraduate Education -- Using ASM Specifications for Compiler Testing -- ASMs as Integration Platform towards Verification and Validation of Distributed Production Control Systems at Multiple Levels of Abstraction -- AsmL Specification of a Ptolemy II Scheduler -- ASM Specification of Database Systems -- The Computable Kernel of ASM -- A Non-standard Approach to Operational Semantics for Timed Systems -- Parallelism versus Nondeterminism — On the Semantics of Abstract State Machines. |
| Record Nr. | UNINA-9910143882103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Software Engineering [[electronic resource] ] : Lipari Summer School 2007, Lipari Island, Italy, July 8-21, 2007, Revised Tutorial Lectures / / edited by Egon Börger, Antonio Cisternino
| Advances in Software Engineering [[electronic resource] ] : Lipari Summer School 2007, Lipari Island, Italy, July 8-21, 2007, Revised Tutorial Lectures / / edited by Egon Börger, Antonio Cisternino |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 277 p.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer programming Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Software Engineering Programming Techniques |
| Soggetto genere / forma |
Kongress.
Lipari (2007) |
| ISBN | 3-540-89762-3 |
| Classificazione |
DAT 310f
SS 4800 ST 230 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Foundations and Methodology -- The Name and Nature of Software Engineering -- A Modeling Language for Program Design and Synthesis -- A Method for Verifiable and Validatable Business Process Modeling -- SOA and Web Services -- Service Oriented Architecture: Overview and Directions -- A Guided Tour through SAVVY-WS: A Methodology for Specifying and Validating Web Service Compositions -- Software Technology -- Software Manipulation with Annotations in Java -- Zero-Overhead Composable Aspects for .NET -- Technologies for Evolvable Software Products: The Conflict between Customizations and Evolution -- Security -- Security in Distributed Applications. |
| Record Nr. | UNISA-996465542003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Software Engineering : Lipari Summer School 2007, Lipari Island, Italy, July 8-21, 2007, Revised Tutorial Lectures / / edited by Egon Börger, Antonio Cisternino
| Advances in Software Engineering : Lipari Summer School 2007, Lipari Island, Italy, July 8-21, 2007, Revised Tutorial Lectures / / edited by Egon Börger, Antonio Cisternino |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 277 p.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer programming Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Software Engineering Programming Techniques |
| Soggetto genere / forma |
Kongress.
Lipari (2007) |
| ISBN | 3-540-89762-3 |
| Classificazione |
DAT 310f
SS 4800 ST 230 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Foundations and Methodology -- The Name and Nature of Software Engineering -- A Modeling Language for Program Design and Synthesis -- A Method for Verifiable and Validatable Business Process Modeling -- SOA and Web Services -- Service Oriented Architecture: Overview and Directions -- A Guided Tour through SAVVY-WS: A Methodology for Specifying and Validating Web Service Compositions -- Software Technology -- Software Manipulation with Annotations in Java -- Zero-Overhead Composable Aspects for .NET -- Technologies for Evolvable Software Products: The Conflict between Customizations and Evolution -- Security -- Security in Distributed Applications. |
| Record Nr. | UNINA-9910482961003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computation Theory and Logic [[electronic resource] /] / edited by Egon Börger
| Computation Theory and Logic [[electronic resource] /] / edited by Egon Börger |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (IX, 442 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Theory of Computation Computation by Abstract Devices |
| ISBN | 3-540-47795-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimal pairs for polynomial time reducibilities -- Primitive recursive word-functions of one variable -- Existential fixed-point logic -- Unsolvable decision problems for PROLOG programs -- You have not understood a sentence, unless you can prove it -- On the minimality of K, F, and D or: Why löten is non-trivial -- A 5-color-extension-theorem -- Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables -- The benefit of microworlds in learning computer programming -- Skolem normal forms concerning the least fixpoint -- Spectral representation of recursively enumerable and coenumerable predicates -- Aggregating inductive expertise on partial recursive functions -- Domino threads and complexity -- Modelling of cooperative processes -- A setting for generalized computability -- First-order spectra with one variable -- On the early history of register machines -- Randomness, provability, and the separation of Monte Carlo Time and space -- Representation independent query and update operations on propositional definite Horn formulas -- Direct construction of mutually orthogonal latin squares -- Negative results about the length problem -- Some results on the complexity of powers -- The Turing complexity of AF C*-algebras with lattice-ordered KO -- Remarks on SASL and the verification of functional programming languages -- Numerical stability of simple geometric algorithms in the plane -- Communication with concurrent systems via I/0-procedures -- A class of exp-time machines which can be simulated by polytape machines -- ???-Automata realizing preferences -- Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen -- Grammars for terms and automata -- Relative konsistenz -- Segment translation systems -- First steps towards a theory of complexity over more general data structures -- On the power of single-valued nondeterministic polynomial time computations -- A concatenation game and the dot-depth hierarchy -- Do there exist languages with an arbitrarily small amount of context-sensitivity? -- The complexity of symmetric boolean functions. |
| Altri titoli varianti | In Memory of Dieter Rötting. 24.8.1937 - 4.6.1984. On the Occasion of the 50th Anniversary of His Birth |
| Record Nr. | UNISA-996465829603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers / / edited by Egon Börger, Yuri Gurevich, Karl Meinke
| Computer Science Logic [[electronic resource] ] : 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers / / edited by Egon Börger, Yuri Gurevich, Karl Meinke |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (VIII, 336 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Mathematical logic Artificial intelligence Theory of Computation Logics and Meanings of Programs Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Artificial Intelligence |
| ISBN | 3-540-48599-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The complexity of set constraints -- On duality for the modal ?-calculus -- Short proofs of tautologies using the schema of equivalence -- Process algebra with combinators -- Is game semantics necessary? -- The model theory of concurrency -- From semantics to rules: A machine assisted analysis -- On the reasons for average superlinear speedup in parallel backtrack search -- Negation as inconsistency in PROLOG via intuitionistic logic -- Approximable minimization problems and optimal solutions on random inputs -- Bounded-arity hierarchies in fixed-point logics -- Petri nets and the equivalence problem -- Logical aspects of set constraints -- Oracles and quantifiers -- A Horn clause that implies an undecidable set of Horn clauses -- Higher-order action calculi -- A generic strong normalization argument: Application to the Calculus of Constructions -- Data types, infinity and equality in system AF 2 -- Normalization for typed lambda calculi with explicit substitution -- Program transformation and proof transformation -- Incorporating generalized quantifiers and the least fixed point operator -- “The semantics of the C programming language”. |
| Record Nr. | UNISA-996466099903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter
| Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (IX, 439 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Mathematical logic Computer logic Algorithms Theory of Computation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47890-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear ?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties. |
| Record Nr. | UNISA-996466156403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter
| Computer Science Logic [[electronic resource] ] : 5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 431 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer logic Algorithms Theory of Computation Mathematical Logic and Foundations Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47285-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The expressive power of transitive closure and 2-way multihead automata -- Correctness proof for the WAM with types -- Model checking of persistent Petri nets -- Provability in TBLL: A decision procedure -- How to implement first order formulas in local memory machine models -- A new approach to abstract data types II computation on ADTs as ordinary computation -- A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation -- On bounded theories -- The cutting plane proof system with bounded degree of falsity -- Denotational versus declarative semantics for functional programming -- On transitive closure logic -- Some aspects of the probabilistic behavior of variants of resolution -- Safe queries in relational databases with functions -- Logical inference and polyhedral projection -- Stable logic -- A transformational methodology for proving termination of logic programs -- Plausibility logic -- Towards Kleene Algebra with recursion -- Equational specification of abstract types and combinators -- Normal forms in infinite-valued logic: The case of one variable -- A fragment of first order logic adequate for observation equivalence -- Ordinal processes in comparative concurrency semantics -- Logical semantics of modularisation -- A cut-elimination procedure designed for evaluating proofs as programs -- Minimal from classical proofs -- Quantifier hierarchies over word relations -- Complexity results for the default- and the autoepistemic logic -- On Completeness for NP via projection translations -- Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata -- Comparing the theory of representations and constructive mathematics -- Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic -- On completeness of program synthesis systems -- Proving termination for term rewriting systems. |
| Record Nr. | UNISA-996465475103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld
| Computer Science Logic [[electronic resource] ] : 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 402 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Applied mathematics Engineering mathematics Computers Computer logic Algorithms Mathematical Logic and Foundations Applications of Mathematics Theory of Computation Logics and Meanings of Programs Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-38401-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Monadic second order logic, tree automata and forbidden minors -- On the reduction theory for average case complexity -- From prolog algebras towards WAM-A mathematical study of implementation -- A formal operational semantics for languages of type Prolog III -- Efficiency considerations on goal-directed forward chaining for logic programs -- Decision problems for tarski and presburger arithmetics extended with sets -- A fast garbage collection algorithm for WAM — based PROLOG -- A resolution variant deciding some classes of clause sets -- Subclasses of quantified boolean formulas -- Algorithmic proof with diminishing resources part 1 -- Cutting plane versus frege proof systems -- RAM with compact memory: a realistic and robust model of computation -- Randomness and turing reducibility restraints -- Towards an efficient tableau proof procedure for multiple-valued logics -- Interactive proof systems: Provers, rounds, and error bounds -- Logics for belief dependence -- A generalization of stability and its application to circumscription of positive introspective knowledge -- The complexity of adaptive error-correcting codes -- Ramsey's theorem in bounded arithmetic -- Nontrivial lower bounds for some NP-problems on directed graphs -- Expansions and models of autoepistemic theories -- On the existence of fixpoints in moore's autoepistemic logic and the non-monotonic logic of McDermott and Doyle -- On the tracking of loops in automated deductions -- The gap-language-technique revisited. |
| Record Nr. | UNISA-996465654103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CSL '87 [[electronic resource] ] : 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
| CSL '87 [[electronic resource] ] : 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VIII, 348 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer logic Computer System Implementation Logics and Meanings of Programs |
| ISBN | 3-540-45960-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Diagonalizing over deterministic polynomial time -- Resolution with feature unification -- Surjectivity for finite sets of combinators by weak reduction -- Proving finite satisfiability of deductive databases -- Is setl a suitable language for parallel programming — a theoretical approach -- Loose diagrams, semigroupoids, categories, groupoids and iteration -- Algebraic operational semantics and modula-2 -- Program verification using dynamic logic -- Induction in the elementary theory of types and names -- On the computational complexity of quantified Horn clauses -- The conjunctive complexity of quadratic boolean functions -- On type inference for object-oriented programming languages -- Optimization aspects of logical formulas -- Logic of approximation reasoning -- Deciding the path- and word-fair equivalence problem -- Learning by teams from examples with errors -- A survey of rewrite systems -- Interfacing a logic machine -- Complexity cores and hard-to-prove formulas -- On the average case complexity of backtracking for the exact-satisfiability problem -- On functions computable in nondeterministic polynomial time: Some characterizations -- Developing logic programs: Computing through normalizing -- Model theory of deductive databases -- Algorithms for propositional updates. |
| Record Nr. | UNISA-996465660503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
