{"id":"https://openalex.org/W4211235961","doi":"https://doi.org/10.1007/978-3-642-14309-0_4","title":"Constraint Logic Programming","display_name":"Constraint Logic Programming","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W4211235961","doi":"https://doi.org/10.1007/978-3-642-14309-0_4"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-14309-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14309-0_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5088751356","display_name":"Marco Gavanelli","orcid":"https://orcid.org/0000-0001-7433-5899"},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Gavanelli","raw_affiliation_strings":["Dipartimento di Ingegneria, Universit\u00e0 di Ferrara,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e0 di Ferrara,","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000527699","display_name":"Francesca Rossi","orcid":"https://orcid.org/0000-0001-8898-219X"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesca Rossi","raw_affiliation_strings":["Dipartimento di Matematica Pura e Applicata, Universit\u00e0 di Padova,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura e Applicata, Universit\u00e0 di Padova,","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2005,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88397351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"64","last_page":"86"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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.9973999857902527,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9947999715805054,"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/logic-programming","display_name":"Logic programming","score":0.8048919439315796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7747780084609985},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.7000079154968262},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6547418832778931},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.6117444038391113},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.5988799929618835},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.5894975662231445},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5863461494445801},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.5341334342956543},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.521858811378479},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.4753824472427368},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.40606892108917236},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.34121155738830566},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3268396258354187},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2123454213142395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10323938727378845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08927366137504578}],"concepts":[{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.8048919439315796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7747780084609985},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7000079154968262},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6547418832778931},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.6117444038391113},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.5988799929618835},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.5894975662231445},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5863461494445801},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5341334342956543},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.521858811378479},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4753824472427368},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.40606892108917236},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.34121155738830566},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3268396258354187},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2123454213142395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10323938727378845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08927366137504578},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-14309-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14309-0_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:iris.unife.it:11392/1383755","is_oa":false,"landing_page_url":"http://hdl.handle.net/11392/1383755","pdf_url":null,"source":{"id":"https://openalex.org/S4306400369","display_name":"Institutional Research Information System University of Ferrara (University of Ferrara)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201324441","host_organization_name":"University of Ferrara","host_organization_lineage":["https://openalex.org/I201324441"],"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/bookPart"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":98,"referenced_works":["https://openalex.org/W80602063","https://openalex.org/W154256342","https://openalex.org/W1487569371","https://openalex.org/W1490081606","https://openalex.org/W1493154510","https://openalex.org/W1497328860","https://openalex.org/W1497840745","https://openalex.org/W1498600466","https://openalex.org/W1502746131","https://openalex.org/W1504983647","https://openalex.org/W1508847246","https://openalex.org/W1519044014","https://openalex.org/W1521800560","https://openalex.org/W1524303998","https://openalex.org/W1539518466","https://openalex.org/W1540782103","https://openalex.org/W1543304572","https://openalex.org/W1545565886","https://openalex.org/W1545971264","https://openalex.org/W1558930507","https://openalex.org/W1560112893","https://openalex.org/W1563600186","https://openalex.org/W1572980276","https://openalex.org/W1595648220","https://openalex.org/W1598464593","https://openalex.org/W1605404869","https://openalex.org/W1627011610","https://openalex.org/W1627884670","https://openalex.org/W1653581507","https://openalex.org/W1657826747","https://openalex.org/W1710237860","https://openalex.org/W1733489975","https://openalex.org/W1809589590","https://openalex.org/W1828959114","https://openalex.org/W1845127254","https://openalex.org/W1848220826","https://openalex.org/W1868221333","https://openalex.org/W1875972884","https://openalex.org/W1955233489","https://openalex.org/W1969307923","https://openalex.org/W1972712449","https://openalex.org/W1980107758","https://openalex.org/W1981281472","https://openalex.org/W1982482731","https://openalex.org/W1987005090","https://openalex.org/W1988095917","https://openalex.org/W1997856041","https://openalex.org/W1999783590","https://openalex.org/W2006700664","https://openalex.org/W2007319395","https://openalex.org/W2014205104","https://openalex.org/W2021515159","https://openalex.org/W2027319813","https://openalex.org/W2029608368","https://openalex.org/W2029740449","https://openalex.org/W2035811095","https://openalex.org/W2035855976","https://openalex.org/W2037783464","https://openalex.org/W2041934467","https://openalex.org/W2053616158","https://openalex.org/W2056229702","https://openalex.org/W2056640187","https://openalex.org/W2056710678","https://openalex.org/W2060498389","https://openalex.org/W2066834290","https://openalex.org/W2074492708","https://openalex.org/W2075185101","https://openalex.org/W2076858384","https://openalex.org/W2078139775","https://openalex.org/W2079333278","https://openalex.org/W2085827045","https://openalex.org/W2098333147","https://openalex.org/W2099942580","https://openalex.org/W2106056850","https://openalex.org/W2112307828","https://openalex.org/W2117817802","https://openalex.org/W2118850793","https://openalex.org/W2119456262","https://openalex.org/W2120203610","https://openalex.org/W2128585349","https://openalex.org/W2129241924","https://openalex.org/W2134400899","https://openalex.org/W2135432705","https://openalex.org/W2135457621","https://openalex.org/W2138522630","https://openalex.org/W2139712811","https://openalex.org/W2140748187","https://openalex.org/W2151352672","https://openalex.org/W2155616412","https://openalex.org/W2156525231","https://openalex.org/W2159875930","https://openalex.org/W2162176451","https://openalex.org/W2168332701","https://openalex.org/W2426452510","https://openalex.org/W2561675875","https://openalex.org/W4239026855","https://openalex.org/W4301885396","https://openalex.org/W6601945944"],"related_works":["https://openalex.org/W2348463574","https://openalex.org/W316728381","https://openalex.org/W1490546714","https://openalex.org/W1584569710","https://openalex.org/W2376476202","https://openalex.org/W1038119274","https://openalex.org/W3000431583","https://openalex.org/W2951038595","https://openalex.org/W1500516255","https://openalex.org/W4293391431"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}