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.
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
| 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 : 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings / / edited by Berthe Y. Choueiry, Toby Walsh
| Abstraction, Reformulation, and Approximation : 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 | ||
| ||
Algorithmic Decision Theory [[electronic resource] ] : 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings / / edited by Toby Walsh
| Algorithmic Decision Theory [[electronic resource] ] : 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings / / edited by Toby Walsh |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 594 p. 83 illus.) |
| Disciplina | 658.403 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Algorithms Application software Mathematical statistics Computer communication systems Computer programming Artificial Intelligence Algorithm Analysis and Problem Complexity Information Systems Applications (incl. Internet) Probability and Statistics in Computer Science Computer Communication Networks Programming Techniques |
| ISBN | 3-319-23114-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preferences -- Manipulation -- Learning and other issues -- Utility and decision theory -- Agumentation -- Bribery and control -- Social choice -- Allocation and other problems -- Doctoral consortium. |
| Record Nr. | UNISA-996200366503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Decision Theory : 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings / / edited by Toby Walsh
| Algorithmic Decision Theory : 4th International Conference, ADT 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings / / edited by Toby Walsh |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 594 p. 83 illus.) |
| Disciplina | 658.403 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Algorithms Application software Mathematical statistics Computer communication systems Computer programming Artificial Intelligence Algorithm Analysis and Problem Complexity Information Systems Applications (incl. Internet) Probability and Statistics in Computer Science Computer Communication Networks Programming Techniques |
| ISBN | 3-319-23114-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preferences -- Manipulation -- Learning and other issues -- Utility and decision theory -- Agumentation -- Bribery and control -- Social choice -- Allocation and other problems -- Doctoral consortium. |
| Record Nr. | UNINA-9910484374303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh
| Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh |
| Autore | Rossi Francesca |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2006 |
| Descrizione fisica | 1 online resource (xi, 955 pages) : illustrations |
| Disciplina | 005.116 |
| Altri autori (Persone) |
RossiFrancesca <1962->
Van BeekPeter WalshToby |
| Collana | Foundations of artificial intelligence |
| Soggetto topico |
Constraint programming (Computer science)
Computer programming |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-63604-1
9786610636044 0-08-046380-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Constraint satisfaction: an emerging paradigm -- Chapter 3. Constraint propagation -- Chapter 4. Backtracking search algorithms -- Chapter 5. Local search methods -- Chapter 6. Global constraints -- Chapter 7. Tractable structures for constraint satisfaction problems -- Chapter 8. The complexity of constraint languages -- Chapter 9. Soft constraints -- Chapter 10. Symmetry in constraint programming -- Chapter 11. Modelling -- Chapter 12. Constraint logic programming -- Chapter 13. Constraints in procedural and concurrent languages -- Chapter 14. Finite domain constraint programming systems -- Chapter 15. Operations research methods in constraint programming -- Chapter 16. Continuous and interval constraints -- Chapter 17. Constraints over structured domains -- Chapter 18. Randomness and structure -- Chapter 19. Temporal CSPs -- Chapter 20. Distributed constraint programming -- Chapter 21. Uncertainty and change -- Chapter 22. Constraint-based scheduling and planning -- Chapter 23. Vehicle routing -- Chapter 24. Configuration -- Chapter 25. Constraint applications in networks -- Chapter 26. Bioinformatics and constraints. |
| Record Nr. | UNINA-9910511424003321 |
Rossi Francesca
|
||
| Amsterdam ; ; Boston, : Elsevier, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh
| Handbook of constraint programming [[electronic resource] /] / edited by Francesca Rossi, Peter van Beek, Toby Walsh |
| Autore | Rossi Francesca |
| Edizione | [First edition.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2006 |
| Descrizione fisica | 1 online resource (xi, 955 pages) : illustrations |
| Disciplina | 005.116 |
| Altri autori (Persone) |
RossiFrancesca <1962->
Van BeekPeter WalshToby |
| Collana | Foundations of artificial intelligence |
| Soggetto topico |
Constraint programming (Computer science)
Computer programming |
| ISBN |
1-280-63604-1
9786610636044 0-08-046380-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Constraint satisfaction: an emerging paradigm -- Chapter 3. Constraint propagation -- Chapter 4. Backtracking search algorithms -- Chapter 5. Local search methods -- Chapter 6. Global constraints -- Chapter 7. Tractable structures for constraint satisfaction problems -- Chapter 8. The complexity of constraint languages -- Chapter 9. Soft constraints -- Chapter 10. Symmetry in constraint programming -- Chapter 11. Modelling -- Chapter 12. Constraint logic programming -- Chapter 13. Constraints in procedural and concurrent languages -- Chapter 14. Finite domain constraint programming systems -- Chapter 15. Operations research methods in constraint programming -- Chapter 16. Continuous and interval constraints -- Chapter 17. Constraints over structured domains -- Chapter 18. Randomness and structure -- Chapter 19. Temporal CSPs -- Chapter 20. Distributed constraint programming -- Chapter 21. Uncertainty and change -- Chapter 22. Constraint-based scheduling and planning -- Chapter 23. Vehicle routing -- Chapter 24. Configuration -- Chapter 25. Constraint applications in networks -- Chapter 26. Bioinformatics and constraints. |
| Record Nr. | UNINA-9910784600303321 |
|
Rossi Francesca
|
||
| Amsterdam ; ; Boston, : Elsevier, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of constraint programming / / edited by Francesca Rossi, Peter van Beek, Toby Walsh
| Handbook of constraint programming / / edited by Francesca Rossi, Peter van Beek, Toby Walsh |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2006 |
| Descrizione fisica | 1 online resource (xi, 955 pages) : illustrations |
| Disciplina | 005.1/16 |
| Altri autori (Persone) |
RossiFrancesca <1962->
Van BeekPeter WalshToby |
| Collana | Foundations of artificial intelligence |
| Soggetto topico |
Constraint programming (Computer science)
Computer programming |
| ISBN |
1-280-63604-1
9786610636044 0-08-046380-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Introduction -- Chapter 2. Constraint satisfaction: an emerging paradigm -- Chapter 3. Constraint propagation -- Chapter 4. Backtracking search algorithms -- Chapter 5. Local search methods -- Chapter 6. Global constraints -- Chapter 7. Tractable structures for constraint satisfaction problems -- Chapter 8. The complexity of constraint languages -- Chapter 9. Soft constraints -- Chapter 10. Symmetry in constraint programming -- Chapter 11. Modelling -- Chapter 12. Constraint logic programming -- Chapter 13. Constraints in procedural and concurrent languages -- Chapter 14. Finite domain constraint programming systems -- Chapter 15. Operations research methods in constraint programming -- Chapter 16. Continuous and interval constraints -- Chapter 17. Constraints over structured domains -- Chapter 18. Randomness and structure -- Chapter 19. Temporal CSPs -- Chapter 20. Distributed constraint programming -- Chapter 21. Uncertainty and change -- Chapter 22. Constraint-based scheduling and planning -- Chapter 23. Vehicle routing -- Chapter 24. Configuration -- Chapter 25. Constraint applications in networks -- Chapter 26. Bioinformatics and constraints. |
| Record Nr. | UNINA-9910825325103321 |
| Amsterdam ; ; Boston, : Elsevier, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles and Practice of Constraint Programming - CP 2001 [[electronic resource] ] : 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings / / edited by Toby Walsh
| Principles and Practice of Constraint Programming - CP 2001 [[electronic resource] ] : 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings / / edited by Toby Walsh |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 794 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Artificial intelligence Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Programming Techniques Programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-45578-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hybrid Benders Decomposition Algorithms in Constraint Logic Programming -- Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming -- Towards Inductive Constraint Solving -- Collaborative Learning for Constraint Solving -- Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines -- Global Cut Framework for Removing Symmetries -- Symmetry Breaking -- The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10 -- Random 3-SAT and BDDs: The Plot Thickens Further -- Capturing Structure with Satisfiability -- Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT -- Solving Non-binary CSPs Using the Hidden Variable Encoding -- A Filtering Algorithm for the Stretch Constraint -- Network Flow Problems in Constraint Programming -- Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family -- A Constraint Programming Approach to the Stable Marriage Problem -- Components for State Restoration in Tree Search -- Adaptive Constraint Handling with CHR in Java -- Consistency Maintenance for ABT -- Constraint-Based Verification of Client-Server Protocols -- A Temporal Concurrent Constraint Programming Calculus -- Lower Bounds for Non-binary Constraint Optimization Problems -- New Lower Bounds of Constraint Violations for Over-Constrained Problems -- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization -- Solving Disjunctive Constraints for Interactive Graphical Applications -- Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint -- Non-overlapping Constraints between Convex Polytopes -- Formal Models of Heavy-Tailed Behavior in Combinatorial Search -- The Phase Transition of the Linear Inequalities Problem -- In Search of a Phase Transition in the AC-Matching Problem -- Specific Filtering Algorithms for Over-Constrained Problems -- Specializing Russian Doll Search -- A CLP Approach to the Protein Side-Chain Placement Problem -- Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores -- One Flip per Clock Cycle -- Solving Constraints over Floating-Point Numbers -- Optimal Pruning in Parametric Differential Equations -- Interaction of Constraint Programming and Local Search for Optimisation Problems -- Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency -- Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem -- The Expressive Power of Binary Linear Programming -- Constraint Generation via Automated Theory Formation -- The Traveling Tournament Problem Description and Benchmarks -- Deriving Explanations and Implications for Constraint Satisfaction Problems -- Generating Tradeoffs for Interactive Constraint-Based Configuration -- Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells -- Composition Operators for Constraint Propagation:An Application to Choco -- Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination -- GAC on Conjunctions of Constraints -- Dual Models of Permutation Problems -- Boosting Local Search with Artificial Ants -- Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies -- Evaluation of Search Heuristics for Embedded System Scheduling Problems -- Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching -- Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View -- A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation -- A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture -- iOpt: A Software Toolkit for Heuristic Search Methods -- AbsCon: A Prototype to Solve CSPs with Abstraction -- A Constraint Engine for Manufacturing Process Planning -- On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems -- Automatic Generation of Implied Clauses for SAT -- Verification of Infinite-State Systems by Specialization of CLP Programs -- Partially Ordered Constraint Optimization Problems -- Translations for Comparing Soft Frameworks -- Counting Satisfiable k-CNF Formulas -- High-Level Modelling and Reformulation of Constraint Satisfaction Problems -- Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation -- Aircraft Assignment Using Constraint Programming -- Labelling Heuristics for CSP Application Domains -- Improving SAT Algorithms by Using Search Pruning Techniques -- Optimum Symmetry Breaking in CSPs Using Group Theory -- Distributed Dynamic Backtracking -- Constraint Programming for Distributed Resource Allocation -- Exploiting the CSP Structure by Interchangeability -- Constraint Processing Techniques for Model-Based Reasoning about Dynamic Systems -- Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers -- Building Negative Reduced Cost Paths Using Constraint Programming -- An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm -- Partial Stable Generated Models of Generalized Logic Programs with Constraints -- Heterogeneous Constraint Problems An Outline of the Field of Work -- Comparing SAT Encodings for Model Checking -- Asynchronous Search for Numeric DisCSPs -- Temporal Concurrent Constraint Programming. |
| Record Nr. | UNISA-996465660303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles and Practice of Constraint Programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings / / edited by Toby Walsh
| Principles and Practice of Constraint Programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings / / edited by Toby Walsh |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 794 p.) |
| Disciplina | 005.11 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Artificial intelligence Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Programming Techniques Programming Languages, Compilers, Interpreters Artificial Intelligence Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-45578-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hybrid Benders Decomposition Algorithms in Constraint Logic Programming -- Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming -- Towards Inductive Constraint Solving -- Collaborative Learning for Constraint Solving -- Towards Stochastic Constraint Programming: A Study of Online Multi-Choice Knapsack with Deadlines -- Global Cut Framework for Removing Symmetries -- Symmetry Breaking -- The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10 -- Random 3-SAT and BDDs: The Plot Thickens Further -- Capturing Structure with Satisfiability -- Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT -- Solving Non-binary CSPs Using the Hidden Variable Encoding -- A Filtering Algorithm for the Stretch Constraint -- Network Flow Problems in Constraint Programming -- Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family -- A Constraint Programming Approach to the Stable Marriage Problem -- Components for State Restoration in Tree Search -- Adaptive Constraint Handling with CHR in Java -- Consistency Maintenance for ABT -- Constraint-Based Verification of Client-Server Protocols -- A Temporal Concurrent Constraint Programming Calculus -- Lower Bounds for Non-binary Constraint Optimization Problems -- New Lower Bounds of Constraint Violations for Over-Constrained Problems -- A General Scheme for Multiple Lower Bound Computation in Constraint Optimization -- Solving Disjunctive Constraints for Interactive Graphical Applications -- Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint -- Non-overlapping Constraints between Convex Polytopes -- Formal Models of Heavy-Tailed Behavior in Combinatorial Search -- The Phase Transition of the Linear Inequalities Problem -- In Search of a Phase Transition in the AC-Matching Problem -- Specific Filtering Algorithms for Over-Constrained Problems -- Specializing Russian Doll Search -- A CLP Approach to the Protein Side-Chain Placement Problem -- Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores -- One Flip per Clock Cycle -- Solving Constraints over Floating-Point Numbers -- Optimal Pruning in Parametric Differential Equations -- Interaction of Constraint Programming and Local Search for Optimisation Problems -- Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency -- Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem -- The Expressive Power of Binary Linear Programming -- Constraint Generation via Automated Theory Formation -- The Traveling Tournament Problem Description and Benchmarks -- Deriving Explanations and Implications for Constraint Satisfaction Problems -- Generating Tradeoffs for Interactive Constraint-Based Configuration -- Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells -- Composition Operators for Constraint Propagation: An Application to Choco -- Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination -- GAC on Conjunctions of Constraints -- Dual Models of Permutation Problems -- Boosting Local Search with Artificial Ants -- Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies -- Evaluation of Search Heuristics for Embedded System Scheduling Problems -- Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching -- Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View -- A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation -- A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture -- iOpt: A Software Toolkit for Heuristic Search Methods -- AbsCon: A Prototype to Solve CSPs with Abstraction -- A Constraint Engine for Manufacturing Process Planning -- On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems -- Automatic Generation of Implied Clauses for SAT -- Verification of Infinite-State Systems by Specialization of CLP Programs -- Partially Ordered Constraint Optimization Problems -- Translations for Comparing Soft Frameworks -- Counting Satisfiable k-CNF Formulas -- High-Level Modelling and Reformulation of Constraint Satisfaction Problems -- Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation -- Aircraft Assignment Using Constraint Programming -- Labelling Heuristics for CSP Application Domains -- Improving SAT Algorithms by Using Search Pruning Techniques -- Optimum Symmetry Breaking in CSPs Using Group Theory -- Distributed Dynamic Backtracking -- Constraint Programming for Distributed Resource Allocation -- Exploiting the CSP Structure by Interchangeability -- Constraint Processing Techniques for Model-Based Reasoning about Dynamic Systems -- Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers -- Building Negative Reduced Cost Paths Using Constraint Programming -- An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm -- Partial Stable Generated Models of Generalized Logic Programs with Constraints -- Heterogeneous Constraint Problems An Outline of the Field of Work -- Comparing SAT Encodings for Model Checking -- Asynchronous Search for Numeric DisCSPs -- Temporal Concurrent Constraint Programming. |
| Record Nr. | UNINA-9910767575203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Satisfiability Testing [[electronic resource] ] : 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings / / edited by Fahiem Bacchus, Toby Walsh
| Theory and Applications of Satisfiability Testing [[electronic resource] ] : 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings / / edited by Fahiem Bacchus, Toby Walsh |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 492 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Algorithms Operating systems (Computers) Numerical analysis Artificial intelligence Mathematical logic Formal Languages and Automata Theory Operating Systems Numerical Analysis Artificial Intelligence Mathematical Logic and Foundations |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Solving Over-Constrained Problems with SAT Technology -- A Symbolic Search Based Approach for Quantified Boolean Formulas -- Substitutional Definition of Satisfiability in Classical Propositional Logic -- A Clause-Based Heuristic for SAT Solvers -- Effective Preprocessing in SAT Through Variable and Clause Elimination -- Resolution and Pebbling Games -- Local and Global Complete Solution Learning Methods for QBF -- Equivalence Checking of Circuits with Parameterized Specifications -- Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming -- Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution -- Resolution Tunnels for Improved SAT Solver Performance -- Diversification and Determinism in Local Search for Satisfiability -- On Finding All Minimally Unsatisfiable Subformulas -- Optimizations for Compiling Declarative Models into Boolean Formulas -- Random Walk with Continuously Smoothed Variable Weights -- Derandomization of PPSZ for Unique-k-SAT -- Heuristics for Fast Exact Model Counting -- A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic -- DPvis – A Tool to Visualize the Structure of SAT Instances -- Constraint Metrics for Local Search -- Input Distance and Lower Bounds for Propositional Resolution Proof Length -- Sums of Squares, Satisfiability and Maximum Satisfiability -- Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable -- A New Approach to Model Counting -- Benchmarking SAT Solvers for Bounded Model Checking -- Model-Equivalent Reductions -- Improved Exact Solvers for Weighted Max-SAT -- Quantifier Trees for QBFs -- Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas -- A Branching Heuristics for Quantified Renamable Horn Formulas -- An Improved Upper Bound for SAT -- Bounded Model Checking with QBF -- Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies -- Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas -- Automated Generation of Simplification Rules for SAT and MAXSAT -- Speedup Techniques Utilized in Modern SAT Solvers -- FPGA Logic Synthesis Using Quantified Boolean Satisfiability -- On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization -- A New Set of Algebraic Benchmark Problems for SAT Solvers -- A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas -- Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability -- On Subsumption Removal and On-the-Fly CNF Simplification. |
| Record Nr. | UNISA-996466148903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
