Automated deduction - CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009 : proceedings / / Renate A. Schmidt |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2009] |
Descrizione fisica | 1 online resource (515 p.) |
Disciplina | 006.3 |
Collana |
Lecture notes in computer science
Lecture notes in artificial intelligence LNCS sublibrary. SL 7, Artificial intelligence |
Soggetto topico |
Logic, Symbolic and mathematical
Automatic theorem proving |
ISBN |
1-282-33197-3
9786612331978 3-642-02959-0 |
Classificazione |
DAT 706f
DAT 716f SS 4800 004 510 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1. Invited Talk -- Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival -- Session 2. Combinations and Extensions -- Superposition and Model Evolution Combined -- On Deciding Satisfiability by DPLL( ) and Unsound Theorem Proving -- Combinable Extensions of Abelian Groups -- Locality Results for Certain Extensions of Theories with Bridging Functions -- Session 3. Minimal Unsatisfiability and Automated Reasoning Support -- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis -- Does This Set of Clauses Overlap with at Least One MUS? -- Progress in the Development of Automated Theorem Proving for Higher-Order Logic -- Session 4. System Descriptions -- System Description: H-PILoT -- SPASS Version 3.5 -- Dei: A Theorem Prover for Terms with Integer Exponents -- veriT: An Open, Trustable and Efficient SMT-Solver -- Divvy: An ATP Meta-system Based on Axiom Relevance Ordering -- Session 5. Invited Talk -- Instantiation-Based Automated Reasoning: From Theory to Practice -- Session 6. Interpolation and Predicate Abstraction -- Interpolant Generation for UTVPI -- Ground Interpolation for Combined Theories -- Interpolation and Symbol Elimination -- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction -- Session 7. Resolution-Based Systems for Non-classical Logics -- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method -- A Refined Resolution Calculus for CTL -- Fair Derivations in Monodic Temporal Reasoning -- Session 8. Termination Analysis and Constraint Solving -- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs -- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic -- Session 9. Invited Talk -- Building Theorem Provers -- Session 10. Rewriting, Termination and Productivity -- Termination Analysis by Dependency Pairs and Inductive Theorem Proving -- Beyond Dependency Graphs -- Computing Knowledge in Security Protocols under Convergent Equational Theories -- Complexity of Fractran and Productivity -- Session 11. Models -- Automated Inference of Finite Unsatisfiability -- Decidability Results for Saturation-Based Model Building -- Session 12. Modal Tableaux with Global Caching -- A Tableau Calculus for Regular Grammar Logics with Converse -- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability -- Session 13. Arithmetic -- Volume Computation for Boolean Combination of Linear Arithmetic Constraints -- A Generalization of Semenov’s Theorem to Automata over Real Numbers -- Real World Verification. |
Altri titoli varianti | CADE 22 |
Record Nr. | UNINA-9910483050003321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated deduction - CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009 : proceedings / / Renate A. Schmidt |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2009] |
Descrizione fisica | 1 online resource (515 p.) |
Disciplina | 006.3 |
Collana |
Lecture notes in computer science
Lecture notes in artificial intelligence LNCS sublibrary. SL 7, Artificial intelligence |
Soggetto topico |
Logic, Symbolic and mathematical
Automatic theorem proving |
ISBN |
1-282-33197-3
9786612331978 3-642-02959-0 |
Classificazione |
DAT 706f
DAT 716f SS 4800 004 510 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1. Invited Talk -- Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival -- Session 2. Combinations and Extensions -- Superposition and Model Evolution Combined -- On Deciding Satisfiability by DPLL( ) and Unsound Theorem Proving -- Combinable Extensions of Abelian Groups -- Locality Results for Certain Extensions of Theories with Bridging Functions -- Session 3. Minimal Unsatisfiability and Automated Reasoning Support -- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis -- Does This Set of Clauses Overlap with at Least One MUS? -- Progress in the Development of Automated Theorem Proving for Higher-Order Logic -- Session 4. System Descriptions -- System Description: H-PILoT -- SPASS Version 3.5 -- Dei: A Theorem Prover for Terms with Integer Exponents -- veriT: An Open, Trustable and Efficient SMT-Solver -- Divvy: An ATP Meta-system Based on Axiom Relevance Ordering -- Session 5. Invited Talk -- Instantiation-Based Automated Reasoning: From Theory to Practice -- Session 6. Interpolation and Predicate Abstraction -- Interpolant Generation for UTVPI -- Ground Interpolation for Combined Theories -- Interpolation and Symbol Elimination -- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction -- Session 7. Resolution-Based Systems for Non-classical Logics -- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method -- A Refined Resolution Calculus for CTL -- Fair Derivations in Monodic Temporal Reasoning -- Session 8. Termination Analysis and Constraint Solving -- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs -- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic -- Session 9. Invited Talk -- Building Theorem Provers -- Session 10. Rewriting, Termination and Productivity -- Termination Analysis by Dependency Pairs and Inductive Theorem Proving -- Beyond Dependency Graphs -- Computing Knowledge in Security Protocols under Convergent Equational Theories -- Complexity of Fractran and Productivity -- Session 11. Models -- Automated Inference of Finite Unsatisfiability -- Decidability Results for Saturation-Based Model Building -- Session 12. Modal Tableaux with Global Caching -- A Tableau Calculus for Regular Grammar Logics with Converse -- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability -- Session 13. Arithmetic -- Volume Computation for Boolean Combination of Linear Arithmetic Constraints -- A Generalization of Semenov’s Theorem to Automata over Real Numbers -- Real World Verification. |
Altri titoli varianti | CADE 22 |
Record Nr. | UNISA-996465837603316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Deduction -- CADE-24 [[electronic resource] ] : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVI, 466 p. 95 illus.) : digital |
Disciplina | 511.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Algorithms Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Algorithm Analysis and Problem Complexity |
Soggetto genere / forma |
Kongress2013.Lake Placid, NY
Conference papers and proceedings. |
ISBN | 3-642-38574-5 |
Classificazione |
004
510 DAT 706f DAT 716f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | One Logic to Use Them All -- The Tree Width of Separation Logic with Recursive Definitions -- Hierarchic Superposition with Weak Abstraction -- Completeness and Decidability Results for First-Order Clauses with Indices -- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies -- Tractable Inference Systems: An Extension with a Deducibility Predicate -- Computing Tiny Clause Normal Forms -- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme -- Automated Reasoning, Fast and Slow -- Foundational Proof Certificates in First-Order Logic -- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals -- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition -- dReal: An SMT Solver for Nonlinear Theories over the Reals -- Solving Difference Constraints over Modular Arithmetic -- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis -- Hierarchical Combination -- PRocH: Proof Reconstruction for HOL Light -- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description -- Towards Modularly Comparing Programs Using Automated Theorem Provers -- Reuse in Software Verification by Abstract Method Calls -- Dynamic Logic with Trace Semantics -- Temporalizing Ontology-Based Data Access -- Verifying Refutations with Extended Resolution -- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems -- Quantifier Instantiation Techniques for Finite Model Finding in SMT -- Automating Inductive Proofs Using Theory Exploration -- E-MaLeS 1.1 -- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism -- Propositional Temporal Proving with Reductions to a SAT Problem -- InKreSAT: Modal Reasoning via Incremental Reduction to SAT -- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR -- The 481 Ways to Split a Clause and Deal with Propositional Variables. |
Record Nr. | UNISA-996465852703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Deduction -- CADE-24 [[electronic resource] ] : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVI, 466 p. 95 illus.) : digital |
Disciplina | 511.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Algorithms Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Algorithm Analysis and Problem Complexity |
Soggetto genere / forma |
Kongress2013.Lake Placid, NY
Conference papers and proceedings. |
ISBN | 3-642-38574-5 |
Classificazione |
004
510 DAT 706f DAT 716f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | One Logic to Use Them All -- The Tree Width of Separation Logic with Recursive Definitions -- Hierarchic Superposition with Weak Abstraction -- Completeness and Decidability Results for First-Order Clauses with Indices -- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies -- Tractable Inference Systems: An Extension with a Deducibility Predicate -- Computing Tiny Clause Normal Forms -- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme -- Automated Reasoning, Fast and Slow -- Foundational Proof Certificates in First-Order Logic -- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals -- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition -- dReal: An SMT Solver for Nonlinear Theories over the Reals -- Solving Difference Constraints over Modular Arithmetic -- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis -- Hierarchical Combination -- PRocH: Proof Reconstruction for HOL Light -- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description -- Towards Modularly Comparing Programs Using Automated Theorem Provers -- Reuse in Software Verification by Abstract Method Calls -- Dynamic Logic with Trace Semantics -- Temporalizing Ontology-Based Data Access -- Verifying Refutations with Extended Resolution -- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems -- Quantifier Instantiation Techniques for Finite Model Finding in SMT -- Automating Inductive Proofs Using Theory Exploration -- E-MaLeS 1.1 -- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism -- Propositional Temporal Proving with Reductions to a SAT Problem -- InKreSAT: Modal Reasoning via Incremental Reduction to SAT -- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR -- The 481 Ways to Split a Clause and Deal with Propositional Variables. |
Record Nr. | UNINA-9910483964403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Reasoning and Mathematics [[electronic resource] ] : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 259 p. 27 illus.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Computer science—Mathematics Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Math Applications in Computer Science |
Soggetto genere / forma | Aufsatzsammlung |
ISBN | 3-642-36675-9 |
Classificazione |
DAT 700f
DAT 702f DAT 706f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466265003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning and Mathematics [[electronic resource] ] : Essays in Memory of William W. McCune / / edited by Maria Paola Bonacina, Mark E. Stickel |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 259 p. 27 illus.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Computer science—Mathematics Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Math Applications in Computer Science |
Soggetto genere / forma | Aufsatzsammlung |
ISBN | 3-642-36675-9 |
Classificazione |
DAT 700f
DAT 702f DAT 706f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910483182703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009, Proceedings / / edited by Martin Giese, Arild Waaler |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XII, 341 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer programming Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering |
Soggetto genere / forma |
Kongress2009.Oslo
Conference papers and proceedings. Kongress. Oslo (2009) |
ISBN | 3-642-02716-4 |
Classificazione |
DAT 706f
SS 4800 004 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Presenting Constraints -- On the Use of Automata for Deciding Linear Arithmetic -- Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus -- A Schemata Calculus for Propositional Logic -- Tableaux and Model Checking for Memory Logics -- Canonical Constructive Systems -- A Novel Architecture for Situation Awareness Systems -- On the Proof Theory of Regular Fixed Points -- Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus -- A Tableau-Based System for Spatial Reasoning about Directional Relations -- Terminating Tableaux for the Basic Fragment of Simple Type Theory -- Modular Sequent Systems for Modal Logic -- Abduction and Consequence Generation in a Support System for the Design of Logical Multiple-Choice Questions -- Goal-Directed Invariant Synthesis for Model Checking Modulo Theories -- Taming Displayed Tense Logics Using Nested Sequents with Deep Inference -- Sound Global State Caching for ALC with Inverse Roles -- A Tableau System for the Modal ?-Calculus -- Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies -- Prime Implicate Tries -- Proof Systems for a Gödel Modal Logic -- Generic Modal Cut Elimination Applied to Conditional Logics -- Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents -- Automated Synthesis of Tableau Calculi -- Tableaux for Projection Computation and Knowledge Compilation. |
Record Nr. | UNISA-996465384603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009, Proceedings / / edited by Martin Giese, Arild Waaler |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XII, 341 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer programming Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering |
Soggetto genere / forma |
Kongress2009.Oslo
Conference papers and proceedings. Kongress. Oslo (2009) |
ISBN | 3-642-02716-4 |
Classificazione |
DAT 706f
SS 4800 004 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Presenting Constraints -- On the Use of Automata for Deciding Linear Arithmetic -- Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus -- A Schemata Calculus for Propositional Logic -- Tableaux and Model Checking for Memory Logics -- Canonical Constructive Systems -- A Novel Architecture for Situation Awareness Systems -- On the Proof Theory of Regular Fixed Points -- Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus -- A Tableau-Based System for Spatial Reasoning about Directional Relations -- Terminating Tableaux for the Basic Fragment of Simple Type Theory -- Modular Sequent Systems for Modal Logic -- Abduction and Consequence Generation in a Support System for the Design of Logical Multiple-Choice Questions -- Goal-Directed Invariant Synthesis for Model Checking Modulo Theories -- Taming Displayed Tense Logics Using Nested Sequents with Deep Inference -- Sound Global State Caching for ALC with Inverse Roles -- A Tableau System for the Modal ?-Calculus -- Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies -- Prime Implicate Tries -- Proof Systems for a Gödel Modal Logic -- Generic Modal Cut Elimination Applied to Conditional Logics -- Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents -- Automated Synthesis of Tableau Calculi -- Tableaux for Projection Computation and Knowledge Compilation. |
Record Nr. | UNINA-9910485143803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Case-based reasoning research and development : 8th International Conference on Case-Based Reasoning, ICCBR 2009, Seattle, WA, USA, July 20-23, 2009 : proceedings / / Lorraine McGinty, David C. Wilson (eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2009] |
Descrizione fisica | 1 online resource (536 p.) |
Disciplina | 006.333 |
Collana |
Lecture notes in computer science
Lecture notes in artificial intelligence |
Soggetto topico |
Artificial intelligence
Case-based reasoning Expert systems (Computer science) |
ISBN |
1-282-29797-X
9786612297977 3-642-02998-1 |
Classificazione |
DAT 706f
SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- We’re Wiser Together -- Black Swans, Gray Cygnets and Other Rare Birds -- Theoretical/Methodological Research Papers -- Case Retrieval Reuse Net (CR2N): An Architecture for Reuse of Textual Solutions -- Case-Based Reasoning in Transfer Learning -- Toward Modeling and Teaching Legal Case-Based Adaptation with Expert Examples -- Opportunistic Adaptation Knowledge Discovery -- Improving Reinforcement Learning by Using Case Based Heuristics -- Dimensions of Case-Based Reasoner Quality Management -- Belief Merging-Based Case Combination -- Maintenance by a Committee of Experts: The MACE Approach to Case-Base Maintenance -- The Good, the Bad and the Incorrectly Classified: Profiling Cases for Case-Base Editing -- An Active Approach to Automatic Case Generation -- Four Heads Are Better than One: Combining Suggestions for Case Adaptation -- Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions -- Boosting CBR Agents with Genetic Algorithms -- Using Meta-reasoning to Improve the Performance of Case-Based Planning -- Multi-level Abstractions and Multi-dimensional Retrieval of Cases with Time Series Features -- On Similarity Measures Based on a Refinement Lattice -- An Overview of the Deterministic Dynamic Associative Memory (DDAM) Model for Case Representation and Retrieval -- Robust Measures of Complexity in TCBR -- S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control -- Quality Enhancement Based on Reinforcement Learning and Feature Weighting for a Critiquing-Based Recommender -- Abstraction in Knowledge-Rich Models for Case-Based Planning -- A Scalable Noise Reduction Technique for Large Case-Based Systems -- Conceptual Neighborhoods for Retrieval in Case-Based Reasoning -- CBR Supports Decision Analysis with Uncertainty -- Constraint-Based Case-Based Planning Using Weighted MAX-SAT -- Applied Research Papers -- A Value Supplementation Method for Case Bases with Incomplete Information -- Efficiently Implementing Episodic Memory -- Integration of a Methodology for Cluster-Based Retrieval in jColibri -- Case-Based Collective Inference for Maritime Object Classification -- Case-Based Reasoning for Situation-Aware Ambient Intelligence: A Hospital Ward Evaluation Study -- Spatial Event Prediction by Combining Value Function Approximation and Case-Based Reasoning -- Case-Based Support for Forestry Decisions: How to See the Wood from the Trees -- A Case-Based Perspective on Social Web Search -- Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge. |
Record Nr. | UNINA-9910484803903321 |
Berlin, Germany : , : Springer, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Case-based reasoning research and development : 8th International Conference on Case-Based Reasoning, ICCBR 2009, Seattle, WA, USA, July 20-23, 2009 : proceedings / / Lorraine McGinty, David C. Wilson (eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2009] |
Descrizione fisica | 1 online resource (536 p.) |
Disciplina | 006.333 |
Collana |
Lecture notes in computer science
Lecture notes in artificial intelligence |
Soggetto topico |
Artificial intelligence
Case-based reasoning Expert systems (Computer science) |
ISBN |
1-282-29797-X
9786612297977 3-642-02998-1 |
Classificazione |
DAT 706f
SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- We’re Wiser Together -- Black Swans, Gray Cygnets and Other Rare Birds -- Theoretical/Methodological Research Papers -- Case Retrieval Reuse Net (CR2N): An Architecture for Reuse of Textual Solutions -- Case-Based Reasoning in Transfer Learning -- Toward Modeling and Teaching Legal Case-Based Adaptation with Expert Examples -- Opportunistic Adaptation Knowledge Discovery -- Improving Reinforcement Learning by Using Case Based Heuristics -- Dimensions of Case-Based Reasoner Quality Management -- Belief Merging-Based Case Combination -- Maintenance by a Committee of Experts: The MACE Approach to Case-Base Maintenance -- The Good, the Bad and the Incorrectly Classified: Profiling Cases for Case-Base Editing -- An Active Approach to Automatic Case Generation -- Four Heads Are Better than One: Combining Suggestions for Case Adaptation -- Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions -- Boosting CBR Agents with Genetic Algorithms -- Using Meta-reasoning to Improve the Performance of Case-Based Planning -- Multi-level Abstractions and Multi-dimensional Retrieval of Cases with Time Series Features -- On Similarity Measures Based on a Refinement Lattice -- An Overview of the Deterministic Dynamic Associative Memory (DDAM) Model for Case Representation and Retrieval -- Robust Measures of Complexity in TCBR -- S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control -- Quality Enhancement Based on Reinforcement Learning and Feature Weighting for a Critiquing-Based Recommender -- Abstraction in Knowledge-Rich Models for Case-Based Planning -- A Scalable Noise Reduction Technique for Large Case-Based Systems -- Conceptual Neighborhoods for Retrieval in Case-Based Reasoning -- CBR Supports Decision Analysis with Uncertainty -- Constraint-Based Case-Based Planning Using Weighted MAX-SAT -- Applied Research Papers -- A Value Supplementation Method for Case Bases with Incomplete Information -- Efficiently Implementing Episodic Memory -- Integration of a Methodology for Cluster-Based Retrieval in jColibri -- Case-Based Collective Inference for Maritime Object Classification -- Case-Based Reasoning for Situation-Aware Ambient Intelligence: A Hospital Ward Evaluation Study -- Spatial Event Prediction by Combining Value Function Approximation and Case-Based Reasoning -- Case-Based Support for Forestry Decisions: How to See the Wood from the Trees -- A Case-Based Perspective on Social Web Search -- Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge. |
Record Nr. | UNISA-996465847203316 |
Berlin, Germany : , : Springer, , [2009] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|