A problem-decomposition method using differences or equivalence relations between states (Q1058310): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5578546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for the Success of GPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Discovery of Classes of Problem-Solving Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization theory of continuous-time dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning in a hierarchy of abstraction spaces / rank
 
Normal rank

Latest revision as of 16:43, 14 June 2024

scientific article
Language Label Description Also known as
English
A problem-decomposition method using differences or equivalence relations between states
scientific article

    Statements

    A problem-decomposition method using differences or equivalence relations between states (English)
    0 references
    0 references
    0 references
    1985
    0 references
    The mathematical model of representing a problem by a set S of states together with partial transition functions (means) is adopted. States are endowed with certain features which give rise to equivalence relations on S, the complements of which are called differences on S. A method for decomposing a problem into simpler subproblems is proposed and conditions under which this leads to success are given. The concepts and the method are amply illustrated by analysing the 3-tower of Hanoi game and the 5- puzzle. The method is compared with Ernst and Newell's GPS and Sacerdoti's ABSTRIPS.
    0 references
    planning
    0 references
    problem decomposition
    0 references
    GPS
    0 references
    ABSTRIPS
    0 references

    Identifiers