{"id":"https://openalex.org/W4212857214","doi":"https://doi.org/10.1016/s1571-0661(05)80559-6","title":"Preface","display_name":"Preface","publication_year":2001,"publication_date":"2001-11-01","ids":{"openalex":"https://openalex.org/W4212857214","doi":"https://doi.org/10.1016/s1571-0661(05)80559-6"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80559-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80559-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80559-6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029542014","display_name":"Mark van den Brand","orcid":"https://orcid.org/0000-0003-3529-6182"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark van den Brand","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050592031","display_name":"Rakesh Verma","orcid":"https://orcid.org/0000-0002-7466-7823"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rakesh Verma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43139213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"4","first_page":"425","last_page":"426"},"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.9679999947547913,"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.9679999947547913,"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.740484356880188},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7292549014091492},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5865760445594788},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.5383362174034119},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4818507432937622},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4318614602088928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.398044228553772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16337710618972778}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.740484356880188},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7292549014091492},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5865760445594788},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5383362174034119},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4818507432937622},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4318614602088928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.398044228553772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16337710618972778},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":3,"locations":[{"id":"doi:10.1016/s1571-0661(05)80559-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80559-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/2251f855-5490-40a0-a4e0-a1066b4b3ff5","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2251f855-5490-40a0-a4e0-a1066b4b3ff5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Brand, van den, M G J & Verma, R M 2001, Foreword to Special issue. in RULE 2001 (Second International Workshop on Rule-Based Programming, Firenze, Italy, September 4, 2001). Electronic Notes in Theoretical Computer Science, no. 4, vol. 59, Second International Workshop on Rule-Based Programming, RULE 2001, Firenze, Italy, 4/09/01. https://doi.org/10.1016/S1571-0661(05)80559-6","raw_type":"contributionToPeriodical"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2251f855-5490-40a0-a4e0-a1066b4b3ff5","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/2251f855-5490-40a0-a4e0-a1066b4b3ff5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RULE 2001 (Second International Workshop on Rule-Based Programming, Firenze, Italy, September 4, 2001)","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80559-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80559-6","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"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/W1999702466","https://openalex.org/W2140386967","https://openalex.org/W4248067243","https://openalex.org/W4246503451","https://openalex.org/W4205997139","https://openalex.org/W1534488117","https://openalex.org/W4206249920","https://openalex.org/W1485791179","https://openalex.org/W1560895966","https://openalex.org/W1596719193"],"abstract_inverted_index":{"Foreword":[0],"This":[1,31,118,556,574],"volume":[2,557,562],"contains":[3],"the":[4,7,33,37,55,74,116,134,152,170,174,188,200,248,291,309,313,320,322,325,328,336,340,365,391,395,438,453,462,488,565,580,592,599,606,615,629,638,646,661,679],"Proceedings":[5],"of":[6,36,54,58,66,77,82,100,176,190,202,250,288,293,316,327,331,335,367,371,384,394,398,412,420,464,490,547,582,637,641],"Second":[8],"International":[9,38],"Workshop":[10,16,39],"on":[11,22,40,264],"Rule-Based":[12,41],"Programming":[13,42],"(RULE2001).":[14],"The":[15,589],"was":[17],"held":[18],"in":[19,115,122,128,155,160,182,184,196,214,401,564,569,591,613,660,664],"Firenze,":[20],"Italy":[21],"September":[23],"4,":[24],"2001,":[25],"as":[26,193,195,213,374,404,406,446,448,483,485,561],"satellite":[27],"event":[28],"to":[29,103,145,162,166,186,208,220,227,244,252,301,433,468,476,486,604,627],"PLI2001.":[30],"is":[32,120,180,206,242,282,382,430,442,456,467,576],"second":[34],"edition":[35],"(RULE'2001).":[43],"We":[44,69,601,644,653],"aim":[45],"with":[46,61,73,111,290],"this":[47,240,465,491,651],"workshop":[48,466],"at":[49,598],"a":[50,80,89,92,95,98,105,229,285,375,619],"fruitful":[51],"cross":[52],"fertilization":[53],"theoretical":[56,84,143,310,392],"foundations":[57,144],"rule-based":[59,67,101,113],"programming":[60,109,191,261,272,281,376,429,436,451,492],"practical":[62,147,341,385],"applications":[63],"and":[64,91,124,169,275,296,304,334,350,355,417,444,481,586,617,677,690],"implementation":[65],"systems.":[68],"are":[70],"very":[71,83,146],"pleased":[72],"broad":[75],"range":[76],"papers:":[78],"quite":[79],"number":[81,99],"ones":[85],"upto":[86],"papers":[87,616],"describing":[88,94,173],"system":[90,154,441,455],"paper":[93],"comparison":[96],"between":[97,479],"systems":[102,114,130,245,277,297,352],"tackle":[104],"bio-medical":[106],"problem.":[107],"Rule-based":[108,280],"began":[110],"AI":[112],"seventies.":[117],"paradigm":[119],"inherent":[121],"Prolog":[123],"has":[125],"been":[126],"used":[127,181,207,457],"program-manipulation":[129],"like":[131,199,258,345,353,359,390,603,626],"Refine.":[132],"Indeed,":[133],"rewriting":[135,317,332,337],"concept":[136,366],"appears":[137],"throughout":[138],"computer":[139],"science,":[140],"from":[141,472],"its":[142,587],"implementations.":[148],"Extreme":[149],"examples":[150],"include":[151],"mail":[153,164],"Unix":[156],"which":[157],"uses":[158],"rules":[159,172,226],"order":[161,185],"rewrite":[163,440,454],"addresses":[165],"canonical":[167],"forms":[168],"transition":[171,276],"behaviour":[175],"tree":[177],"automata.":[178],"Rewriting":[179],"semantics":[183,411],"describe":[187,228],"meaning":[189],"languages,":[192,344,403,414],"well":[194,405,447,484],"program":[197,607],"transformations":[198],"re-engineering":[201],"Cobol":[203],"programs.":[204],"It":[205],"compute,":[209],"implicitly":[210],"or":[211,216,233],"explicitly,":[212],"Mathematica":[215],"OBJ,":[217],"but":[218,237],"also":[219,356,424],"perform":[221],"deduction":[222],"when":[223],"using":[224],"inference":[225],"logic,":[230,266],"theorem":[231],"prover":[232],"constraint":[234],"solver.":[235],"Last,":[236],"not":[238],"least,":[239],"approach":[241],"central":[243],"that":[246,298,364],"raise":[247],"notion":[249],"rule":[251,368],"an":[253],"explicit":[254],"first":[255],"class":[256],"object,":[257],"expert":[259],"systems,":[260],"languages":[262],"based":[263,428],"equational":[265],"algebraic":[267],"specifications":[268],"(e.g.":[269,273,278],"OBJ),":[270],"functional":[271,435],"ML)":[274],"Murphi).":[279],"currently":[283],"experiencing":[284],"renewed":[286],"period":[287],"growth":[289,489],"emergence":[292,326],"new":[294,343],"concepts":[295,318,330],"allow":[299],"one":[300],"better":[302,305],"understand":[303],"use":[306,422],"it.":[307],"From":[308],"side,":[311,342],"after":[312],"in-depth":[314],"study":[315,393],"during":[319],"eighties,":[321],"nineties":[323],"saw":[324],"general":[329],"logic":[333,450],"calculus.":[338],"On":[339],"ASM,":[346],"ASF+SDF,":[347],"Claire,":[348],"ELAN":[349],"Maude,":[351],"LRR,":[354],"commercial":[357],"products,":[358],"Ilog":[360],"Rules,":[361],"have":[362],"shown":[363],"could":[369],"be":[370,425,559,596],"major":[372],"interest":[373],"tool.":[377],"In":[378],"particular,":[379],"because":[380],"it":[381],"now":[383],"use,":[386],"fundamental":[387],"questions":[388],"arise,":[389],"algorithmic":[396],"complexity":[397],"programs":[399],"written":[400],"such":[402,413],"their":[407,421,611],"optimisation.":[408],"Of":[409],"course,":[410],"compilation":[415],"techniques":[416],"methodological":[418],"studies":[419],"should":[423],"explored.":[426],"Rule":[427],"closely":[431],"related":[432],"both":[434],"(when":[437,452],"term":[439],"confluent":[443],"terminating)":[445],"classical":[449],"for":[458,610,634,649,656,675,682],"nondeterministic":[459],"search).":[460],"Accordingly,":[461],"purpose":[463],"bring":[469],"together":[470],"researchers":[471],"these":[473,658],"various":[474],"domains":[475],"foster":[477],"fertilisation":[478],"theory":[480],"practice,":[482],"favour":[487],"paradigm.":[493],"Mark":[494,686],"van":[495,687],"den":[496,688],"Brand":[497,689],"(":[498,504,510,516,524,530,536,545,552],"CWI":[499],"Amsterdam":[500],")":[501,507,513,521,527,533,541,549,555],"Iliano":[502],"Cervesato":[503],"ITT":[505],"Industries":[506],"Nachum":[508],"Dershowitz":[509],"Tel-Aviv":[511],"University":[512,546,554],"Bernd":[514],"Fischer":[515],"RIACS/NASA":[517],"Ames,":[518],"Moffett":[519],"Field":[520],"Claude":[522],"Kirchner":[523],"LORIA":[525,531],"Nancy":[526,532],"Jean-Yves":[528],"Marion":[529],"Narciso":[534],"Marti-Oliet":[535],"Universidad":[537],"Complutense":[538],"de":[539],"Madrid":[540],"Rakesh":[542,691],"M.":[543,692],"Verma":[544,693],"Houston":[548],"Eelco":[550],"Visser":[551],"Utrecht":[553],"will":[558],"published":[560,577],"44-2":[563],"series":[566,575,594],"Electronic":[567,662],"Notes":[568,663],"Theoretical":[570,665],"Computer":[571,666],"Science":[572,584,667],"(ENTCS).":[573,668],"electronically":[578],"through":[579],"facilities":[581],"Elsevier":[583,655],"B.V.":[585],"auspices.":[588],"volumes":[590],"ENTCS":[593],"can":[595],"accessed":[597],"URL":[600],"would":[602,625],"thank":[605,628,645,654,671],"committee":[608,633],"members":[609],"help":[612],"evaluating":[614],"making":[618],"scientifically":[620],"interesting":[621],"selection.":[622],"Furthermore,":[623],"we":[624,670],"{\\bf":[630],"PLI}":[631],"organizing":[632],"taking":[635],"care":[636],"local":[639],"organization":[640,648],"our":[642],"workshop.":[643,652],"ACM":[647],"sponsoring":[650],"publishing":[657],"proceedings":[659],"Finally,":[669],"Professor":[672],"Michael":[673],"Mislove":[674],"providing":[676],"adapting":[678],"style":[680],"files":[681],"ENTCS.":[683],"November,":[684],"2001":[685]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2022-02-24T00:00:00"}