Automated deduction, CADE-11 : 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992 : proceedings / / D. Kapur, ed |
Pubbl/distr/stampa | Springer Berlin Heidelberg |
Disciplina | 511.3 |
Altri autori (Persone) | KapurDeepak |
Soggetto topico |
Automatic theorem proving - Congresses
Logic, Symbolic and mathematical - Congresses |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Automated Deduction—CADE-11 |
Record Nr. | UNISA-996465756603316 |
Springer Berlin Heidelberg | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning [[electronic resource] ] : 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, July 19-22, 2014, Proceedings / / edited by Stéphane Demri, Deepak Kapur, Christoph Weidenbach |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXVIII, 528 p. 101 illus.) |
Disciplina | 004.015113 |
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 |
ISBN | 3-319-08587-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | From Reachability to Temporal Specifications in Cost-Sharing Games -- Electronic Voting: How Logic Can Help -- And-Or Tableaux for Fix point Logics with Converse: LTL, CTL, PDL and CPDL -- Unified Classical Logic Completeness: A Coinductive Pearl -- A Focused Sequent Calculus for Higher-Order Logic -- SAT-Based Decision Procedure for Analytic Pure Sequent Calculi -- A Unified Proof System for QBF Pre processing -- The Fractal Dimension of SAT Formulas -- A Gentle Non-disjoint Combination of Satisfiability Procedures -- A Rewriting Strategy to Generate Prime Implicates in Equational Logic -- Finite Quantification in Hierarchic Theorem Proving -- Computing All Implied Equalities via SMT-Based Partition Refinement -- Proving Termination of Programs Automatically with A Pro VE -- Locality Transfer: From Constrained Axiomatizations to Reachability Predicates -- Proving Termination and Memory Safety for Programs with Pointer Arithmetic -- QBF Encoding of Temporal Properties and QBF-Based Verification -- Introducing Quantified Cuts in Logic with Equality -- Quati: An Automated Tool for Proving Permutation Lemmas -- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description -- M lean CoP: A Connection Prover for First-Order Modal Logic -- Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ -- dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems -- Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications -- Clausal Resolution for Modal Logics of Confluence -- Implementing Tableau Calculi Using BDDs: BDDTab System Description -- Approximations for Model Construction -- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic -- StarExec: A Cross-Community Infrastructure for Logic -- Skeptik: A Proof Compression System -- Terminating Minimal Model Generation Procedures for Propositional Modal Logics -- Cool – A Generic Reasoner for Coalgebraic Hybrid Logics (System Description) -- The Complexity of Theorem Proving in Circumscription and Minimal Entailment -- Visibly Linear Temporal Logic -- Count and Forget: Uniform Interpolation of SHQ- Ontologies -- Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures -- EL-ifying Ontologies -- The Bayesian Description Logic BEL -- OTTER Proofs in Tarskian Geometry -- NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics -- Knowledge Engineering for Large Ontologies with Sigma KEE 3.0. |
Record Nr. | UNISA-996213700203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning : 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, July 19-22, 2014, Proceedings / / edited by Stéphane Demri, Deepak Kapur, Christoph Weidenbach |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXVIII, 528 p. 101 illus.) |
Disciplina | 004.015113 |
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 |
ISBN | 3-319-08587-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | From Reachability to Temporal Specifications in Cost-Sharing Games -- Electronic Voting: How Logic Can Help -- And-Or Tableaux for Fix point Logics with Converse: LTL, CTL, PDL and CPDL -- Unified Classical Logic Completeness: A Coinductive Pearl -- A Focused Sequent Calculus for Higher-Order Logic -- SAT-Based Decision Procedure for Analytic Pure Sequent Calculi -- A Unified Proof System for QBF Pre processing -- The Fractal Dimension of SAT Formulas -- A Gentle Non-disjoint Combination of Satisfiability Procedures -- A Rewriting Strategy to Generate Prime Implicates in Equational Logic -- Finite Quantification in Hierarchic Theorem Proving -- Computing All Implied Equalities via SMT-Based Partition Refinement -- Proving Termination of Programs Automatically with A Pro VE -- Locality Transfer: From Constrained Axiomatizations to Reachability Predicates -- Proving Termination and Memory Safety for Programs with Pointer Arithmetic -- QBF Encoding of Temporal Properties and QBF-Based Verification -- Introducing Quantified Cuts in Logic with Equality -- Quati: An Automated Tool for Proving Permutation Lemmas -- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description -- M lean CoP: A Connection Prover for First-Order Modal Logic -- Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ -- dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems -- Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications -- Clausal Resolution for Modal Logics of Confluence -- Implementing Tableau Calculi Using BDDs: BDDTab System Description -- Approximations for Model Construction -- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic -- StarExec: A Cross-Community Infrastructure for Logic -- Skeptik: A Proof Compression System -- Terminating Minimal Model Generation Procedures for Propositional Modal Logics -- Cool – A Generic Reasoner for Coalgebraic Hybrid Logics (System Description) -- The Complexity of Theorem Proving in Circumscription and Minimal Entailment -- Visibly Linear Temporal Logic -- Count and Forget: Uniform Interpolation of SHQ- Ontologies -- Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures -- EL-ifying Ontologies -- The Bayesian Description Logic BEL -- OTTER Proofs in Tarskian Geometry -- NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics -- Knowledge Engineering for Large Ontologies with Sigma KEE 3.0. |
Record Nr. | UNINA-9910483923003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computer mathematics : 8th Asian symposium, ASCM 2007, Singapore, December 15-17, 2007 : revised and invited papers / / Deepak Kapur (editor) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
Descrizione fisica | 1 online resource (XI, 359 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico | Computer science - Mathematics |
ISBN | 3-540-87827-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms and Implementations -- Computing the Minkowski Value of the Exponential Function over a Complex Disk -- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact -- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval -- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping -- Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? -- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis -- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix -- Efficient Algorithms for Computing Nœther Normalization -- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual -- Evaluation of a Java Computer Algebra System -- A New Property of Hamming Graphs and Mesh of d-ary Trees -- Numerical Methods and Applications -- An Interpolation Method That Minimizes an Energy Integral of Fractional Order -- Solving Biomechanical Model Using Third-Order Runge-Kutta Methods -- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems -- Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution -- A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations -- On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators -- Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media -- Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream -- Elimination: Triangular Forms, Resultants, Equation Solving -- An Algorithm for Transforming Regular Chain into Normal Chain -- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals -- Regular Decompositions -- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation -- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports -- Properties of Ascending Chains for Partial Difference Polynomial Systems -- Cryptology -- Some Mathematical Problems in Cryptanalysis -- A Reduction Attack on Algebraic Surface Public-Key Cryptosystems -- Computational Logic -- The Four Colour Theorem: Engineering of a Formal Proof -- On the Computation of Elimination Ideals of Boolean Polynomial Rings -- Computer Search for Large Sets of Idempotent Quasigroups. |
Record Nr. | UNINA-9910483778603321 |
Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computer mathematics : 8th Asian symposium, ASCM 2007, Singapore, December 15-17, 2007 : revised and invited papers / / Deepak Kapur (editor) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
Descrizione fisica | 1 online resource (XI, 359 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico | Computer science - Mathematics |
ISBN | 3-540-87827-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms and Implementations -- Computing the Minkowski Value of the Exponential Function over a Complex Disk -- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact -- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval -- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping -- Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? -- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis -- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix -- Efficient Algorithms for Computing Nœther Normalization -- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual -- Evaluation of a Java Computer Algebra System -- A New Property of Hamming Graphs and Mesh of d-ary Trees -- Numerical Methods and Applications -- An Interpolation Method That Minimizes an Energy Integral of Fractional Order -- Solving Biomechanical Model Using Third-Order Runge-Kutta Methods -- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems -- Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution -- A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations -- On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators -- Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media -- Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream -- Elimination: Triangular Forms, Resultants, Equation Solving -- An Algorithm for Transforming Regular Chain into Normal Chain -- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals -- Regular Decompositions -- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation -- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports -- Properties of Ascending Chains for Partial Difference Polynomial Systems -- Cryptology -- Some Mathematical Problems in Cryptanalysis -- A Reduction Attack on Algebraic Surface Public-Key Cryptosystems -- Computational Logic -- The Four Colour Theorem: Engineering of a Formal Proof -- On the Computation of Elimination Ideals of Boolean Polynomial Rings -- Computer Search for Large Sets of Idempotent Quasigroups. |
Record Nr. | UNISA-996466112703316 |
Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Dependable Software Engineering: Theories, Tools, and Applications [[electronic resource] ] : Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings / / edited by Martin Fränzle, Deepak Kapur, Naijun Zhan |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVIII, 323 p. 78 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Mathematical logic Computer simulation Mathematical statistics Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Simulation and Modeling Probability and Statistics in Computer Science |
ISBN | 3-319-47677-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependable Cyber-Physical Systems -- From Finitely Many Simulations to Flowpipes -- Toward Automatic Verification of Quantum Programs -- Place Bisimulation and Liveness for Open Petri Nets -- Divergence Detection for CCSL Specification via Clock Causality Chain -- Performance Evaluation on Modern Concurrent Data Structures -- GPU-accelerated Steady-state Computation of Large Probabilistic Boolean Networks -- Behavioural Pseudometrics for Nondeterministic Probabilistic Systems -- A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques -- Computing Specification-Sensitive Abstractions for Program Verification -- Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models -- Identifying XML Schema Constraints Using Temporal Logic -- Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET -- Importance Sampling for Stochastic Timed Automata -- Semipositivity in Separation Logic with Two Variables -- Distributed Computation of Fixed Points on Dependency Graphs -- A Complete Approximation Theory for Weighted Transition Systems -- Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies -- Exploiting Symmetry for Efficient Verification of Infinite-state Component-based Systems -- Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach -- An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties -- Time-bounded Statistical Analysis of Resource-constrained Business Processes with Distributed Probabilistic Systems -- Failure Estimation of Behavioral Specifications. . |
Record Nr. | UNISA-996465331703316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Dependable Software Engineering: Theories, Tools, and Applications : Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings / / edited by Martin Fränzle, Deepak Kapur, Naijun Zhan |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVIII, 323 p. 78 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Mathematical logic Computer simulation Mathematical statistics Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Simulation and Modeling Probability and Statistics in Computer Science |
ISBN | 3-319-47677-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependable Cyber-Physical Systems -- From Finitely Many Simulations to Flowpipes -- Toward Automatic Verification of Quantum Programs -- Place Bisimulation and Liveness for Open Petri Nets -- Divergence Detection for CCSL Specification via Clock Causality Chain -- Performance Evaluation on Modern Concurrent Data Structures -- GPU-accelerated Steady-state Computation of Large Probabilistic Boolean Networks -- Behavioural Pseudometrics for Nondeterministic Probabilistic Systems -- A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques -- Computing Specification-Sensitive Abstractions for Program Verification -- Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models -- Identifying XML Schema Constraints Using Temporal Logic -- Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET -- Importance Sampling for Stochastic Timed Automata -- Semipositivity in Separation Logic with Two Variables -- Distributed Computation of Fixed Points on Dependency Graphs -- A Complete Approximation Theory for Weighted Transition Systems -- Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies -- Exploiting Symmetry for Efficient Verification of Infinite-state Component-based Systems -- Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach -- An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties -- Time-bounded Statistical Analysis of Resource-constrained Business Processes with Distributed Probabilistic Systems -- Failure Estimation of Behavioral Specifications. . |
Record Nr. | UNINA-9910483766403321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Theoretical Aspects of Computing – ICTAC 2017 [[electronic resource] ] : 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings / / edited by Dang Van Hung, Deepak Kapur |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XX, 305 p. 58 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Compilers (Computer programs) Artificial intelligence Software engineering Machine theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Artificial Intelligence Software Engineering Formal Languages and Automata Theory |
ISBN | 3-319-67729-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Logics -- Software components and concurrency -- Automata -- SMT solvers and algorithms -- Security. |
Record Nr. | UNISA-996466237503316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theoretical Aspects of Computing – ICTAC 2017 : 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings / / edited by Dang Van Hung, Deepak Kapur |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XX, 305 p. 58 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Compilers (Computer programs) Artificial intelligence Software engineering Machine theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Artificial Intelligence Software Engineering Formal Languages and Automata Theory |
ISBN | 3-319-67729-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Logics -- Software components and concurrency -- Automata -- SMT solvers and algorithms -- Security. |
Record Nr. | UNINA-9910483656903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|