ML Anthology

Properties of Programs with Monotone and Convex Constraints

Lengning Liu, Miroslaw Truszczynski
AAAI 2005 pp. 701-706
/aaai/2005/liu2005aaai-properties/

Abstract

We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include tight programs and Fages Lemma, program completion and loop formulas, and the notions of strong and uniform equivalence with their characterizations. Our results form an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of smodels.

PDF AAAI Semantic Scholar

Cite

Text

Liu and Truszczynski. "Properties of Programs with Monotone and Convex Constraints." AAAI Conference on Artificial Intelligence, 2005.

Markdown

[Liu and Truszczynski. "Properties of Programs with Monotone and Convex Constraints." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/liu2005aaai-properties/)

BibTeX

@inproceedings{liu2005aaai-properties,
  title     = {{Properties of Programs with Monotone and Convex Constraints}},
  author    = {Liu, Lengning and Truszczynski, Miroslaw},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {701-706},
  url       = {https://mlanthology.org/aaai/2005/liu2005aaai-properties/}
}