{"id":"https://openalex.org/W2076755642","doi":"https://doi.org/10.1080/088395197118343","title":"A look at clp: Theory and application","display_name":"A look at clp: Theory and application","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2076755642","doi":"https://doi.org/10.1080/088395197118343","mag":"2076755642"},"language":"en","primary_location":{"id":"doi:10.1080/088395197118343","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395197118343","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395197118343?needAccess=true","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":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395197118343?needAccess=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015574830","display_name":"J\u00falius Csont\u00f3","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Julius Csonto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071015069","display_name":"J\u00e1n Parali\u010d","orcid":"https://orcid.org/0000-0002-4603-0411"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Paralic","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015574830"],"corresponding_institution_ids":[],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.5663,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69657058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"1","first_page":"59","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13886","display_name":"Operations Management Techniques","score":0.9466000199317932,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T13886","display_name":"Operations Management Techniques","score":0.9466000199317932,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9057999849319458,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7879230976104736},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.7389842867851257},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6363756060600281},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.567101240158081},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5642420053482056},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4981086254119873},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.49603137373924255},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41240930557250977},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.41113948822021484},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36815834045410156},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.36556947231292725},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3506847620010376},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.2891286015510559},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19760119915008545},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10367786884307861}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7879230976104736},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7389842867851257},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6363756060600281},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.567101240158081},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5642420053482056},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4981086254119873},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49603137373924255},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41240930557250977},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.41113948822021484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36815834045410156},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36556947231292725},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3506847620010376},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2891286015510559},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19760119915008545},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10367786884307861},{"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/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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/088395197118343","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395197118343","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395197118343?needAccess=true","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"}],"best_oa_location":{"id":"doi:10.1080/088395197118343","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395197118343","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395197118343?needAccess=true","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2076755642.pdf","grobid_xml":"https://content.openalex.org/works/W2076755642.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2495969191","https://openalex.org/W4243324743","https://openalex.org/W1548860908","https://openalex.org/W2138204654","https://openalex.org/W2104355231","https://openalex.org/W1548690989","https://openalex.org/W1589232796","https://openalex.org/W2016675527","https://openalex.org/W1517880980","https://openalex.org/W1591778271"],"abstract_inverted_index":{"Constraint":[0],"logic":[1,108],"programming":[2,8,109],"CLP":[3,19,41,48,58,78,98,123,147],"is":[4,111,124],"a":[5,54,133],"relatively":[6],"new":[7],"paradigm.":[9],"During":[10],"its":[11,81],"10":[12],"years":[13],"of":[14,18,47,56,77,129],"existence":[15],"the":[16,25,44,62,115,118,130,140,146],"theory":[17],"has":[20,49],"been":[21,37,50,67],"increasingly":[22],"understood":[23],"and":[24,32,65,94,107,114],"two":[26,101],"differ":[27],"ent":[28],"approaches":[29],"domain":[30],"technology":[31],"incremental":[33],"linear":[34],"solving":[35,106],"have":[36,66],"implemented":[38],"in":[39,70,122],"various":[40],"systems.":[42],"Meanwhile":[43],"commercial":[45,57],"attractivity":[46],"growing.":[51],"Since":[52],"1989":[53],"couple":[55],"systems":[59],"appeared":[60],"on":[61],"software":[63],"market":[64],"successfully":[68],"used":[69],"many":[71,95],"real":[72,134],"life":[73,135],"applications.":[74],"The":[75,126],"power":[76],"stems":[79],"from":[80,100],"ability":[82],"to":[83],"solve":[84],"hard":[85],"combinatorial":[86],"problems":[87],"such":[88],"as":[89],"planning":[90],"scheduling":[91,136],"resource":[92],"allocation":[93],"others.":[96],"How":[97],"originated":[99],"declarative":[102],"paradigms":[103],"-":[104,110],"constraint":[105],"informally":[112],"explained":[113],"relationship":[116],"between":[117],"different":[119],"ap":[120],"proaches":[121],"presented.":[125],"main":[127],"part":[128],"article":[131],"presents":[132],"appli":[137],"cation":[138],"for":[139],"largest":[141],"Slovak":[142],"metallurgy":[143],"company":[144],"using":[145],"system":[148],"ECL":[149],"PS.":[150]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}