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] ] : 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
| 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
| 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 | ||
| ||
Programming Logics [[electronic resource] ] : Essays in Memory of Harald Ganzinger / / edited by Andrei Voronkov, Christoph Weidenbach
| Programming Logics [[electronic resource] ] : Essays in Memory of Harald Ganzinger / / edited by Andrei Voronkov, Christoph Weidenbach |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 447 p. 69 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer programming Computer science Image processing—Digital techniques Computer vision Formal Languages and Automata Theory Artificial Intelligence Programming Techniques Computer Science Logic and Foundations of Programming Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-37651-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Harald Ganzinger’s Legacy: Contributions to Logics and Programming -- Bio-Logics: Logical Analysis of Bioregulatory Networks -- Canonical Ground Horn Theories -- Generic Functional Representation of Sorted Trees Supporting Attribution (Haskell Can Do It) -- The Blossom of Finite Semantic Trees -- Functional Logic Programming: From Theory to Curry -- From Search to Computation: Redundancy Criteria and Simplification at Work -- Elimination Techniques for Program Analysis -- Narrowing Based Inductive Proof Search -- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning -- Common Knowledge Logic in a Higher Order Proof Assistant -- Constructing Bachmair-Ganzinger Models -- Planning with Effectively Propositional Logic -- The Relative Power of Semantics and Unification -- First-Order Resolution Methods for Modal Logics -- On Combinations of Local Theory Extensions -- Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs. |
| Record Nr. | UNISA-996466189203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Programming Logics : Essays in Memory of Harald Ganzinger / / edited by Andrei Voronkov, Christoph Weidenbach
| Programming Logics : Essays in Memory of Harald Ganzinger / / edited by Andrei Voronkov, Christoph Weidenbach |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 447 p. 69 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Artificial intelligence Computer programming Computer science Image processing—Digital techniques Computer vision Formal Languages and Automata Theory Artificial Intelligence Programming Techniques Computer Science Logic and Foundations of Programming Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-37651-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Harald Ganzinger’s Legacy: Contributions to Logics and Programming -- Bio-Logics: Logical Analysis of Bioregulatory Networks -- Canonical Ground Horn Theories -- Generic Functional Representation of Sorted Trees Supporting Attribution (Haskell Can Do It) -- The Blossom of Finite Semantic Trees -- Functional Logic Programming: From Theory to Curry -- From Search to Computation: Redundancy Criteria and Simplification at Work -- Elimination Techniques for Program Analysis -- Narrowing Based Inductive Proof Search -- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning -- Common Knowledge Logic in a Higher Order Proof Assistant -- Constructing Bachmair-Ganzinger Models -- Planning with Effectively Propositional Logic -- The Relative Power of Semantics and Unification -- First-Order Resolution Methods for Modal Logics -- On Combinations of Local Theory Extensions -- Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs. |
| Record Nr. | UNINA-9910739479403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||