Paths of least resistance in possibilistic production systems (Q1081513): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0165-0114(86)90032-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078768531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets as a basis for a theory of possibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets and systems. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for ordering fuzzy subsets of the unit interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922616 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:12, 17 June 2024

scientific article
Language Label Description Also known as
English
Paths of least resistance in possibilistic production systems
scientific article

    Statements

    Paths of least resistance in possibilistic production systems (English)
    0 references
    0 references
    1986
    0 references
    The author proposes a new idea of possibilistic production systems. Such a system is defined in terms of states and possibilistic production rules for the transition between states. The problem of concern to the author is that of starting from a given initial state and finding a path via application of the production rules which leads to a goal state such that the overall possibility measure on this path is maximal. The author provide a general algorithm for finding a path from an initial node to a goal node. He introduces a heuristic evaluation function and shows that this function - based upon the difficulty of going from any point in the tree to a goal node - plays a significant role in the reduction of the computational explosion.
    0 references
    0 references
    search
    0 references
    artificial intelligence
    0 references
    optimal paths
    0 references
    possibilistic production systems
    0 references
    heuristic evaluation function
    0 references
    0 references