{"id":"https://openalex.org/W3128807438","doi":"https://doi.org/10.3233/faia201012","title":"Chapter 28. Pseudo-Boolean and Cardinality Constraints","display_name":"Chapter 28. Pseudo-Boolean and Cardinality Constraints","publication_year":2021,"publication_date":"2021-02-02","ids":{"openalex":"https://openalex.org/W3128807438","doi":"https://doi.org/10.3233/faia201012","mag":"3128807438"},"language":"en","primary_location":{"id":"doi:10.3233/faia201012","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia201012","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5008076909","display_name":"Olivier Roussel","orcid":"https://orcid.org/0000-0002-9394-3897"},"institutions":[{"id":"https://openalex.org/I4210115519","display_name":"Centre de Recherche en Informatique","ror":"https://ror.org/020cdve92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I190752583","https://openalex.org/I2746051580","https://openalex.org/I4210091621","https://openalex.org/I4210115519","https://openalex.org/I70768539"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Roussel","raw_affiliation_strings":["CRIL - Centre de Recherche en Informatique de Lens (Facult\u00e9 Jean Perrin Rue Jean Souvraz - SP 18 - 62307 LENS CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRIL - Centre de Recherche en Informatique de Lens (Facult\u00e9 Jean Perrin Rue Jean Souvraz - SP 18 - 62307 LENS CEDEX - France)","institution_ids":["https://openalex.org/I4210115519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033377932","display_name":"Vasco Manquinho","orcid":"https://orcid.org/0000-0002-4205-2189"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Vasco Manquinho","raw_affiliation_strings":["INESC-ID - Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento em Lisboa (Rua Alves Redol 9 - Apartado 13069 - 1000-029 Lisboa - Portugal)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC-ID - Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento em Lisboa (Rua Alves Redol 9 - Apartado 13069 - 1000-029 Lisboa - Portugal)","institution_ids":["https://openalex.org/I121345201"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.731,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82512112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9670000076293945,"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.9670000076293945,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9128000140190125,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/cardinality","display_name":"Cardinality (data modeling)","score":0.6934954524040222},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6373786926269531},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5833137035369873},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5666790008544922},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.5599511861801147},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4901021420955658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4867689609527588},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.48346811532974243},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4311741292476654},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.429019570350647},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.41721653938293457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41706788539886475},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38460737466812134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3528822660446167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3120827078819275},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09223809838294983}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6934954524040222},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6373786926269531},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5833137035369873},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5666790008544922},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.5599511861801147},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4901021420955658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4867689609527588},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.48346811532974243},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4311741292476654},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.429019570350647},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.41721653938293457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41706788539886475},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38460737466812134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3528822660446167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3120827078819275},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09223809838294983},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/faia201012","is_oa":false,"landing_page_url":"https://doi.org/10.3233/faia201012","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-04461963v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04461963","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Armin Biere; Marijn Heule; Hans van Maaren; Toby Walsh. Handbook of Satisfiability, second edition, 336, IOS Press, pp.1087-1129, 2021, Frontiers in Artificial Intelligence and Applications, 978-1-64368-160-3. ⟨10.3233/FAIA201012⟩","raw_type":"Book sections"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W1745650241","https://openalex.org/W2102364390","https://openalex.org/W2184010066","https://openalex.org/W1913543287","https://openalex.org/W2336941104"],"abstract_inverted_index":{"Pseudo-Boolean":[0],"and":[1,34,65,101],"cardinality":[2,23],"constraints":[3,100],"are":[4,66,85],"a":[5,11,22,35,40,49,54],"natural":[6],"generalization":[7],"of":[8,43],"clauses.":[9],"While":[10],"clause":[12],"expresses":[13,25],"that":[14,26,39],"at":[15,27],"least":[16,28],"one":[17],"literal":[18],"must":[19,31,45],"be":[20,32,46,120],"true,":[21],"constraint":[24,37],"n":[29],"literals":[30,44],"true":[33],"pseudo-Boolean":[36,90,99,125],"states":[38],"weighted":[41],"sum":[42],"greater":[47],"than":[48],"constant.":[50],"These":[51],"contraints":[52],"have":[53,58],"high":[55],"expressive":[56],"power,":[57],"been":[59],"intensively":[60],"studied":[61],"in":[62,79,88,107],"0/1":[63],"programming":[64],"close":[67],"enough":[68],"to":[69,73,122],"the":[70,76,89,95,115],"satisfiability":[71,117],"problem":[72],"benefit":[74],"from":[75],"recents":[77],"advances":[78],"this":[80],"field.":[81],"Besides,":[82],"optimization":[83],"problems":[84],"naturally":[86],"expressed":[87],"context.":[91],"This":[92],"chapter":[93],"presents":[94],"inference":[96,105],"rules":[97],"on":[98],"demonstrates":[102],"their":[103],"increased":[104],"power":[106],"comparison":[108],"with":[109,124],"resolution.":[110],"It":[111],"also":[112],"shows":[113],"how":[114],"modern":[116],"algorithms":[118],"can":[119],"extended":[121],"deal":[123],"constraints.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-02-15T00:00:00"}