{"id":"https://openalex.org/W1964013298","doi":"https://doi.org/10.1017/s1471068411000524","title":"Introduction to the special issue on Prolog systems","display_name":"Introduction to the special issue on Prolog systems","publication_year":2011,"publication_date":"2011-09-12","ids":{"openalex":"https://openalex.org/W1964013298","doi":"https://doi.org/10.1017/s1471068411000524","mag":"1964013298"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068411000524","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068411000524","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":"https://lirias.kuleuven.be/handle/123456789/349900","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110447732","display_name":"Bart Demoen","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"BART DEMOEN","raw_affiliation_strings":["Department of Computer Science, K.U.Leuven, B-3001 Leuven, Belgium (e-mail:","Department of computer science, k.u.leuven, b-3001 leuven, belgium (e-mail: bart.demoen@cs.kuleuven.be)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, K.U.Leuven, B-3001 Leuven, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of computer science, k.u.leuven, b-3001 leuven, belgium (e-mail: bart.demoen@cs.kuleuven.be)#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083095334","display_name":"Mar\u00eda Garc\u00eda de la Banda","orcid":"https://orcid.org/0000-0002-6666-514X"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"MARIA GARCIA DE LA BANDA","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Melbourne, VIC 3145, Australia (e-mail:","Faculty of information technology, monash university, melbourne, vic 3145, australia (e-mail: maria.garciadelabanda@monash.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, VIC 3145, Australia (e-mail:","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of information technology, monash university, melbourne, vic 3145, australia (e-mail: maria.garciadelabanda@monash.edu)#TAB#","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4396,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71477773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"12","issue":"1-2","first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983999729156494,"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.9983999729156494,"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.9936000108718872,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9871000051498413,"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/prolog","display_name":"Prolog","score":0.9313321113586426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8433828353881836},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8184909820556641},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.7807934284210205},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6649685502052307},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.5823903679847717},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.5308217406272888},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.4773321747779846},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.47023364901542664},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.4601600170135498},{"id":"https://openalex.org/keywords/procedural-programming","display_name":"Procedural programming","score":0.4403931200504303},{"id":"https://openalex.org/keywords/symbolic-programming","display_name":"Symbolic programming","score":0.41925108432769775},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.4155222177505493},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3395736813545227},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.07947510480880737}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.9313321113586426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8433828353881836},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8184909820556641},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.7807934284210205},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6649685502052307},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.5823903679847717},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.5308217406272888},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.4773321747779846},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.47023364901542664},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.4601600170135498},{"id":"https://openalex.org/C120558287","wikidata":"https://www.wikidata.org/wiki/Q1418502","display_name":"Procedural programming","level":4,"score":0.4403931200504303},{"id":"https://openalex.org/C61714564","wikidata":"https://www.wikidata.org/wiki/Q7661185","display_name":"Symbolic programming","level":4,"score":0.41925108432769775},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4155222177505493},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3395736813545227},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.07947510480880737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068411000524","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068411000524","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:lirias2repo.kuleuven.be:123456789/349900","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/349900","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 12 (1-2), (1-4)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/349900","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/349900","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 12 (1-2), (1-4)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1598781941","https://openalex.org/W4239436350","https://openalex.org/W2161156675","https://openalex.org/W307044906","https://openalex.org/W4297858271","https://openalex.org/W2039406101","https://openalex.org/W1505955281","https://openalex.org/W2089642402","https://openalex.org/W2553706208","https://openalex.org/W2006766462"],"abstract_inverted_index":{"It":[0],"has":[1,42],"now":[2],"been":[3,33],"40":[4,48],"years":[5],"since":[6],"the":[7,10,36,39,65,118,134],"birth":[8],"of":[9,14,29,38,96,99,115,120,136],"Prolog":[11,30,40,50,69,124],"language":[12,41,75],"and":[13,21,101,108,129,149],"its":[15],"first":[16],"implementation":[17],"by":[18],"A.":[19],"Colmerauer":[20],"P.":[22],"Roussel.":[23],"Since":[24],"then,":[25],"a":[26],"large":[27,97],"number":[28],"systems":[31,51,125],"have":[32,52,78,131],"implemented.":[34],"While":[35],"core":[37],"not":[43],"changed":[44],"much":[45],"in":[46,81],"these":[47],"years,":[49],"undergone":[53],"an":[54],"extraordinary":[55],"evolution":[56],"that":[57,77,105,130],"stems":[58],"from":[59,73],"two":[60],"main":[61],"sources.":[62],"One":[63],"is":[64,117],"trend":[66],"to":[67,70,133],"extend":[68],"incorporate":[71],"ideas":[72,121],"other":[74],"paradigms":[76],"proved":[79],"useful":[80],"real-world":[82],"applications.":[83],"This":[84,140],"includes":[85,141],"concurrency,":[86],"parallelism,":[87],"higher":[88],"order":[89],"predicates,":[90],"object-oriented":[91],"programming,":[92,145,148],"Web":[93],"interfaces,":[94],"processing":[95],"amounts":[98],"data,":[100],"flexible":[102],"developer":[103],"tools":[104],"enhance":[106],"reliability":[107],"robustness":[109],"through":[110],"assertions.":[111],"A":[112],"second":[113],"source":[114],"change":[116],"exploration":[119],"for":[122],"which":[123],"are":[126],"uniquely":[127],"suitable":[128],"led":[132],"creation":[135],"new":[137],"programming":[138],"paradigms.":[139],"tabling,":[142],"constraint":[143],"logic":[144,151],"answer":[146],"set":[147],"probabilistic":[150],"programming.":[152]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
