IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v184y2011i1p179-20710.1007-s10479-010-0697-y.html
   My bibliography  Save this article

The weighted Grammar constraint

Author

Listed:
  • George Katsirelos
  • Nina Narodytska
  • Toby Walsh

Abstract

We introduce the WeightedGrammar constraint and propose propagation algorithms based on the CYK parser and the Earley parser. We show that the traces of these algorithms can be encoded as a weighted negation normal form ( WNNF), a generalization of NNF that allows nodes to carry weights. Based on this connection, we prove the correctness and complexity of these algorithms. Specifically, these algorithms enforce domain consistency on the WeightedGrammar constraint in time O(n 3 ). Further, we propose that the WNNF constraint can be decomposed into a set of primitive arithmetic constraint without hindering propagation. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • George Katsirelos & Nina Narodytska & Toby Walsh, 2011. "The weighted Grammar constraint," Annals of Operations Research, Springer, vol. 184(1), pages 179-207, April.
    • Handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:179-207:10.1007/s10479-010-0697-y
    DOI: 10.1007/s10479-010-0697-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0697-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0697-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:179-207:10.1007/s10479-010-0697-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.