Stable model semantics of weight constraint rules

Ilkka Niemelä, Patrik Simons, Timo Soininen

    Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

    66 Sitaatiot (Scopus)

    Abstrakti

    A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing different kinds of choices as well as cardinality, cost and resource constraints in combinatorial problems such as product configuration. A declarative semantics for the rules is presented which generalizes the stable model semantics of normal logic programs. It is shown that for ground rules the complexity of the relevant decision problems stays in NP. The first implementation of the language handles a decidable:subset where function symbols are not allowed. It is based on a new procedure for computing stable models for ground rules extending normal programs with choice and weight constructs and a compilation technique where a weight rule with variables is transformed to a set of such simpler ground rules.

    AlkuperäiskieliEnglanti
    OtsikkoLogic Programming and Nonmonotonic Reasoning
    Alaotsikko5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings
    ToimittajatM. Gelfond, N. Leone, G. Pfeifer
    JulkaisupaikkaBerlin
    Sivut317-331
    Sivumäärä15
    ISBN (elektroninen)978-3-540-46767-0
    DOI - pysyväislinkit
    TilaJulkaistu - 1999
    OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
    TapahtumaInternational Conference on Logic Programming and Nonmonotonic Reasoning - El Paso, Yhdysvallat
    Kesto: 2 joulukuuta 19994 joulukuuta 1999
    Konferenssinumero: 5

    Julkaisusarja

    NimiLECTURE NOTES IN ARTIFICIAL INTELLIGENCE
    KustantajaSPRINGER-VERLAG BERLIN
    Vuosikerta1730
    ISSN (painettu)0302-9743

    Conference

    ConferenceInternational Conference on Logic Programming and Nonmonotonic Reasoning
    LyhennettäLPNMR
    MaaYhdysvallat
    KaupunkiEl Paso
    Ajanjakso02/12/199904/12/1999

    Tutkimusalat

    • linear inequalities
    • logic programs
    • stable model semantics

    Siteeraa tätä