{"id":{"repo_id":"regina","oai_identifier":"oai:uregina.scholaris.ca:10294/5842"},"canonical_url":"https://search.dev.ndltd.org/etd/regina/oai:uregina.scholaris.ca:10294/5842","repository":{"repo_id":"regina","name":"University of Regina","base_url":"https://uregina.scholaris.ca/server/oai/request"},"display":{"title":"Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS)","abstract":"In this thesis, a new framework for constraint and preference representation and reasoning is proposed, including the related definitions, algorithms and implementations. A Conditional Preference Network (CP-Net) is a widely used graph model to present the preferences among various outcomes. It allows users to describe their preferences of values over different variables. However, a CP-Net does not express the relations between variables, thus making the orders of outcomes incomplete. Because of this limitation, an extension of the CP-Net called Tradeoffs-enhanced Conditional Preference Network (TCP-Net) has been proposed to express the relative importance between variables. Nonetheless, TCP-Nets have the following drawbacks. 1. Currently there is no research work reporting on the implementation of TCPNets as a solver. In other words, there is no study on the applicability of TCP-Nets in real world applications. 2. TCP-Nets only deal with preferences (soft constraints). Hard constraints are not considered. This is a real limitation when dealing with a wide variety of real life problems. Due to the above limitations, we propose a new model integrating TCP-Nets with the well known Constraint Satisfaction Problem (CSP) framework for constraint processing. The new model is called Constrained TCP-Net (CTCP-Net). This model has been implemented as a three-layer architecture system using Java and provides a GUI for users to freely describe their problem as a set of constraints and preferences. The system will then solve the problem and return the solutions in a reasonable time. Moreover, depending on the problem description, our system offers the capability to represent the given application using CP-Nets, TCP-Nets, Constrained CP-Nets or Constrained TCP-Nets. This allows the users to deal with many real world problems including scheduling and planning, online shopping, auctions and many others. Finally, this thesis provides information for other researchers who are interested in CSPs and graphical models for preferences from the theoretical and practical aspects.","abstract_html":"In this thesis, a new framework for constraint and preference representation and reasoning is proposed, including the related definitions, algorithms and implementations. A Conditional Preference Network (CP-Net) is a widely used graph model to present the preferences among various outcomes. It allows users to describe their preferences of values over different variables. However, a CP-Net does not express the relations between variables, thus making the orders of outcomes incomplete. Because of this limitation, an extension of the CP-Net called Tradeoffs-enhanced Conditional Preference Network (TCP-Net) has been proposed to express the relative importance between variables. Nonetheless, TCP-Nets have the following drawbacks. 1. Currently there is no research work reporting on the implementation of TCPNets as a solver. In other words, there is no study on the applicability of TCP-Nets in real world applications. 2. TCP-Nets only deal with preferences (soft constraints). Hard constraints are not considered. This is a real limitation when dealing with a wide variety of real life problems. Due to the above limitations, we propose a new model integrating TCP-Nets with the well known Constraint Satisfaction Problem (CSP) framework for constraint processing. The new model is called Constrained TCP-Net (CTCP-Net). This model has been implemented as a three-layer architecture system using Java and provides a GUI for users to freely describe their problem as a set of constraints and preferences. The system will then solve the problem and return the solutions in a reasonable time. Moreover, depending on the problem description, our system offers the capability to represent the given application using CP-Nets, TCP-Nets, Constrained CP-Nets or Constrained TCP-Nets. This allows the users to deal with many real world problems including scheduling and planning, online shopping, auctions and many others. Finally, this thesis provides information for other researchers who are interested in CSPs and graphical models for preferences from the theoretical and practical aspects.","abstract_has_math":false,"creators":["Zhang, Shu"],"institution":"Faculty of Graduate Studies and Research, University of Regina","degree_name":"Master of Science (MSc)","degree_level":"Master's","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Mouhoub, Malek","Sadaoui-Mouhoub, Samira"],"committee_chairs":[],"committee_members":["Fan, Lisa L."],"year":2014,"date_issued":"2014-12","date_published":"2014-12","updated_at":"2026-07-24T04:03:25Z","subjects":[],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.82465/3742"],"render_values":[{"text":"https://doi.org/10.82465/3742","href":"https://doi.org/10.82465/3742","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/10294/5842","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mouhoub, Malek","Sadaoui-Mouhoub, Samira"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Fan, Lisa L."]},{"key":"dc:creator","label":"Author","values":["Zhang, Shu"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-07-22T17:41:43Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-07-22T17:41:43Z"]},{"key":"dc:date.issued","label":"Date","values":["2014-12"]},{"key":"dc:publisher","label":"Institution","values":["Faculty of Graduate Studies and Research, University of Regina"]},{"key":"dc:type","label":"Dc Type","values":["master thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MSc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Faculty of Graduate Studies and Research, University of Regina"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.82465/3742"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10294/5842"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science, University of Regina. xiii, 105 p."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, a new framework for constraint and preference representation and reasoning is proposed, including the related definitions, algorithms and implementations. A Conditional Preference Network (CP-Net) is a widely used graph model to present the preferences among various outcomes. It allows users to describe their preferences of values over different variables. However, a CP-Net does not express the relations between variables, thus making the orders of outcomes incomplete. Because of this limitation, an extension of the CP-Net called Tradeoffs-enhanced Conditional Preference Network (TCP-Net) has been proposed to express the relative importance between variables. Nonetheless, TCP-Nets have the following drawbacks. 1. Currently there is no research work reporting on the implementation of TCPNets as a solver. In other words, there is no study on the applicability of TCP-Nets in real world applications. 2. TCP-Nets only deal with preferences (soft constraints). Hard constraints are not considered. This is a real limitation when dealing with a wide variety of real life problems. Due to the above limitations, we propose a new model integrating TCP-Nets with the well known Constraint Satisfaction Problem (CSP) framework for constraint processing. The new model is called Constrained TCP-Net (CTCP-Net). This model has been implemented as a three-layer architecture system using Java and provides a GUI for users to freely describe their problem as a set of constraints and preferences. The system will then solve the problem and return the solutions in a reasonable time. Moreover, depending on the problem description, our system offers the capability to represent the given application using CP-Nets, TCP-Nets, Constrained CP-Nets or Constrained TCP-Nets. This allows the users to deal with many real world problems including scheduling and planning, online shopping, auctions and many others. Finally, this thesis provides information for other researchers who are interested in CSPs and graphical models for preferences from the theoretical and practical aspects."]},{"key":"dc:title","label":"Title","values":["Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS)"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mouhoub, Malek","Sadaoui-Mouhoub, Samira"],"dc:contributor.committeemember":["Fan, Lisa L."],"dc:creator":["Zhang, Shu"],"dc:date.accessioned":["2015-07-22T17:41:43Z"],"dc:date.available":["2015-07-22T17:41:43Z"],"dc:date.issued":["2014-12"],"dc:description":["A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science, University of Regina. xiii, 105 p."],"dc:description.abstract":["In this thesis, a new framework for constraint and preference representation and reasoning is proposed, including the related definitions, algorithms and implementations. A Conditional Preference Network (CP-Net) is a widely used graph model to present the preferences among various outcomes. It allows users to describe their preferences of values over different variables. However, a CP-Net does not express the relations between variables, thus making the orders of outcomes incomplete. Because of this limitation, an extension of the CP-Net called Tradeoffs-enhanced Conditional Preference Network (TCP-Net) has been proposed to express the relative importance between variables. Nonetheless, TCP-Nets have the following drawbacks. 1. Currently there is no research work reporting on the implementation of TCPNets as a solver. In other words, there is no study on the applicability of TCP-Nets in real world applications. 2. TCP-Nets only deal with preferences (soft constraints). Hard constraints are not considered. This is a real limitation when dealing with a wide variety of real life problems. Due to the above limitations, we propose a new model integrating TCP-Nets with the well known Constraint Satisfaction Problem (CSP) framework for constraint processing. The new model is called Constrained TCP-Net (CTCP-Net). This model has been implemented as a three-layer architecture system using Java and provides a GUI for users to freely describe their problem as a set of constraints and preferences. The system will then solve the problem and return the solutions in a reasonable time. Moreover, depending on the problem description, our system offers the capability to represent the given application using CP-Nets, TCP-Nets, Constrained CP-Nets or Constrained TCP-Nets. This allows the users to deal with many real world problems including scheduling and planning, online shopping, auctions and many others. Finally, this thesis provides information for other researchers who are interested in CSPs and graphical models for preferences from the theoretical and practical aspects."],"dc:identifier.doi":["https://doi.org/10.82465/3742"],"dc:identifier.uri":["https://hdl.handle.net/10294/5842"],"dc:language.iso":["en"],"dc:publisher":["Faculty of Graduate Studies and Research, University of Regina"],"dc:title":["Managing Constraints and Preferences: Constrained Tradeoffs-Enhanced Conditional Preference Networks (CTCP-NETS)"],"dc:type":["master thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Master's"],"thesis:degree_name":["Master of Science (MSc)"],"thesis:institution_name":["Faculty of Graduate Studies and Research, University of Regina"]},"updated_at":"2026-07-24T04:03:25Z"}