Properties of programs with monotone and convex constraints

Lengning Liu; Miroslaw Truszczyński

Properties of programs with monotone and convex constraints

Lengning Liu, Miroslaw Truszczyński

Computer Science

Research output: Contribution to conference › Paper › peer-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 language	English
Pages	701-706
Number of pages	6
State	Published - 2005
Event	20th 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 2005 → Jul 13 2005

Conference

Conference	20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
Country/Territory	United States
City	Pittsburgh, PA
Period	7/9/05 → 7/13/05

ASJC Scopus subject areas

Software
Artificial Intelligence

Cite this

@conference{2ecbe8732f4d4e2c9eb02b697d48c90f,

title = "Properties of programs with monotone and convex constraints",

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

author = "Lengning Liu and Miroslaw Truszczy{\'n}ski",

year = "2005",

language = "English",

pages = "701--706",

note = "20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 ; Conference date: 09-07-2005 Through 13-07-2005",

}

Properties of programs with monotone and convex constraints. / Liu, Lengning; Truszczyński, Miroslaw.
2005. 701-706 Paper presented at 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05, Pittsburgh, PA, United States.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - Properties of programs with monotone and convex constraints

AU - Liu, Lengning

AU - Truszczyński, Miroslaw

PY - 2005

Y1 - 2005

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

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

UR - http://www.scopus.com/inward/record.url?scp=29344471290&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29344471290&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:29344471290

SP - 701

EP - 706

T2 - 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05

Y2 - 9 July 2005 through 13 July 2005

ER -

Properties of programs with monotone and convex constraints

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this