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.
Automated Reasoning [[electronic resource] ] : 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012, Proceedings / / edited by Bernhard Gramlich, Dale Miller, Ulrike Sattler
| Automated Reasoning [[electronic resource] ] : 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012, Proceedings / / edited by Bernhard Gramlich, Dale Miller, Ulrike Sattler |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIV, 568 p. 90 illus.) |
| Disciplina | 511.3/6028563 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Computer logic Artificial intelligence Software engineering Computer science—Mathematics Numerical analysis Mathematical Logic and Formal Languages Logics and Meanings of Programs Artificial Intelligence Software Engineering Mathematics of Computing Numeric Computing |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISBN | 3-642-31365-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Taking Satisfiability to the Next Level with Z3 ; (Abstract) / Nikolaj Bjørner -- Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics / Yuri Matiyasevich -- SAT and SMT Are Still Resolution: Questions and Challenges / Robert Nieuwenhuis -- Unification Modulo Synchronous Distributivity / Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran and Michael Rusinowitch -- SAT Encoding of Unification in ELHR+R+ w.r.t. Cycle-Restricted Ontologies / Franz Baader, Stefan Borgwardt and Barbara Morawska -- UEL: Unification Solver for the Description Logic EL -- System Description / Franz Baader, Julian Mendez and Barbara Morawska -- Effective Finite-Valued Semantics for Labelled Calculi / Matthias Baaz, Ori Lahav and Anna Zamansky -- A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic / François Bobot, Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala and Assia Mahboubi, et al. -- How Fuzzy Is My Fuzzy Description Logic? / Stefan Borgwardt, Felix Distel and Rafael Peñaloza -- Truthful Monadic Abstractions / Taus Brock-Nannestad and Carsten Schürmann -- Satallax: An Automatic Higher-Order Prover / Chad E. Brown -- From Strong Amalgamability to Modularity of Quantifier-Free Interpolation / Roberto Bruttomesso, Silvio Ghilardi and Silvio Ranise -- SPARQL Query Containment under RDFS Entailment Regime / Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès and Nabil Layaïda.
Automated Verification of Recursive Programs with Pointers / Frank de Boer, Marcello Bonsangue and Jurriaan Rot -- Security Protocols, Constraint Systems, and Group Theories / Stéphanie Delaune, Steve Kremer and Daniel Pasaila -- Taming Past LTL and Flat Counter Systems / Stéphane Demri, Amit Kumar Dhar and Arnaud Sangnier -- A Calculus for Generating Ground Explanations / Mnacho Echenim and Nicolas Peltier -- EPR-Based Bounded Model Checking at Word Level / Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Christoph Sticksel and Andrei Voronkov -- Proving Non-looping Non-termination Automatically / Fabian Emmes, Tim Enger and Jürgen Giesl -- Rewriting Induction + Linear Arithmetic = Decision Procedure / Stephan Falke and Deepak Kapur -- Combination of Disjoint Theories: Beyond Decidability / Pascal Fontaine, Stephan Merz and Christoph Weidenbach -- Automated Analysis of Regular Algebra / Simon Foster and Georg Struth -- [delta]-Complete Decision Procedures for Satisfiability over the Reals / Sicun Gao, Jeremy Avigad and Edmund M. Clarke -- BDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics / Rajeev Goré and Jimmy Thomson -- From Linear Temporal Logic Properties to Rewrite Propositions / Pierre-Cyrille Héam, Vincent Hugot and Olga Kouchnarenko -- Tableaux Modulo Theories Using Superdeduction: An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover / Mélanie Jacquel, Karim Berkani, David Delahaye and Catherine Dubois. Solving Non-linear Arithmetic / Dejan Jovanović and Leonardo de Moura -- Inprocessing Rules / Matti Järvisalo, Marijn J.H. Heule and Armin Biere -- Logical Difference Computation with CEX2.5 / Boris Konev, Michel Ludwig and Frank Wolter -- Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics / Daniel Kühlwein, Twan van Laarhoven, Evgeni Tsivtsivadze, Josef Urban and Tom Heskes -- Branching Time? Pruning Time! / Markus Latte and Martin Lange -- New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants / Andrew M. Marshall and Paliath Narendran -- Reachability Analysis of Program Variables / Đurica Nikolić and Fausto Spoto -- Playing Hybrid Games with KeYmaera / Jan-David Quesel and André Platzer -- The QMLTP Problem Library for First-Order Modal Logics / Thomas Raths and Jens Otten -- Correctness of Program Transformations as a Termination Problem / Conrad Rau, David Sabel and Manfred Schmidt-Schauss -- Fingerprint Indexing for Paramodulation and Rewriting / Stephan Schulz -- Optimization in SMT with LAA Q Cost Functions / Roberto Sebastiani and Silvia Tomasi -- Synthesis for Unbounded Bit-Vector Arithmetic / Andrej Spielmann and Viktor Kuncak -- Extended Caching, Backjumping and Merging for Expressive Description Logics / Andreas Steigmiller, Thorsten Liebig and Birte Glimm -- KBCV -- Knuth-Bendix Completion Visualizer / Thomas Sternagel and Harald Zankl -- A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance / Martin Suda and Christoph Weidenbach -- Stratification in Logics of Definitions / Alwen Tiu -- Diabelli: A Heterogeneous Proof System / Matej Urbas and Mateja Jamnik. |
| Record Nr. | UNISA-996465531903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011, Proceedings / / edited by Kai Brünnler, George Metcalfe
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011, Proceedings / / edited by Kai Brünnler, George Metcalfe |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (VIII, 279 p. 40 illus., 4 illus. in color.) |
| Disciplina | 511.3/6028563 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer programming Software engineering Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering Logics and Meanings of Programs |
| ISBN | 3-642-22119-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465740303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Technology for Verification and Analysis [[electronic resource] ] : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010, Proceedings / / edited by Ahmed Bouajjani, Wei-Ngan Chin
| Automated Technology for Verification and Analysis [[electronic resource] ] : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010, Proceedings / / edited by Ahmed Bouajjani, Wei-Ngan Chin |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (VIII, 404 p. 112 illus.) |
| Disciplina | 511.3/6028563 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer programming Computer communication systems Computer logic Programming languages (Electronic computers) Software Engineering/Programming and Operating Systems Software Engineering Programming Techniques Computer Communication Networks Logics and Meanings of Programs Programming Languages, Compilers, Interpreters |
| ISBN |
1-280-38884-6
9786613566768 3-642-15643-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Probabilistic Automata on Infinite Words: Decidability and Undecidability Results -- Abstraction Learning -- Synthesis: Words and Traces -- Regular Papers -- Promptness in ?-Regular Automata -- Using Redundant Constraints for Refinement -- Methods for Knowledge Based Controlling of Distributed Systems -- Composing Reachability Analyses of Hybrid Systems for Safety and Stability -- The Complexity of Codiagnosability for Discrete Event and Timed Systems -- On Scenario Synchronization -- Compositional Algorithms for LTL Synthesis -- What’s Decidable about Sequences? -- A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network -- Lattice-Valued Binary Decision Diagrams -- A Specification Logic for Exceptions and Beyond -- Non-monotonic Refinement of Control Abstraction for Concurrent Programs -- An Approach for Class Testing from Class Contracts -- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata -- Reachability as Derivability, Finite Countermodels and Verification -- LTL Can Be More Succinct -- Automatic Generation of History-Based Access Control from Information Flow Specification -- Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems -- Symbolic Unfolding of Parametric Stopwatch Petri Nets -- Recursive Timed Automata -- Probabilistic Contracts for Component-Based Design -- Tool Papers -- Model-Checking Web Applications with Web-TLR -- GAVS: Game Arena Visualization and Synthesis -- CRI: Symbolic Debugger for MCAPI Applications -- MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming -- ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems -- Developing Model Checkers Using PAT -- YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B -- COMBINE: A Tool on Combined Formal Methods for Bindingly Verification -- Rbminer: A Tool for Discovering Petri Nets from Transition Systems. |
| Record Nr. | UNISA-996465909103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated technology for verification and analysis : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010 : proceedings / / Ahmed Bouajjani, Wei-Ngan Chin (eds.)
| Automated technology for verification and analysis : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010 : proceedings / / Ahmed Bouajjani, Wei-Ngan Chin (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (VIII, 404 p. 112 illus.) |
| Disciplina | 511.3/6028563 |
| Altri autori (Persone) |
BouajjaniAhmed
ChinWei-Ngan |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 2, Programming and software engineering |
| Soggetto topico | Automatic theorem proving |
| ISBN |
1-280-38884-6
9786613566768 3-642-15643-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Probabilistic Automata on Infinite Words: Decidability and Undecidability Results -- Abstraction Learning -- Synthesis: Words and Traces -- Regular Papers -- Promptness in ?-Regular Automata -- Using Redundant Constraints for Refinement -- Methods for Knowledge Based Controlling of Distributed Systems -- Composing Reachability Analyses of Hybrid Systems for Safety and Stability -- The Complexity of Codiagnosability for Discrete Event and Timed Systems -- On Scenario Synchronization -- Compositional Algorithms for LTL Synthesis -- What’s Decidable about Sequences? -- A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network -- Lattice-Valued Binary Decision Diagrams -- A Specification Logic for Exceptions and Beyond -- Non-monotonic Refinement of Control Abstraction for Concurrent Programs -- An Approach for Class Testing from Class Contracts -- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata -- Reachability as Derivability, Finite Countermodels and Verification -- LTL Can Be More Succinct -- Automatic Generation of History-Based Access Control from Information Flow Specification -- Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems -- Symbolic Unfolding of Parametric Stopwatch Petri Nets -- Recursive Timed Automata -- Probabilistic Contracts for Component-Based Design -- Tool Papers -- Model-Checking Web Applications with Web-TLR -- GAVS: Game Arena Visualization and Synthesis -- CRI: Symbolic Debugger for MCAPI Applications -- MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming -- ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems -- Developing Model Checkers Using PAT -- YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B -- COMBINE: A Tool on Combined Formal Methods for Bindingly Verification -- Rbminer: A Tool for Discovering Petri Nets from Transition Systems. |
| Record Nr. | UNINA-9910485034203321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The little prover / / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More
| The little prover / / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More |
| Autore | Friedman Daniel P. |
| Pubbl/distr/stampa | Cambridge, Massachusetts : , : MIT Press, , [2015] |
| Descrizione fisica | 1 online resource (244 p.) |
| Disciplina | 511.3/6028563 |
| Altri autori (Persone) | EastlundCarl |
| Soggetto topico |
Automatic theorem proving
LISP (Computer program language) |
| ISBN |
0-262-33057-1
0-262-33056-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index |
| Record Nr. | UNINA-9910797359703321 |
Friedman Daniel P.
|
||
| Cambridge, Massachusetts : , : MIT Press, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The little prover / / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More
| The little prover / / Daniel P. Friedman, Carl Eastlund ; drawings by Duane Bibby ; foreword by J Strother More |
| Autore | Friedman Daniel P. |
| Pubbl/distr/stampa | Cambridge, Massachusetts : , : MIT Press, , [2015] |
| Descrizione fisica | 1 online resource (244 p.) |
| Disciplina | 511.3/6028563 |
| Altri autori (Persone) | EastlundCarl |
| Soggetto topico |
Automatic theorem proving
LISP (Computer program language) |
| ISBN |
0-262-33057-1
0-262-33056-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Intro; Contents; Foreword; Preface; 1. Old Games, New Rules; 2. Even Older Games; 3. What's in a Name?; 4. Part of This Total Breakfast; 5. Think It Over and Over and Over; 6. Think It Through; 7. Oh My, Stars!; 8. Learning the Rules; 9. Changing the Rules; 10. The Stars Are Aligned; Recess; The Proof of the Pudding; The Little Assistant; Restless for More?; Afterword; Index |
| Record Nr. | UNINA-9910825540903321 |
|
Friedman Daniel P.
|
||
| Cambridge, Massachusetts : , : MIT Press, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Knowledge Management [[electronic resource] ] : 5th International Conference, MKM 2006, Wokingham, UK, August 11-12, 2006, Proceedings / / edited by Jonathan Borwein, William M. Farmer
| Mathematical Knowledge Management [[electronic resource] ] : 5th International Conference, MKM 2006, Wokingham, UK, August 11-12, 2006, Proceedings / / edited by Jonathan Borwein, William M. Farmer |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VIII, 295 p.) |
| Disciplina | 511.3/6028563 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Information storage and retrieval Application software Database management Computer communication systems Mathematics Artificial Intelligence Information Storage and Retrieval Information Systems Applications (incl. Internet) Database Management Computer Communication Networks Mathematics, general |
| ISBN | 3-540-37106-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Omega Number: Irreducible Complexity in Pure Math -- Roles of Math Search in Mathematics -- Contributed Papers -- Structured Induction Proofs in Isabelle/Isar -- Interpretation of Locales in Isabelle: Theories and Proof Contexts -- A Dynamic Poincaré Principle -- A Proof-Theoretic Approach to Tactics -- A Formal Correspondence Between OMDoc with Alternative Proofs and the -Calculus -- Proof Transformation by CERES -- Synthesizing Proof Planning Methods and ?-Ants Agents from Mathematical Knowledge -- Verifying and Invalidating Textbook Proofs Using Scunak -- Capturing Abstract Matrices from Paper -- Towards a Parser for Mathematical Formula Recognition -- Stochastic Modelling of Scientific Terms Distribution in Publications -- Capturing the Content of Physics: Systems, Observables, and Experiments -- Communities of Practice in MKM: An Extensional Model -- From Notation to Semantics: There and Back Again -- Managing Informal Mathematical Knowledge: Techniques from Informal Logic -- From Untyped to Polymorphically Typed Objects in Mathematical Web Services -- Managing Automatically Formed Mathematical Theories -- Authoring LeActiveMath Calculus Content -- Information Retrieval and Rendering with MML Query -- Integrating Dynamic Geometry Software, Deduction Systems, and Theorem Repositories. |
| Record Nr. | UNISA-996466143703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical knowledge management : 5th international conference, MKM 2006, Wokingham, UK, August 11-12, 2006 : proceedings / / Jonathan M. Borwein, William M. Farmer (eds.)
| Mathematical knowledge management : 5th international conference, MKM 2006, Wokingham, UK, August 11-12, 2006 : proceedings / / Jonathan M. Borwein, William M. Farmer (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (VIII, 295 p.) |
| Disciplina | 511.3/6028563 |
| Altri autori (Persone) |
BorweinJonathan M
FarmerWilliam Michael |
| Collana |
Lecture notes in computer science. Lecture notes in artificial intelligence
LNCS sublibrary. SL 7, Artificial intelligence |
| Soggetto topico |
Mathematics - Data processing
Information storage and retrieval systems - Mathematics Automatic theorem proving |
| ISBN | 3-540-37106-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Omega Number: Irreducible Complexity in Pure Math -- Roles of Math Search in Mathematics -- Contributed Papers -- Structured Induction Proofs in Isabelle/Isar -- Interpretation of Locales in Isabelle: Theories and Proof Contexts -- A Dynamic Poincaré Principle -- A Proof-Theoretic Approach to Tactics -- A Formal Correspondence Between OMDoc with Alternative Proofs and the -Calculus -- Proof Transformation by CERES -- Synthesizing Proof Planning Methods and ?-Ants Agents from Mathematical Knowledge -- Verifying and Invalidating Textbook Proofs Using Scunak -- Capturing Abstract Matrices from Paper -- Towards a Parser for Mathematical Formula Recognition -- Stochastic Modelling of Scientific Terms Distribution in Publications -- Capturing the Content of Physics: Systems, Observables, and Experiments -- Communities of Practice in MKM: An Extensional Model -- From Notation to Semantics: There and Back Again -- Managing Informal Mathematical Knowledge: Techniques from Informal Logic -- From Untyped to Polymorphically Typed Objects in Mathematical Web Services -- Managing Automatically Formed Mathematical Theories -- Authoring LeActiveMath Calculus Content -- Information Retrieval and Rendering with MML Query -- Integrating Dynamic Geometry Software, Deduction Systems, and Theorem Repositories. |
| Altri titoli varianti | MKM 2006 |
| Record Nr. | UNINA-9910767556503321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||