Download the full-sized PDF of Logic programming with constraintsDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

Logic programming with constraints Open Access


Other title
Constraint programming (Computer science)
Logic programming
Type of item
Degree grantor
University of Alberta
Author or creator
Liu, Guohua
Supervisor and department
You, Jia (Computing Science)
Examining committee member and department
Yuan, Li-Yan (Computing Science)
Refortmat, Market (Electrical and Computer Engineering)
Mueller, Martin (Computing Science)
Goebel, Randolph (Computing Science)
Son, Tran ( Department of Computing Science, Mexico State University)
Department of Computing Science

Date accepted
Graduation date
Doctor of Philosophy
Degree level
Answer set programming (ASP), namely logic programming under the answer set semantics, provides a promising constraint programming paradigm, due to its simple syntax, high expressiveness, and effective computational properties. This programming paradigm can be viewed as a variant of SAT. A main drawback of ASP, like SAT, is that the framework is primarily formulated for reasoning with individuals, where each is represented by an atom in the traditional sense. Recently, ASP has been extended to include constraints to facilitate reasoning with sets of atoms in an explicit manner. These constraints include weight constraints, aggregates, and abstract constraints. Logic programs with these constraints are referred to as weight constraint, aggregate and abstract constraint programs. We investigate the properties and computations of weight constraint, aggregate, and abstract constraint programs, respectively. For properties, we improve the formulation of loop formulas for weight constraint and aggregate programs, propose loop formulas for abstract constraint programs, and characterize strong equivalence of these programs. For computations, we refine the existing constraint propagation mechanism in the computation of weight constraint programs and advocate a new approach to computing aggregate programs.
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 746126
Last modified: 2015:10:12 20:45:39-06:00
Filename: Liu_Guohua_Spring 2010.pdf
Original checksum: 70ba544f2ac1c39d8c1e01dda50c4cd2
Well formed: true
Valid: true
Status message: Too many fonts to report; some fonts omitted. Total fonts = 1200
Page count: 158
Activity of users you follow
User Activity Date