Amanote Research

Amanote Research

    RegisterSign In

Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning

doi 10.1007/978-0-85729-378-7
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2004

Authors
Ian Miguel
Publisher

Springer London


Related search

Constraint Satisfaction for Planning and Scheduling Problems

Constraints
CombinatoricsMathematicsDiscrete MathematicsComputational TheoryArtificial IntelligenceSoftware
2011English

Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems

2020English

Robustness and Stability in Dynamic Constraint Satisfaction Problems

English

Maximizing Supermodular Functions on Product Lattices, With Application to Maximum Constraint Satisfaction

SIAM Journal on Discrete Mathematics
Mathematics
2008English

A New Algorithm for Optimal Constraint Satisfaction and Its Implications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Constraints and AI Planning

IEEE Intelligent Systems
Computer NetworksArtificial IntelligenceCommunications
2005English

Algebraic Approach to Promise Constraint Satisfaction

2019English

The RAXEM Tool on Mars Express - Uplink Planning Optimisation and Scheduling Using AI Constraint Resolution

2008English

Algorithms for Constraint Satisfaction

INTELIGENCIA ARTIFICIAL
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy