{"id":"https://openalex.org/W1579965570","doi":null,"title":"Boolean Constraint Solving Using clp(FD)","display_name":"Boolean Constraint Solving Using clp(FD)","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1579965570","mag":"1579965570"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6031","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.inria.fr/INRIA/Projects/loco/publications/clp_fd/clp_bfd.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5109832378","display_name":"Philippe Codognet","orcid":"https://orcid.org/0000-0002-6254-6389","observed_orcids":["https://orcid.org/0000-0002-6254-6389"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe Codognet","raw_affiliation_strings":["ChLoE - axe Programmation en Logique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ChLoE - axe Programmation en Logique","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090363377","display_name":"Daniel D\u00edaz","orcid":"https://orcid.org/0000-0002-2700-2271","observed_orcids":["https://orcid.org/0000-0002-2700-2271"]},"institutions":[{"id":"https://openalex.org/I4405284601","display_name":"Centre de recherche en informatique (Paris)","ror":"https://ror.org/03vqacf92","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4405284601","https://openalex.org/I51101395"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Daniel Diaz","raw_affiliation_strings":["Centre de Recherche en Informatique de Paris 1","ChLoE - axe Programmation en Logique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre de Recherche en Informatique de Paris 1","institution_ids":["https://openalex.org/I4405284601"]},{"raw_affiliation_string":"ChLoE - axe Programmation en Logique","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5141585824","display_name":"Le Chesnay Cedex","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Le Chesnay Cedex","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6088,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92390395,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"15 pages","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.975600004196167,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.975600004196167,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.011699999682605267,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.0066999997943639755,"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/clp-fd","display_name":"CLP(FD)","score":0.9649999737739563},{"id":"https://openalex.org/keywords/finite-domain-constraints","display_name":"finite domain constraints","score":0.6539999842643738},{"id":"https://openalex.org/keywords/local-propagation","display_name":"local propagation","score":0.703000009059906},{"id":"https://openalex.org/keywords/chip","display_name":"CHIP","score":0.4819999933242798},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"constraint logic programming","score":0.6480000019073486},{"id":"https://openalex.org/keywords/constraint-solvers","display_name":"constraint solvers","score":0.4830000102519989}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7178485989570618},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6887418031692505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6332736015319824},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6006052494049072},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5746605396270752},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5475375652313232},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5256965160369873},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.49503058195114136},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.45744678378105164},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.445264995098114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4265446066856384},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.4244842231273651},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.41922134160995483},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4112718105316162},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.39216020703315735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3782029449939728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3374621570110321},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.16804355382919312},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.1482921540737152},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12183117866516113},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07620471715927124},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6031","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.inria.fr/INRIA/Projects/loco/publications/clp_fd/clp_bfd.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.7182","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.inria.fr/INRIA/Projects/contraintes/publications/CLP-FD/ilps93.ps","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00668897v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-00668897","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Logic Programming Symposium, 1993, Vancouver, British Columbia, Canada. 15 p","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W76250598","https://openalex.org/W168683773","https://openalex.org/W178800716","https://openalex.org/W1500415104","https://openalex.org/W1527272568","https://openalex.org/W1544564247","https://openalex.org/W1920589666","https://openalex.org/W1986473353","https://openalex.org/W1986585422","https://openalex.org/W1988095917","https://openalex.org/W2068852367","https://openalex.org/W2084642537","https://openalex.org/W2088174216","https://openalex.org/W2112957923","https://openalex.org/W2123396057","https://openalex.org/W2135432705","https://openalex.org/W2175178858","https://openalex.org/W2265658046","https://openalex.org/W2289269190"],"related_works":["https://openalex.org/W7096741092","https://openalex.org/W7095864543","https://openalex.org/W1982482731","https://openalex.org/W138316936","https://openalex.org/W1781240162","https://openalex.org/W2007319395","https://openalex.org/W2546785930","https://openalex.org/W116684789","https://openalex.org/W2987414384","https://openalex.org/W2624275032"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,10,18,27,40],"boolean":[3,34,43,67,82,96],"constraint":[4,21,30],"logic":[5],"language":[6,11],"clp(B/FD)":[7],"built":[8],"upon":[9],"over":[12],"finite":[13],"domains":[14],"clp(FD)":[15],"which":[16,31],"uses":[17],"local":[19],"propagation":[20],"solver.":[22,84],"It":[23,85],"is":[24,49,59],"based":[25],"on":[26,56,88],"single":[28],"primitive":[29],"allows":[32],"the":[33,64,80],"solver":[35,44],"to":[36],"be":[37],"encoded":[38],"at":[39],"low-level.":[41],"The":[42],"obtained":[45],"in":[46],"this":[47],"way":[48],"both":[50],"very":[51,54],"simple":[52],"and":[53,76],"efficient:":[55],"average":[57,89],"it":[58],"eight":[60],"times":[61,91],"faster":[62,92],"than":[63,79,93],"CHIP":[65,81],"propagation-based":[66],"solver,":[68],"i.e.":[69],"nearly":[70],"an":[71],"order":[72],"of":[73],"magnitude":[74],"faster,":[75],"infinitely":[77],"better":[78],"unification":[83],"also":[86],"performs":[87],"several":[90],"special-purpose":[94],"stand-alone":[95],"solvers.":[97]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}