{"id":"https://openalex.org/W2023055783","doi":"https://doi.org/10.1080/08839510701252650","title":"USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS","display_name":"USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS","publication_year":2007,"publication_date":"2007-04-25","ids":{"openalex":"https://openalex.org/W2023055783","doi":"https://doi.org/10.1080/08839510701252650","mag":"2023055783"},"language":"en","primary_location":{"id":"doi:10.1080/08839510701252650","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839510701252650","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5027115201","display_name":"Marco Cadoli","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Cadoli","raw_affiliation_strings":["\n                   \n               Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza,\u201d, Roma, Italy","Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza,\u201d, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084753554","display_name":"Toni Mancini","orcid":"https://orcid.org/0000-0003-3355-2170"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Toni Mancini","raw_affiliation_strings":["\n                   \n               Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza,\u201d, Roma, Italy","Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza,\u201d, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027115201"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":1.877,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87481894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"4-5","first_page":"383","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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.9986000061035156,"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.9973999857902527,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9901999831199646,"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/computer-science","display_name":"Computer science","score":0.772401750087738},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7383034825325012},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5815964341163635},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5431205034255981},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.469943106174469},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46952787041664124},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.45110806822776794},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4313313066959381},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4090329110622406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37491923570632935},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.36704427003860474},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30701667070388794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16720351576805115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13718068599700928}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.772401750087738},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7383034825325012},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5815964341163635},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5431205034255981},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.469943106174469},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46952787041664124},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.45110806822776794},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4313313066959381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4090329110622406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37491923570632935},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.36704427003860474},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30701667070388794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16720351576805115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13718068599700928},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/08839510701252650","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839510701252650","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/141234","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-34248531696&partnerID=65&md5=7b8bcca6bb5ba591eaf825257154e0c2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W13455872","https://openalex.org/W73864267","https://openalex.org/W80278138","https://openalex.org/W80728659","https://openalex.org/W596942210","https://openalex.org/W1488512629","https://openalex.org/W1490081606","https://openalex.org/W1495433690","https://openalex.org/W1514583064","https://openalex.org/W1521081248","https://openalex.org/W1523767584","https://openalex.org/W1524973174","https://openalex.org/W1527952596","https://openalex.org/W1567586152","https://openalex.org/W1599899466","https://openalex.org/W1661099014","https://openalex.org/W1756713414","https://openalex.org/W1773554800","https://openalex.org/W1822257500","https://openalex.org/W1964166152","https://openalex.org/W1976055110","https://openalex.org/W1984527736","https://openalex.org/W2008123515","https://openalex.org/W2011039300","https://openalex.org/W2013842855","https://openalex.org/W2078727257","https://openalex.org/W2109940223","https://openalex.org/W2117182850","https://openalex.org/W2117188169","https://openalex.org/W2143775744","https://openalex.org/W2152131859","https://openalex.org/W2492173494","https://openalex.org/W3127113455","https://openalex.org/W4213009134","https://openalex.org/W4285719527","https://openalex.org/W6603345065","https://openalex.org/W6636316686"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W4303044088","https://openalex.org/W2500041535","https://openalex.org/W1563755460","https://openalex.org/W1971069708","https://openalex.org/W2032348095","https://openalex.org/W2520084020","https://openalex.org/W1820477541"],"abstract_inverted_index":{"The":[0,171],"efficiency":[1],"of":[2,16,40,45,58,112,121,132,152,165,173],"systems":[3],"for":[4,148],"constraint":[5,72,158,180],"programming":[6],"(CP)":[7],"is":[8,77,159,177],"currently":[9],"highly":[10],"affected":[11],"by":[12,29,81,103,130],"the":[13,17,82,110,123,142,150,163,174],"actual":[14],"formulation":[15],"input":[18],"problem.":[19],"To":[20],"this":[21,87],"end,":[22],"several":[23],"choices":[24],"have":[25,61],"to":[26,33,51,66],"be":[27,127],"made":[28],"modelers":[30],"in":[31,64,168,183],"order":[32,65],"write":[34],"efficient":[35],"specifications":[36,60,106],"and":[37,43,95,100,118,161,204],"handle":[38],"instances":[39],"realistic":[41],"size,":[42],"this,":[44],"course,":[46],"represents":[47],"a":[48,71,156,169,178,184,189],"major":[49],"obstacle":[50],"reach":[52],"full":[53],"declarativeness.":[54],"Several":[55],"structural":[56],"properties":[57,116],"problem":[59,105],"been":[62],"investigated":[63],"provide":[67],"techniques":[68,195],"that":[69,120],"reformulate":[70],"program":[73],"into":[74],"one":[75],"which":[76],"more":[78],"efficiently":[79],"evaluable":[80],"solver":[83],"at":[84],"hand.":[85],"In":[86,138],"paper":[88],"we":[89,140],"consider":[90],"two":[91],"such":[92,115,198],"properties,":[93],"symmetries":[94],"functional":[96,166],"dependencies":[97,167],"among":[98],"variables,":[99],"show":[101,193],"that,":[102],"characterizing":[104],"as":[107,199],"logical":[108],"formulae,":[109],"task":[111],"deciding":[113],"whether":[114,155],"hold,":[117],"consequently":[119],"performing":[122],"relevant":[124],"reformulations,":[125],"can":[126],"practically":[128],"mechanized":[129],"means":[131],"automated":[133],"theorem":[134],"proving":[135],"(ATP)":[136],"technology.":[137],"particular,":[139],"report":[141],"results":[143],"on":[144,196],"using":[145],"ATP":[146],"technology":[147],"checking":[149,154,162],"existence":[151,164],"symmetries,":[153],"given":[157],"symmetry-breaking,":[160],"specification.":[170],"output":[172],"reasoning":[175],"phase":[176],"transformed":[179],"program,":[181],"consisting":[182],"reformulated":[185],"specification":[186],"and,":[187],"possibly,":[188],"search":[190],"strategy.":[191],"We":[192],"our":[194],"problems":[197],"graph":[200],"coloring,":[201],"Sailco":[202],"inventory,":[203],"protein":[205],"folding.":[206]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}