1 / 3

Innovative AC Foundations for Efficient Constraint Processing

Explore new concepts of AC foundations, including Singleton Arc Consistency and Neighborhood Inverse Consistency. Learn their algorithms and benefits for constraint satisfaction problems. Contact Dr. Berthe Y. Choueiry for more information.

edward
Télécharger la présentation

Innovative AC Foundations for Efficient Constraint Processing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. New(er) Types of AC Foundations of Constraint Processing CSCE421/821, Fall 2005: www.cse.unl.edu/~choueiry/F05-421-821/ Berthe Y. Choueiry (Shu-we-ri) Avery Hall, Room 123B choueiry@cse.unl.edu Tel: +1(402)472-5444 nFCi

  2. Singleton Arc Consistency • Repeat until no change occurs • Repeat for each variable • Repeat for each value in domain • Assign this value to this variable. • If the CSP is AC, keep the value. Otherwise, remove it. • Proposed by Debruyne &Bessière, IJCAI 97 nFCi

  3. Neighborhood inverse consistency • Repeat until no change occurs • Repeat for each variable • Consider only the neighborhood of the variable • Repeat for each value for the variable • If the value appears in any complete solution for the neighborhood, keep it. Otherwise, remove it. • Proposed by Freuder & Elfe, AAAI 96 nFCi

More Related