{"id":"https://openalex.org/W4238926881","doi":"https://doi.org/10.1017/s1471068417000199","title":"Preface","display_name":"Preface","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W4238926881","doi":"https://doi.org/10.1017/s1471068417000199"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068417000199","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000199","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/60BF5956A25C6E531BD0C5B0438CD6D5/S1471068417000199a.pdf/div-class-title-preface-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/60BF5956A25C6E531BD0C5B0438CD6D5/S1471068417000199a.pdf/div-class-title-preface-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064407367","display_name":"Agostino Dovier","orcid":"https://orcid.org/0000-0003-2052-8593"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"AGOSTINO DOVIER","raw_affiliation_strings":["Department of Mathematics, Computer Science, and Physics, CLPLAB, University of Udine 33100 Udine, Italy (e-mail:"],"raw_orcid":"https://orcid.org/0000-0003-2052-8593","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Computer Science, and Physics, CLPLAB, University of Udine 33100 Udine, Italy (e-mail:","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064407367"],"corresponding_institution_ids":["https://openalex.org/I129043915"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39136874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"4","first_page":"359","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.994700014591217,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.7628858089447021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7191457748413086},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6579607129096985},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6556179523468018},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.6486928462982178},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5811452269554138},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5644590854644775},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4855727553367615},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4644719660282135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34870707988739014},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3469889163970947},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2502438724040985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2327834665775299},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13718575239181519}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.7628858089447021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191457748413086},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6579607129096985},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6556179523468018},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.6486928462982178},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5811452269554138},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5644590854644775},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4855727553367615},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4644719660282135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34870707988739014},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3469889163970947},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2502438724040985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2327834665775299},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13718575239181519},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068417000199","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000199","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/60BF5956A25C6E531BD0C5B0438CD6D5/S1471068417000199a.pdf/div-class-title-preface-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:air.uniud.it:11390/1119931","is_oa":false,"landing_page_url":"http://hdl.handle.net/11390/1119931","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:194484","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/194484","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s1471068417000199","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068417000199","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/60BF5956A25C6E531BD0C5B0438CD6D5/S1471068417000199a.pdf/div-class-title-preface-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4238926881.pdf","grobid_xml":"https://content.openalex.org/works/W4238926881.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W2751752","https://openalex.org/W1481719343","https://openalex.org/W1496100162","https://openalex.org/W1510816548","https://openalex.org/W1526604233","https://openalex.org/W1550020009","https://openalex.org/W1672891595","https://openalex.org/W1721757222","https://openalex.org/W1774324140","https://openalex.org/W1976055110","https://openalex.org/W1990606699","https://openalex.org/W2011124182","https://openalex.org/W2022846948","https://openalex.org/W2029684728","https://openalex.org/W2044560939","https://openalex.org/W2054623824","https://openalex.org/W2062897452","https://openalex.org/W2063727779","https://openalex.org/W2065555531","https://openalex.org/W2087432892","https://openalex.org/W2123396057","https://openalex.org/W2132233302","https://openalex.org/W2138706506","https://openalex.org/W2152131859","https://openalex.org/W2265638991","https://openalex.org/W2319798085","https://openalex.org/W2400555644","https://openalex.org/W2584219801","https://openalex.org/W2886271628"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W2141935412","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W1567852657","https://openalex.org/W2784687883","https://openalex.org/W2495408185","https://openalex.org/W6366331","https://openalex.org/W2096689540"],"abstract_inverted_index":{"Magic":[0],"squares,":[1],"chess-like":[2],"problems,":[3],"cryptarithmetic":[4],"puzzles,":[5],"and":[6,92,100,152,207,239,242,244],"similar":[7],"classes":[8],"of":[9,107,122,175,195,220],"problems":[10],"have":[11],"been":[12,77],"extensively":[13],"used":[14,61,190],"to":[15,28,163,229],"challenge":[16],"human":[17],"reasoning":[18],"capabilities.":[19],"Lo":[20],"Shu":[21],"magic":[22],"square":[23],"can":[24,188],"be":[25,189],"traced":[26],"back":[27],"650":[29],"B.C.,":[30],"the":[31,39,80,96,105,120,147,155,159,173,184,193,201,208,227,230],"eight-queens":[32],"problem":[33],"was":[34],"proposed":[35,78],"in":[36,51,54,62,86,134],"1848":[37],"by":[38,79,213,232],"chess":[40],"player":[41],"Max":[42],"Bazzel":[43],"TWO":[44,46],"\u00d7":[45],"=":[47],"THREE":[48],"puzzle":[49],"appeared":[50],"Strand":[52],"Magazine":[53],"1924.":[55],"These":[56],"puzzles":[57],"are":[58],"nowadays":[59],"widely":[60],"constraint":[63,72,179,197,214],"programming":[64,68],"courses.":[65],"The":[66],"first":[67],"language":[69],"provided":[70],"with":[71,154],"modelling":[73],"primitives":[74],"(Sketchpad)":[75],"has":[76,118],"Turing":[81],"award":[82],"winner":[83],"Ivan":[84],"Sutherland":[85],"his":[87],"PhD":[88],"thesis":[89],"(1963).":[90],"Logemann":[91],"Loveland,":[93],"when":[94],"implementing":[95],"Davis\u2013Putnam":[97],"procedure":[98],"(Davis":[99],"Putnam":[101],"1960)":[102],"for":[103,191],"testing":[104],"satisfiability":[106,194],"a":[108,141,164,196,217],"propositional":[109],"formula":[110],"(SAT),":[111],"devised":[112],"an":[113,136],"algorithm":[114],"(Davis\u2013Putnam\u2013Logemann\u2013Loveland":[115],"(DPLL))":[116],"that":[117],"become":[119],"core":[121],"all":[123],"SAT/and":[124],"Answer":[125],"Set":[126],"Programming":[127],"solvers":[128],"(50":[129],"years":[130,168,223],"later).":[131],"It":[132],"consists":[133],"choosing":[135],"un-assigned":[137],"variable,":[138],"assigning":[139],"it":[140],"value":[142,149],"0":[143],"or":[144],"1,":[145],"propagating":[146],"chosen":[148],"(unit":[150],"propagation),":[151],"proceeding":[153],"alternative":[156],"value,":[157],"if":[158],"original":[160],"assignment":[161,202],"leads":[162],"contradiction":[165],"(backtracking).":[166],"Some":[167],"later":[169],"Waltz":[170],"(1975)":[171],"introduced":[172],"notion":[174],"domain":[176],"filtering":[177],"(arc-consistency-based":[178],"propagation).":[180],"With":[181],"this":[182],"idea":[183],"same":[185],"DPLL":[186],"scheme":[187],"verifying":[192],"satisfaction":[198],"problem,":[199],"where":[200],"is":[203,211],"no":[204],"longer":[205],"0/1":[206],"unit":[209],"propagation":[210],"replaced":[212],"propagation.":[215],"For":[216],"detailed":[218],"history":[219],"these":[221],"early":[222],"achievements,":[224],"we":[225],"refer":[226],"reader":[228],"works":[231],"Loveland":[233],"et":[234],"al":[235],".":[236],"(2017),":[237],"Jaffar":[238],"Maher":[240],"(1994),":[241],"Freuder":[243],"Mackworth":[245],"(2006).":[246]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2022-05-12T00:00:00"}