Computing and Information Systems - Theses

Permanent URI for this collection

http://hdl.handle.net/11343/351

Filters

2015 1
Reset filters

Settings
Statistics
Citations
Author: Aziz, Rehan Abdul × End date: 2018 × Start date: 2010 × Type: PhD thesis × Subject: constraint programming ×

Search Results

Now showing 1 - 1 of 1
  • Item
    Thumbnail Image
    Answer set programming: founded bounds and model counting
    Aziz, Rehan Abdul ( 2015)
    Answer Set Programming (ASP) is a powerful modelling formalism that is very efficient for solving combinatorial problems. This work extends the state-of-the-art in theory and practice of ASP. It has two parts. The first part looks at the intersection of ASP and Constraint Programming and proposes theory and algorithms for implementing Bound Founded ASP, which is a generalization of both ASP and CP. The second part discusses model counting in the context of ASP.