{"id":"https://openalex.org/W2772071247","doi":"https://doi.org/10.1109/smc.2017.8122742","title":"Representing and reasoning with constrained PCP-nets","display_name":"Representing and reasoning with constrained PCP-nets","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2772071247","doi":"https://doi.org/10.1109/smc.2017.8122742","mag":"2772071247"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2017.8122742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003352506","display_name":"Sleh El Fidha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sleh El Fidha","raw_affiliation_strings":["ISG, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISG, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058768233","display_name":"Malek Mouhoub","orcid":"https://orcid.org/0000-0001-7381-1064"},"institutions":[{"id":"https://openalex.org/I194028371","display_name":"University of Regina","ror":"https://ror.org/03dzc0485","country_code":"CA","type":"education","lineage":["https://openalex.org/I194028371"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Malek Mouhoub","raw_affiliation_strings":["Dept. of Computer Science, University of Regina, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Regina, Canada","institution_ids":["https://openalex.org/I194028371"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102967229","display_name":"Nahla Ben Amor","orcid":"https://orcid.org/0000-0002-8667-0798"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nahla Ben Amor","raw_affiliation_strings":["ISG, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISG, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019463429","display_name":"Eisa Alanazi","orcid":"https://orcid.org/0000-0002-5560-1116"},"institutions":[{"id":"https://openalex.org/I199693650","display_name":"Umm al-Qura University","ror":"https://ror.org/01xjqrm90","country_code":"SA","type":"education","lineage":["https://openalex.org/I199693650"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Eisa Alanazi","raw_affiliation_strings":["Dept. of Computer Science, Umm Al-Qura University, Makkah, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Umm Al-Qura University, Makkah, Saudi Arabia","institution_ids":["https://openalex.org/I199693650"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1007","last_page":"1012"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.721977949142456},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.6702384352684021},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6532016396522522},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.6423251032829285},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6333799362182617},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.611856997013092},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5687589645385742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5522956252098083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.432211309671402},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4126374125480652},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38750404119491577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35200250148773193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30998551845550537},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.14402014017105103},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10553273558616638}],"concepts":[{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.721977949142456},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.6702384352684021},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6532016396522522},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.6423251032829285},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6333799362182617},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.611856997013092},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5687589645385742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5522956252098083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.432211309671402},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4126374125480652},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38750404119491577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35200250148773193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30998551845550537},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.14402014017105103},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10553273558616638},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2017.8122742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1544508130","https://openalex.org/W1792786480","https://openalex.org/W2036792519","https://openalex.org/W2068852367","https://openalex.org/W2114660707","https://openalex.org/W2122972087","https://openalex.org/W2130202378","https://openalex.org/W2135432705","https://openalex.org/W2139300273","https://openalex.org/W2337098149","https://openalex.org/W2426452510","https://openalex.org/W6632876261","https://openalex.org/W7018703302"],"related_works":["https://openalex.org/W2978999882","https://openalex.org/W3141031773","https://openalex.org/W1595686156","https://openalex.org/W2181392282","https://openalex.org/W2119369480","https://openalex.org/W2912321008","https://openalex.org/W148937441","https://openalex.org/W2153369162","https://openalex.org/W1998607122","https://openalex.org/W4367046737"],"abstract_inverted_index":{"A":[0],"Probabilistic":[1],"Conditional":[2],"Preference":[3],"network":[4],"(PCP-net)":[5],"provides":[6],"a":[7,80,125],"compact":[8],"representation":[9],"of":[10,22,30,82,105,117],"preferences":[11,71],"characterized":[12],"with":[13,49],"uncertainty.":[14],"We":[15,33,42],"propose":[16],"to":[17],"enrich":[18],"the":[19,23,31,38,44,50,57,63,70,75,83,101,110,119],"expressive":[20],"power":[21],"PCP-net":[24,40],"by":[25],"adding":[26],"constraints":[27],"between":[28],"some":[29],"variables.":[32],"call":[34],"this":[35,78],"new":[36,111],"model,":[37],"Constrained":[39],"(CPCP-net).":[41],"study":[43],"key":[45],"preference":[46],"reasoning":[47],"task":[48],"proposed":[51,90,112],"CPCP-net":[52,95],"which":[53],"consists":[54],"in":[55,124],"finding":[56],"most":[58,64,120],"probable":[59,65,121],"optimal":[60,122],"outcome":[61,66,123],"i.e.":[62],"that":[67,109],"best":[68],"represents":[69],"while":[72],"satisfying":[73],"all":[74],"constraints.":[76],"In":[77],"regard,":[79],"variant":[81],"Branch":[84],"and":[85,91],"Bound":[86],"algorithm":[87],"has":[88],"been":[89],"experimentally":[92],"evaluated":[93],"on":[94,100],"instances,":[96],"randomly":[97],"generated":[98],"based":[99],"RB-model.":[102],"The":[103],"results":[104],"these":[106],"experiments":[107],"show":[108],"solving":[113],"method":[114],"is":[115],"capable":[116],"returning":[118],"reasonable":[126],"time.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
