Abstract State Machines, Alloy, B, TLA, VDM, and Z [[electronic resource] ] : 6th International Conference, ABZ 2018, Southampton, UK, June 5–8, 2018, Proceedings / / edited by Michael Butler, Alexander Raschke, Thai Son Hoang, Klaus Reichl |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XIV, 432 p. 83 illus.) |
Disciplina | 006.31 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Algorithms Computer science Compilers (Computer programs) Artificial intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Artificial Intelligence |
ISBN | 3-319-91271-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Translation and Transformation -- Analysis and Tests -- Reals and Hybrid Systems -- Refinement -- Hybrid ERTMS Case Study -- Short Papers. |
Record Nr. | UNINA-9910349429803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Abstraction, Reformulation and Approximation [[electronic resource] ] : 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings / / edited by Jean-Daniel Zucker, Lorenza Saitta |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 380 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Computers
Artificial intelligence Computer logic Mathematical logic Theory of Computation Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
ISBN | 3-540-31882-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Full Papers -- Verifying the Incorrectness of Programs and Automata -- Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains -- Synthesizing Plans for Multiple Domains -- Abstract Policy Evaluation for Reactive Agents -- Implementing an Abstraction Framework for Soft Constraints -- Transforming and Refining Abstract Constraint Specifications -- Learning Regular Expressions from Noisy Sequences -- From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm -- Hierarchical Heuristic Search Revisited -- Multinomial Event Model Based Abstraction for Sequence and Text Classification -- Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies -- Detecting and Breaking Symmetries by Reasoning on Problem Specifications -- Approximate Model-Based Diagnosis Using Preference-Based Compilation -- Function Approximation via Tile Coding: Automating Parameter Choice -- Creating Better Abstract Operators -- A Specialised Binary Constraint for the Stable Marriage Problem -- Compositional Derivation of Symmetries for Constraint Satisfaction -- Extended Abstracts -- Solving the 24 Puzzle with Instance Dependent Pattern Databases -- Combining Feature Selection and Feature Construction to Improve Concept Learning for High Dimensional Data -- A Qualitative Spatio-temporal Abstraction of a Disaster Space -- The Cruncher: Automatic Concept Formation Using Minimum Description Length -- Experiments with Multiple Abstraction Heuristics in Symbolic Verification -- Probabilistic Abstraction of Uncertain Temporal Data for Multiple Subjects -- Learning Classifiers Using Hierarchically Structured Class Taxonomies -- Feature-Discovering Approximate Value Iteration Methods -- Invited Talks -- Designing Views to Efficiently Answer Real SQL Queries -- The Multi-depot Periodic Vehicle Routing Problem -- Abstract Representation in Painting and Computing -- Research Summaries -- Categorizing Gene Expression Correlations with Bioclinical Data: An Abstraction Based Approach -- Learning Abstract Scheduling Models -- Knowledge Acquisition on Manipulation of Flow and Water Quality Models -- Abstraction and Multiple Abstraction in the Symbolic Modeling of the Environment of Mobile Robots -- Sequential Decision Making Under Uncertainty -- Automatic State Abstraction for Pathfinding in Real-Time Video Games -- Model-Based Search -- Learning Skills in Reinforcement Learning Using Relative Novelty. |
Record Nr. | UNISA-996465781003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Abstraction, Reformulation and Approximation [[electronic resource] ] : 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings / / edited by Jean-Daniel Zucker, Lorenza Saitta |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 380 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Computers
Artificial intelligence Computer logic Mathematical logic Theory of Computation Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
ISBN | 3-540-31882-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Full Papers -- Verifying the Incorrectness of Programs and Automata -- Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains -- Synthesizing Plans for Multiple Domains -- Abstract Policy Evaluation for Reactive Agents -- Implementing an Abstraction Framework for Soft Constraints -- Transforming and Refining Abstract Constraint Specifications -- Learning Regular Expressions from Noisy Sequences -- From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm -- Hierarchical Heuristic Search Revisited -- Multinomial Event Model Based Abstraction for Sequence and Text Classification -- Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies -- Detecting and Breaking Symmetries by Reasoning on Problem Specifications -- Approximate Model-Based Diagnosis Using Preference-Based Compilation -- Function Approximation via Tile Coding: Automating Parameter Choice -- Creating Better Abstract Operators -- A Specialised Binary Constraint for the Stable Marriage Problem -- Compositional Derivation of Symmetries for Constraint Satisfaction -- Extended Abstracts -- Solving the 24 Puzzle with Instance Dependent Pattern Databases -- Combining Feature Selection and Feature Construction to Improve Concept Learning for High Dimensional Data -- A Qualitative Spatio-temporal Abstraction of a Disaster Space -- The Cruncher: Automatic Concept Formation Using Minimum Description Length -- Experiments with Multiple Abstraction Heuristics in Symbolic Verification -- Probabilistic Abstraction of Uncertain Temporal Data for Multiple Subjects -- Learning Classifiers Using Hierarchically Structured Class Taxonomies -- Feature-Discovering Approximate Value Iteration Methods -- Invited Talks -- Designing Views to Efficiently Answer Real SQL Queries -- The Multi-depot Periodic Vehicle Routing Problem -- Abstract Representation in Painting and Computing -- Research Summaries -- Categorizing Gene Expression Correlations with Bioclinical Data: An Abstraction Based Approach -- Learning Abstract Scheduling Models -- Knowledge Acquisition on Manipulation of Flow and Water Quality Models -- Abstraction and Multiple Abstraction in the Symbolic Modeling of the Environment of Mobile Robots -- Sequential Decision Making Under Uncertainty -- Automatic State Abstraction for Pathfinding in Real-Time Video Games -- Model-Based Search -- Learning Skills in Reinforcement Learning Using Relative Novelty. |
Record Nr. | UNINA-9910483584003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings / / edited by Ian Miguel, Wheeler Tuml |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XI, 420 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Mathematical logic Computer logic Artificial Intelligence Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-73580-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks (Abstracts) -- State Abstraction in Real-Time Heuristic Search -- Abstraction and Reformulation in the Generation of Constraint Models -- A Framework for Integrating Optimization and Constraint Programming -- Research Papers -- DFS-Tree Based Heuristic Search -- Partial Pattern Databases -- CDB-PV: A Constraint Database-Based Program Verifier -- Generating Implied Boolean Constraints Via Singleton Consistency -- Reformulating Constraint Satisfaction Problems to Improve Scalability -- Reformulating Global Constraints: The Slide and Regular Constraints -- Relaxation of Qualitative Constraint Networks -- Dynamic Domain Abstraction Through Meta-diagnosis -- Channeling Abstraction -- Approximate Model-Based Diagnosis Using Greedy Stochastic Search -- Combining Perimeter Search and Pattern Database Abstractions -- Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic -- Tailoring Solver-Independent Constraint Models: A Case Study with Essence? and Minion -- A Meta-CSP Model for Optimal Planning -- Reformulation for Extensional Reasoning -- An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus -- Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning -- Model-Based Exploration in Continuous State Spaces -- Active Learning of Dynamic Bayesian Networks in Markov Decision Processes -- Boosting MUS Extraction -- Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage -- Formalizing the Abstraction Process in Model-Based Diagnosis -- Boolean Approximation Revisited -- An Analysis of Map-Based Abstraction and Refinement -- Solving Difficult SAT Instances Using Greedy Clique Decomposition -- Abstraction and Complexity Measures -- Research Summaries -- Abstraction, Emergence, and Thought -- What’s Your Problem? The Problem of Problem Definition -- A Reformulation-Based Approach to Explanation in Constraint Satisfaction -- Integration of Constraint Programming and Metaheuristics -- Rule-Based Reasoning Via Abstraction -- Extensional Reasoning -- Reformulating Constraint Models Using Input Data -- Using Analogy Discovery to Create Abstractions -- Distributed CSPs: Why It Is Assumed a Variable per Agent? -- Decomposition of Games for Efficient Reasoning -- Generalized Constraint Acquisition -- Using Infeasibility to Improve Abstraction-Based Heuristics -- Leveraging Graph Locality Via Abstraction. |
Record Nr. | UNISA-996465302303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings / / edited by Ian Miguel, Wheeler Tuml |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XI, 420 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Mathematical logic Computer logic Artificial Intelligence Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-73580-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks (Abstracts) -- State Abstraction in Real-Time Heuristic Search -- Abstraction and Reformulation in the Generation of Constraint Models -- A Framework for Integrating Optimization and Constraint Programming -- Research Papers -- DFS-Tree Based Heuristic Search -- Partial Pattern Databases -- CDB-PV: A Constraint Database-Based Program Verifier -- Generating Implied Boolean Constraints Via Singleton Consistency -- Reformulating Constraint Satisfaction Problems to Improve Scalability -- Reformulating Global Constraints: The Slide and Regular Constraints -- Relaxation of Qualitative Constraint Networks -- Dynamic Domain Abstraction Through Meta-diagnosis -- Channeling Abstraction -- Approximate Model-Based Diagnosis Using Greedy Stochastic Search -- Combining Perimeter Search and Pattern Database Abstractions -- Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic -- Tailoring Solver-Independent Constraint Models: A Case Study with Essence? and Minion -- A Meta-CSP Model for Optimal Planning -- Reformulation for Extensional Reasoning -- An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus -- Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning -- Model-Based Exploration in Continuous State Spaces -- Active Learning of Dynamic Bayesian Networks in Markov Decision Processes -- Boosting MUS Extraction -- Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage -- Formalizing the Abstraction Process in Model-Based Diagnosis -- Boolean Approximation Revisited -- An Analysis of Map-Based Abstraction and Refinement -- Solving Difficult SAT Instances Using Greedy Clique Decomposition -- Abstraction and Complexity Measures -- Research Summaries -- Abstraction, Emergence, and Thought -- What’s Your Problem? The Problem of Problem Definition -- A Reformulation-Based Approach to Explanation in Constraint Satisfaction -- Integration of Constraint Programming and Metaheuristics -- Rule-Based Reasoning Via Abstraction -- Extensional Reasoning -- Reformulating Constraint Models Using Input Data -- Using Analogy Discovery to Create Abstractions -- Distributed CSPs: Why It Is Assumed a Variable per Agent? -- Decomposition of Games for Efficient Reasoning -- Generalized Constraint Acquisition -- Using Infeasibility to Improve Abstraction-Based Heuristics -- Leveraging Graph Locality Via Abstraction. |
Record Nr. | UNINA-9910484228503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings / / edited by Sven Koenig, Robert C. Holte |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 352 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Mathematical logic Computer logic Artificial Intelligence Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-45622-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Presentations -- Model Checking and Abstraction -- Reformulation in Planning -- Spatiotemporal Abstraction of Stochastic Sequential Processes -- State Space Relaxation and Search Strategies in Dynamic Programming -- Invited Presentations -- Admissible Moves in Two-Player Games -- Dynamic Bundling: Less Effort for More Solutions -- Symbolic Heuristic Search Using Decision Diagrams -- On the Construction of Human-Automation Interfaces by Formal Abstraction -- Pareto Optimization of Temporal Decisions -- An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection -- A Tractable Query Cache by Approximation -- An Algebraic Framework for Abstract Model Checking -- Action Timing Discretization with Iterative-Refinement -- Formalizing Approximate Objects and Theories: Some Initial Results -- Model Minimization in Hierarchical Reinforcement Learning -- Learning Options in Reinforcement Learning -- Approximation Techniques for Non-linear Problems with Continuum of Solutions -- Approximation of Relations by Propositional Formulas: Complexity and Semantics -- Abstracting Visual Percepts to Learn Concepts -- Short Presentations -- PAC Meditation on Boolean Formulas -- On the Reformulation of Vehicle Routing Problems and Scheduling Problems -- The Oracular Constraints Method -- Performance of Lookahead Control Policies in the Face of Abstractions and Approximations -- TTree: Tree-Based State Generalization with Temporally Abstract Actions -- Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction -- Research Summaries -- Abstracting Imperfect Information Game Trees -- Using Abstraction for Heuristic Search and Planning -- Approximation Techniques in Multiagent Learning -- Abstraction and Reformulation in GraphPlan -- Abstract Reasoning for Planning and Coordination -- Research Summary: Abstraction Techniques, and Their Value -- Reformulation of Non-binary Constraints -- Reformulating Combinatorial Optimization as Constraint Satisfaction -- Autonomous Discovery of Abstractions through Interaction with an Environment -- Interface Verification: Discrete Abstractions of Hybrid Systems -- Learning Semi-lattice Codebooks for Image Compression -- Research Summary -- Principled Exploitation of Heuristic Information -- Reformulation of Temporal Constraint Networks. |
Record Nr. | UNINA-9910143900703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings / / edited by Sven Koenig, Robert C. Holte |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XI, 352 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Computers Mathematical logic Computer logic Artificial Intelligence Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-45622-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Presentations -- Model Checking and Abstraction -- Reformulation in Planning -- Spatiotemporal Abstraction of Stochastic Sequential Processes -- State Space Relaxation and Search Strategies in Dynamic Programming -- Invited Presentations -- Admissible Moves in Two-Player Games -- Dynamic Bundling: Less Effort for More Solutions -- Symbolic Heuristic Search Using Decision Diagrams -- On the Construction of Human-Automation Interfaces by Formal Abstraction -- Pareto Optimization of Temporal Decisions -- An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection -- A Tractable Query Cache by Approximation -- An Algebraic Framework for Abstract Model Checking -- Action Timing Discretization with Iterative-Refinement -- Formalizing Approximate Objects and Theories: Some Initial Results -- Model Minimization in Hierarchical Reinforcement Learning -- Learning Options in Reinforcement Learning -- Approximation Techniques for Non-linear Problems with Continuum of Solutions -- Approximation of Relations by Propositional Formulas: Complexity and Semantics -- Abstracting Visual Percepts to Learn Concepts -- Short Presentations -- PAC Meditation on Boolean Formulas -- On the Reformulation of Vehicle Routing Problems and Scheduling Problems -- The Oracular Constraints Method -- Performance of Lookahead Control Policies in the Face of Abstractions and Approximations -- TTree: Tree-Based State Generalization with Temporally Abstract Actions -- Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction -- Research Summaries -- Abstracting Imperfect Information Game Trees -- Using Abstraction for Heuristic Search and Planning -- Approximation Techniques in Multiagent Learning -- Abstraction and Reformulation in GraphPlan -- Abstract Reasoning for Planning and Coordination -- Research Summary: Abstraction Techniques, and Their Value -- Reformulation of Non-binary Constraints -- Reformulating Combinatorial Optimization as Constraint Satisfaction -- Autonomous Discovery of Abstractions through Interaction with an Environment -- Interface Verification: Discrete Abstractions of Hybrid Systems -- Learning Semi-lattice Codebooks for Image Compression -- Research Summary -- Principled Exploitation of Heuristic Information -- Reformulation of Temporal Constraint Networks. |
Record Nr. | UNISA-996465401403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings / / edited by Berthe Y. Choueiry, Toby Walsh |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 336 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Software engineering Mathematical logic Computer logic Artificial Intelligence Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-44914-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Partial Completeness of Abstract Fixpoint Checking -- An Overview of MAXQ Hierarchical Reinforcement Learning -- Recent Progress in the Design and Analysis of Admissible Heuristic Functions -- Tutorial -- GIS Databases: From Multiscale to MultiRepresentation -- Full Papers -- An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation -- Abstractions for Knowledge Organization of Relational Descriptions -- Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions -- Approximating Data in Constraint Databases -- Linearly Bounded Reformulations of Unary Databases -- A CSP Abstraction Framework -- Interactions of Abstractions in Programming -- Reformulation and Approximation in Model Checking -- The Lumberjack Algorithm for Learning Linked Decision Forests -- Reformulating Propositional Satisfiability as Constraint Satisfaction -- Extended Abstracts -- Improving the Efficiency of Reasoning Through Structure-Based Reformulation -- Using Feature Hierarchies in Bayesian Network Learning -- On Reformulating Planning as Dynamic Constraint Satisfaction -- Experiments with Automatically Created Memory-Based Heuristics -- Abstraction and Phase Transitions in Relational Learning -- Posters -- An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis -- A Compositional Approach to Causality -- A Method for Finding Consistent Hypotheses Using Abstraction -- Research Summaries -- Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction -- Using and Learning Abstraction Hierarchies for Planning -- Learning Probabilistic Relational Models -- Synergy between Compositional Modeling and Bayesian Networks -- A CSP Abstraction Framework -- Answering Queries with Database Restrictions -- Research Summary. |
Record Nr. | UNISA-996465437703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Abstraction, Reformulation, and Approximation [[electronic resource] ] : 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings / / edited by Berthe Y. Choueiry, Toby Walsh |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 336 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Software engineering Mathematical logic Computer logic Artificial Intelligence Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-44914-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Partial Completeness of Abstract Fixpoint Checking -- An Overview of MAXQ Hierarchical Reinforcement Learning -- Recent Progress in the Design and Analysis of Admissible Heuristic Functions -- Tutorial -- GIS Databases: From Multiscale to MultiRepresentation -- Full Papers -- An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation -- Abstractions for Knowledge Organization of Relational Descriptions -- Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions -- Approximating Data in Constraint Databases -- Linearly Bounded Reformulations of Unary Databases -- A CSP Abstraction Framework -- Interactions of Abstractions in Programming -- Reformulation and Approximation in Model Checking -- The Lumberjack Algorithm for Learning Linked Decision Forests -- Reformulating Propositional Satisfiability as Constraint Satisfaction -- Extended Abstracts -- Improving the Efficiency of Reasoning Through Structure-Based Reformulation -- Using Feature Hierarchies in Bayesian Network Learning -- On Reformulating Planning as Dynamic Constraint Satisfaction -- Experiments with Automatically Created Memory-Based Heuristics -- Abstraction and Phase Transitions in Relational Learning -- Posters -- An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis -- A Compositional Approach to Causality -- A Method for Finding Consistent Hypotheses Using Abstraction -- Research Summaries -- Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction -- Using and Learning Abstraction Hierarchies for Planning -- Learning Probabilistic Relational Models -- Synergy between Compositional Modeling and Bayesian Networks -- A CSP Abstraction Framework -- Answering Queries with Database Restrictions -- Research Summary. |
Record Nr. | UNINA-9910768434203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Accelerating Science and Engineering Discoveries Through Integrated Research Infrastructure for Experiment, Big Data, Modeling and Simulation [[electronic resource] ] : 22nd Smoky Mountains Computational Sciences and Engineering Conference, SMC 2022, Virtual Event, August 23–25, 2022, Revised Selected Papers / / edited by Kothe Doug, Geist Al, Swaroop Pophale, Hong Liu, Suzanne Parete-Koon |
Edizione | [1st ed. 2022.] |
Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 |
Descrizione fisica | 1 online resource (406 pages) |
Disciplina | 929.605 |
Collana | Communications in Computer and Information Science |
Soggetto topico |
Computer systems
Artificial intelligence Image processing - Digital techniques Computer vision Social sciences - Data processing Application software Education - Data processing Computer System Implementation Artificial Intelligence Computer Imaging, Vision, Pattern Recognition and Graphics Computer Application in Social and Behavioral Sciences Computer and Information Systems Applications Computers and Education |
ISBN | 3-031-23606-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Foundational Methods Enabling Science in an Integrated Ecosystem -- Computational Workflow for Accelerated Molecular Design Using Quantum Chemical Simulations and Deep Learning Models -- Self-learning Data Foundation for Scientific AI -- Preconditioners for batched iterative linear solvers on GPUs -- Mobility Aware Computation Offloading Model for Edge Computing -- Science and Engineering Applications Requiring and Motivating an Integrated Ecosystem -- Machine Learning for First Principles Calculations of Material Properties for Ferromagnetic Materials -- A Vision for Coupling Operation of US Fusion Facilities with HPC Systems and the Implications for Workflows and Data Management -- At-the-edge Data Processing for Low Latency High Throughput Machine Learning Algorithms -- Implementation of a framework for deploying AI inference engines in FPGAs -- Systems and Software Advances Enabling an Integrated Science and Engineering Ecosystem -- Calvera: A Platform for the Interpretation and Analysis of Neutron Scattering Data -- Virtual Infrastructure Twins: Software Testing Platforms for Computing and Instrument Ecosystems -- The INTERSECT Open Federated Architecture for the Laboratory of the Future -- Real-Time Edge Processing During Data Acquisition -- Towards a Software Development Framework for Interconnected Science Ecosystems -- Deploying Advanced Technologies for an Integrated Science and Engineering Ecosystem -- Adrastea: An Efficient FPGA Design Environment for Heterogenous Scientific Computing and Machine Learning -- Toward an Autonomous Workflow for Bragg Peak Detection at SNS -- Industrial experience deploying heterogeneous platforms for use in multi-modal power systems design workflows -- Self-Describing Digital Assets and their applications in an Integrated Science and Engineering Ecosystem -- Simulation Workflows in Minutes, at Scale for Next-Generation HPC -- Scientific Data Challenges -- Machine Learning approaches to High Throughput Phenotyping -- SMC 2022 Data Challenge: Summit Spelunkers Solution for Challenge 2 -- Usage Pattern Analysis for The Summit Login Nodes -- Finding Hidden Patterns in High Resolution Wind Flow Model Simulations -- Investigating Relationships in Environmental and Community Health: Correlations Of Environment, Urban Morphology, And Socio-Economic Factors In The Los Angeles Metropolitan Statistical Area -- Patterns and Predictions: Generative Adversarial Networks for Neighborhood Generation. |
Record Nr. | UNISA-996508666903316 |
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|