Abstract
We introduce the idea of possibilistic production systems. We provide a general algorithm for finding a path from an initial node to a goal node. We show that the use of a heuristic function can help in the efficient implementation of the search process. We see that a significant role in determining potential optimal paths is played by concentrating on the most difficult activity to accomplish.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
