{"id":"https://openalex.org/W2132042004","doi":"https://doi.org/10.1017/s1471068409990093","title":"The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments","display_name":"The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments","publication_year":2009,"publication_date":"2009-08-14","ids":{"openalex":"https://openalex.org/W2132042004","doi":"https://doi.org/10.1017/s1471068409990093","mag":"2132042004"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068409990093","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068409990093","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6525F10B1E3188076E93165C65170F84/S1471068409990093a.pdf/div-class-title-the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments-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/6525F10B1E3188076E93165C65170F84/S1471068409990093a.pdf/div-class-title-the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112465732","display_name":"Paolo Mancarella","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"PAOLO MANCARELLA","raw_affiliation_strings":["Dipartimento di Informatica, Universit di Pisa, Pisa, Tuscany, Italy","Dipartimento di informatica, universit\u00e0 di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it)#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit di Pisa, Pisa, Tuscany, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di informatica, universit\u00e0 di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it)#TAB#","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086573205","display_name":"Giacomo Terreni","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"GIACOMO TERRENI","raw_affiliation_strings":["Dipartimento di Informatica, Universit di Pisa, Pisa, Tuscany, Italy","Dipartimento di informatica, universit\u00e0 di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it)#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit di Pisa, Pisa, Tuscany, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di informatica, universit\u00e0 di pisa, pisa, tuscany, italy (e-mail: paolo.mancarella@unipi.it, terreni@di.unipi.it)#TAB#","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083972852","display_name":"Fariba Sadri","orcid":"https://orcid.org/0000-0003-1307-7667"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"FARIBA SADRI","raw_affiliation_strings":["Department of Computing, Imperial College London, London, UK","Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk)#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078354590","display_name":"Francesca Toni","orcid":"https://orcid.org/0000-0001-8194-1459"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"FRANCESCA TONI","raw_affiliation_strings":["Department of Computing, Imperial College London, London, UK","Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of computing, imperial college london, london, uk (e-mail: fs@doc.ic.ac.uk, ft@doc.ic.ac.uk)#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058049693","display_name":"Ulle Endriss","orcid":"https://orcid.org/0000-0003-3709-4701"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"ULLE ENDRISS","raw_affiliation_strings":["Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Amsterdam, The Netherlands","Institute for logic, language and computation (illc), university of amsterdam, amsterdam, the netherlands (e-mail: ulle.endriss@uva.nl)#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"Institute for logic, language and computation (illc), university of amsterdam, amsterdam, the netherlands (e-mail: ulle.endriss@uva.nl)#TAB#","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5112465732"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":8.1299,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.97541351,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"9","issue":"6","first_page":"691","last_page":"750"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","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/T10126","display_name":"Logic, programming, and type systems","score":0.9932000041007996,"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/correctness","display_name":"Correctness","score":0.7532800436019897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7455776929855347},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6388746500015259},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6378861665725708},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5894826054573059},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5770268440246582},{"id":"https://openalex.org/keywords/abductive-reasoning","display_name":"Abductive reasoning","score":0.5694215297698975},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5214945077896118},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4424847364425659},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.42217308282852173},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4215487837791443},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36676937341690063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2031427025794983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16874244809150696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1319989264011383}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7532800436019897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7455776929855347},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6388746500015259},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6378861665725708},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5894826054573059},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5770268440246582},{"id":"https://openalex.org/C166088908","wikidata":"https://www.wikidata.org/wiki/Q308495","display_name":"Abductive reasoning","level":2,"score":0.5694215297698975},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5214945077896118},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4424847364425659},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.42217308282852173},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4215487837791443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36676937341690063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2031427025794983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16874244809150696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1319989264011383},{"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":5,"locations":[{"id":"doi:10.1017/s1471068409990093","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068409990093","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6525F10B1E3188076E93165C65170F84/S1471068409990093a.pdf/div-class-title-the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments-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:dare.uva.nl:openaire_cris_publications/af4116ba-d93a-44d9-9caf-c0f6f3f1670b","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments(af4116ba-d93a-44d9-9caf-c0f6f3f1670b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mancarella, P, Terreni, G, Sadri, F, Toni, F & Endriss, U 2009, 'The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments', Theory and Practice of Logic Programming, vol. 9, no. 6, pp. 691-750. https://doi.org/10.1017/S1471068409990093","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:openaire/af4116ba-d93a-44d9-9caf-c0f6f3f1670b","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments(af4116ba-d93a-44d9-9caf-c0f6f3f1670b).html","pdf_url":"https://pure.uva.nl/ws/files/914532/74915_312952.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"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":"Mancarella, P, Terreni, G, Sadri, F, Toni, F & Endriss, U 2009, 'The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments', Theory and Practice of Logic Programming, vol. 9, no. 6, pp. 691-750. https://doi.org/10.1017/S1471068409990093","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arpi.unipi.it:11568/132009","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/132009","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"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:dare.uva.nl:publications/af4116ba-d93a-44d9-9caf-c0f6f3f1670b","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments(af4116ba-d93a-44d9-9caf-c0f6f3f1670b).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1017/s1471068409990093","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068409990093","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6525F10B1E3188076E93165C65170F84/S1471068409990093a.pdf/div-class-title-the-ciff-proof-procedure-for-abductive-logic-programming-with-constraints-theory-implementation-and-experiments-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":[{"id":"https://openalex.org/G4006084471","display_name":null,"funder_award_id":"IST-2001-32530","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2132042004.pdf","grobid_xml":"https://content.openalex.org/works/W2132042004.grobid-xml"},"referenced_works_count":84,"referenced_works":["https://openalex.org/W3296631","https://openalex.org/W10929107","https://openalex.org/W16460774","https://openalex.org/W31561947","https://openalex.org/W96558622","https://openalex.org/W108833919","https://openalex.org/W140008892","https://openalex.org/W159748828","https://openalex.org/W176609766","https://openalex.org/W186305455","https://openalex.org/W193996434","https://openalex.org/W195543945","https://openalex.org/W1485064038","https://openalex.org/W1485332185","https://openalex.org/W1487569371","https://openalex.org/W1488364561","https://openalex.org/W1501779709","https://openalex.org/W1503579182","https://openalex.org/W1509180139","https://openalex.org/W1512750313","https://openalex.org/W1518810661","https://openalex.org/W1519044014","https://openalex.org/W1520957705","https://openalex.org/W1521786787","https://openalex.org/W1531065626","https://openalex.org/W1541434994","https://openalex.org/W1563464738","https://openalex.org/W1569435728","https://openalex.org/W1579337158","https://openalex.org/W1585686429","https://openalex.org/W1586826229","https://openalex.org/W1593637886","https://openalex.org/W1598435182","https://openalex.org/W1598464593","https://openalex.org/W1606891084","https://openalex.org/W1609477848","https://openalex.org/W1614683506","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1766332311","https://openalex.org/W1780039904","https://openalex.org/W1814221162","https://openalex.org/W1910245860","https://openalex.org/W1968513265","https://openalex.org/W1973279396","https://openalex.org/W1976055110","https://openalex.org/W1987005090","https://openalex.org/W1992602851","https://openalex.org/W2004486808","https://openalex.org/W2010104109","https://openalex.org/W2022472812","https://openalex.org/W2033289155","https://openalex.org/W2046191606","https://openalex.org/W2048746006","https://openalex.org/W2063727779","https://openalex.org/W2071787143","https://openalex.org/W2076698873","https://openalex.org/W2078139775","https://openalex.org/W2079333278","https://openalex.org/W2090798572","https://openalex.org/W2092911568","https://openalex.org/W2094475962","https://openalex.org/W2113722134","https://openalex.org/W2126499385","https://openalex.org/W2143342293","https://openalex.org/W2162176451","https://openalex.org/W2497449838","https://openalex.org/W2524588181","https://openalex.org/W2525105824","https://openalex.org/W2530616910","https://openalex.org/W2531563875","https://openalex.org/W2772521659","https://openalex.org/W2886271628","https://openalex.org/W2899987233","https://openalex.org/W2911515868","https://openalex.org/W2913295241","https://openalex.org/W2913479001","https://openalex.org/W2914178012","https://openalex.org/W2950321465","https://openalex.org/W2951494809","https://openalex.org/W4206370914","https://openalex.org/W4244653005","https://openalex.org/W4285719527","https://openalex.org/W4388298880"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W1496100162","https://openalex.org/W1980681296","https://openalex.org/W1514298554","https://openalex.org/W1597500234","https://openalex.org/W4303044088","https://openalex.org/W1570648367","https://openalex.org/W4298442682"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"the":[3,23,32,60],"CIFF":[4,18,61],"proof":[5,25],"procedure":[6,26],"for":[7,27],"abductive":[8,28,67],"logic":[9,29,55],"programming":[10],"with":[11,49,65],"constraints,":[12],"and":[13,42,69,73],"we":[14,58],"prove":[15],"its":[16],"correctness.":[17],"is":[19],"an":[20],"extension":[21],"of":[22],"IFF":[24],"programming,":[30],"relaxing":[31],"original":[33],"restrictions":[34],"over":[35],"variable":[36],"quantification":[37],"(":[38],"allowedness":[39],"conditions":[40],")":[41],"incorporating":[43],"a":[44],"constraint":[45,54],"solver":[46],"to":[47,76,79],"deal":[48],"numerical":[50],"constraints":[51],"as":[52],"in":[53],"programming.":[56],"Finally,":[57],"describe":[59],"system,":[62],"comparing":[63],"it":[64,78],"state-of-the-art":[66],"systems":[68],"answer":[70],"set":[71],"solvers":[72],"showing":[74],"how":[75],"use":[77],"program":[80],"some":[81],"applications.":[82]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}