Stable model semantics of weight constraint rules

Ilkka Niemelä; Patrik Simons; Timo Soininen

doi:10.1007/3-540-46767-X_23

Stable model semantics of weight constraint rules

Ilkka Niemelä, Patrik Simons, Timo Soininen

Aalto University

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

79 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning
Subtitle of host publication	5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings
Editors	M. Gelfond, N. Leone, G. Pfeifer
Place of Publication	Berlin
Publisher	Springer
Pages	317-331
Number of pages	15
ISBN (Electronic)	978-3-540-46767-0
ISBN (Print)	3-540-66749-0
DOIs	https://doi.org/10.1007/3-540-46767-X_23
Publication status	Published - 1999
MoE publication type	A4 Conference publication
Event	International Conference on Logic Programming and Nonmonotonic Reasoning - El Paso, United States Duration: 2 Dec 1999 → 4 Dec 1999 Conference number: 5

Publication series

Name	LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
Publisher	SPRINGER-VERLAG BERLIN
Volume	1730
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Logic Programming and Nonmonotonic Reasoning
Abbreviated title	LPNMR
Country/Territory	United States
City	El Paso
Period	02/12/1999 → 04/12/1999

Keywords

linear inequalities
logic programs
stable model semantics

Access to Document

10.1007/3-540-46767-X_23

Cite this

Niemelä, I., Simons, P., & Soininen, T. (1999). Stable model semantics of weight constraint rules. In M. Gelfond, N. Leone, & G. Pfeifer (Eds.), Logic Programming and Nonmonotonic Reasoning : 5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings (pp. 317-331). (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE; Vol. 1730). Springer. https://doi.org/10.1007/3-540-46767-X_23

Niemelä, Ilkka ; Simons, Patrik ; Soininen, Timo. / Stable model semantics of weight constraint rules. Logic Programming and Nonmonotonic Reasoning : 5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings. editor / M. Gelfond ; N. Leone ; G. Pfeifer. Berlin : Springer, 1999. pp. 317-331 (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE).

@inproceedings{eb6b61a21d76420a962df311ab48b4ec,

title = "Stable model semantics of weight constraint rules",

abstract = "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.",

keywords = "linear inequalities, logic programs, stable model semantics, linear inequalities, logic programs, stable model semantics, linear inequalities, logic programs, stable model semantics",

author = "Ilkka Niemel{\"a} and Patrik Simons and Timo Soininen",

year = "1999",

doi = "10.1007/3-540-46767-X\_23",

language = "English",

isbn = "3-540-66749-0",

series = "LECTURE NOTES IN ARTIFICIAL INTELLIGENCE",

publisher = "Springer",

pages = "317--331",

editor = "M. Gelfond and N. Leone and G. Pfeifer",

booktitle = "Logic Programming and Nonmonotonic Reasoning",

address = "Germany",

note = "International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR ; Conference date: 02-12-1999 Through 04-12-1999",

}

Niemelä, I, Simons, P & Soininen, T 1999, Stable model semantics of weight constraint rules. in M Gelfond, N Leone & G Pfeifer (eds), Logic Programming and Nonmonotonic Reasoning : 5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, vol. 1730, Springer, Berlin, pp. 317-331, International Conference on Logic Programming and Nonmonotonic Reasoning , El Paso, Texas, United States, 02/12/1999. https://doi.org/10.1007/3-540-46767-X_23

Stable model semantics of weight constraint rules. / Niemelä, Ilkka; Simons, Patrik; Soininen, Timo.
Logic Programming and Nonmonotonic Reasoning : 5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings. ed. / M. Gelfond; N. Leone; G. Pfeifer. Berlin: Springer, 1999. p. 317-331 (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE; Vol. 1730).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Stable model semantics of weight constraint rules

AU - Niemelä, Ilkka

AU - Simons, Patrik

AU - Soininen, Timo

N1 - Conference code: 5

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - linear inequalities

KW - logic programs

KW - stable model semantics

KW - linear inequalities

KW - logic programs

KW - stable model semantics

KW - linear inequalities

KW - logic programs

KW - stable model semantics

UR - https://www.scopus.com/pages/publications/84958675071

U2 - 10.1007/3-540-46767-X_23

DO - 10.1007/3-540-46767-X_23

M3 - Conference article in proceedings

SN - 3-540-66749-0

T3 - LECTURE NOTES IN ARTIFICIAL INTELLIGENCE

SP - 317

EP - 331

BT - Logic Programming and Nonmonotonic Reasoning

A2 - Gelfond, M.

A2 - Leone, N.

A2 - Pfeifer, G.

PB - Springer

CY - Berlin

T2 - International Conference on Logic Programming and Nonmonotonic Reasoning

Y2 - 2 December 1999 through 4 December 1999

ER -

Niemelä I, Simons P, Soininen T. Stable model semantics of weight constraint rules. In Gelfond M, Leone N, Pfeifer G, editors, Logic Programming and Nonmonotonic Reasoning : 5th International Conference, LPNMR’ 99 El Paso, Texas, USA, December 2–4, 1999. Proceedings. Berlin: Springer. 1999. p. 317-331. (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE). doi: 10.1007/3-540-46767-X_23

Stable model semantics of weight constraint rules

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this