{"id":"https://openalex.org/W2102643211","doi":"https://doi.org/10.1017/s1471068402001473","title":"Using parametric set constraints for locating errors in CLP programs","display_name":"Using parametric set constraints for locating errors in CLP programs","publication_year":2002,"publication_date":"2002-07-01","ids":{"openalex":"https://openalex.org/W2102643211","doi":"https://doi.org/10.1017/s1471068402001473","mag":"2102643211"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068402001473","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068402001473","pdf_url":null,"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":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-12199","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066576127","display_name":"W\u0142odzimierz Drabent","orcid":"https://orcid.org/0000-0002-4700-7272"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"W\u0141ODZIMIERZ DRABENT","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111372277","display_name":"Jan Ma\u0142uszy\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"JAN MA\u0141USZY\u0143SKI","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043232032","display_name":"Pawe\u0142 Pietrzak","orcid":"https://orcid.org/0000-0001-5310-264X"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"PAWE\u0141 PIETRZAK","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail:","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, S \u2013 581 83 Link\u00f6ping, Sweden (e-mail: [email\u00a0protected] [email\u00a0protected] [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":1.6906,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86193275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2","issue":"4-5","first_page":"549","last_page":"610"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.991100013256073,"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.8286746740341187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8260476589202881},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7886122465133667},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6723257899284363},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.6532150506973267},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.6017489433288574},{"id":"https://openalex.org/keywords/algorithmic-program-debugging","display_name":"Algorithmic program debugging","score":0.4504854679107666},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4138169586658478},{"id":"https://openalex.org/keywords/parametric-programming","display_name":"Parametric programming","score":0.41353753209114075},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41343531012535095},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4124705195426941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3980531096458435},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3863973319530487},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.13560745120048523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12688961625099182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1197512149810791}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8286746740341187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8260476589202881},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7886122465133667},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6723257899284363},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.6532150506973267},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.6017489433288574},{"id":"https://openalex.org/C136388014","wikidata":"https://www.wikidata.org/wiki/Q17084976","display_name":"Algorithmic program debugging","level":3,"score":0.4504854679107666},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4138169586658478},{"id":"https://openalex.org/C2776045410","wikidata":"https://www.wikidata.org/wiki/Q25111241","display_name":"Parametric programming","level":3,"score":0.41353753209114075},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41343531012535095},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4124705195426941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3980531096458435},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3863973319530487},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.13560745120048523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12688961625099182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1197512149810791},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068402001473","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068402001473","pdf_url":null,"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:CiteSeerX.psu:10.1.1.26.6939","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.6939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ida.liu.se/~pawpi/Papers/submitted.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.7758","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ida.liu.se/~pawpi/Papers/tplp.ps.gz","raw_type":"text"},{"id":"pmh:oai:DiVA.org:ltu-12199","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-12199","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:ltu-12199","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-12199","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W17610430","https://openalex.org/W25016858","https://openalex.org/W31561947","https://openalex.org/W41900915","https://openalex.org/W63829728","https://openalex.org/W99535058","https://openalex.org/W130711549","https://openalex.org/W159226319","https://openalex.org/W167696951","https://openalex.org/W171682210","https://openalex.org/W202590952","https://openalex.org/W1278612252","https://openalex.org/W1484125579","https://openalex.org/W1485320411","https://openalex.org/W1492803714","https://openalex.org/W1495218583","https://openalex.org/W1521171921","https://openalex.org/W1527187705","https://openalex.org/W1530717542","https://openalex.org/W1531074043","https://openalex.org/W1532363834","https://openalex.org/W1532529131","https://openalex.org/W1541434994","https://openalex.org/W1544096846","https://openalex.org/W1556018967","https://openalex.org/W1562575382","https://openalex.org/W1579672261","https://openalex.org/W1589124319","https://openalex.org/W1593799327","https://openalex.org/W1597918680","https://openalex.org/W1598816868","https://openalex.org/W1616475887","https://openalex.org/W1735499966","https://openalex.org/W1795067865","https://openalex.org/W1810308530","https://openalex.org/W1965825795","https://openalex.org/W1982243747","https://openalex.org/W1988095917","https://openalex.org/W1992343119","https://openalex.org/W2002089154","https://openalex.org/W2033405134","https://openalex.org/W2037439718","https://openalex.org/W2038037493","https://openalex.org/W2047050741","https://openalex.org/W2061268302","https://openalex.org/W2069076448","https://openalex.org/W2073166886","https://openalex.org/W2076696436","https://openalex.org/W2080286813","https://openalex.org/W2081810835","https://openalex.org/W2091776887","https://openalex.org/W2094612221","https://openalex.org/W2098303102","https://openalex.org/W2103933902","https://openalex.org/W2115656500","https://openalex.org/W2118483018","https://openalex.org/W2180114379","https://openalex.org/W4206370914","https://openalex.org/W4233171722","https://openalex.org/W4241755441","https://openalex.org/W4244311647","https://openalex.org/W4285719527","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1980681296","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W1496100162","https://openalex.org/W1597500234","https://openalex.org/W202947224","https://openalex.org/W2175178858","https://openalex.org/W1971069708","https://openalex.org/W1548409801"],"abstract_inverted_index":{"This":[0],"paper":[1,118],"introduces":[2],"a":[3,17,28,49,88,120],"framework":[4],"of":[5,39,51,58,64,91,94,99,123],"parametric":[6,65,89],"descriptive":[7],"directional":[8,133],"types":[9],"for":[10,19,54,72,78],"Constraint":[11],"Logic":[12],"Programming":[13],"(CLP).":[14],"It":[15],"proposes":[16],"method":[18,101],"locating":[20],"type":[21,42,81],"errors":[22],"in":[23,87],"CLP":[24],"programs,":[25],"and":[26,74,104],"presents":[27],"prototype":[29,106],"debugging":[30,107],"tool.":[31],"The":[32,44,83,97,117],"main":[33],"technique":[34],"used":[35,71],"is":[36,46,102,113,119],"checking":[37,75],"correctness":[38,57],"programs":[40,60],"w.r.t.":[41],"specifications.":[43,66,82],"approach":[45,112],"based":[47],"on":[48,115],"generalization":[50],"known":[52],"methods":[53],"proving":[55],"the":[56,62,92,100,105,110,124,128],"logic":[59],"to":[61],"case":[63],"Set":[67],"constraint":[68],"techniques":[69],"are":[70,85],"formulating":[73],"verification":[76],"conditions":[77],"(parametric)":[79],"polymorphic":[80],"specifications":[84],"expressed":[86],"extension":[90,122],"formalism":[93],"term":[95],"grammars.":[96],"soundness":[98],"proved,":[103],"tool":[108],"supporting":[109],"proposed":[111],"illustrated":[114],"examples.":[116],"substantial":[121],"previous":[125],"work":[126],"by":[127],"same":[129],"authors":[130],"concerning":[131],"monomorphic":[132],"types.":[134]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}