Properties of programs with monotone and convex constraints

Research output: Contribution to conferencePaperpeer-review

19 Scopus citations

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

Original languageEnglish
Pages701-706
Number of pages6
StatePublished - 2005
Event20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 - Pittsburgh, PA, United States
Duration: Jul 9 2005Jul 13 2005

Conference

Conference20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
Country/TerritoryUnited States
CityPittsburgh, PA
Period7/9/057/13/05

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Properties of programs with monotone and convex constraints'. Together they form a unique fingerprint.

Cite this