{"id":"https://openalex.org/W2075185101","doi":"https://doi.org/10.1017/s1471068405002590","title":"Programming finite-domain constraint propagators in Action Rules","display_name":"Programming finite-domain constraint propagators in Action Rules","publication_year":2006,"publication_date":"2006-08-02","ids":{"openalex":"https://openalex.org/W2075185101","doi":"https://doi.org/10.1017/s1471068405002590","mag":"2075185101"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068405002590","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068405002590","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113864016","display_name":"Neng\u2010Fa Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]},{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"NENG-FA ZHOU","raw_affiliation_strings":["Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, New York, NY, USA (e-mail:","Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, New York, NY, USA (e-mail: zhou@sci.brooklyn.cuny.edu)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, New York, NY, USA (e-mail:","institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"]},{"raw_affiliation_string":"Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, New York, NY, USA (e-mail: zhou@sci.brooklyn.cuny.edu)#TAB#","institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113864016"],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":5.0401,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95552902,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"6","issue":"5","first_page":"483","last_page":"507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9972000122070312,"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.9958999752998352,"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.7519241571426392},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.75138258934021},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.7149398922920227},{"id":"https://openalex.org/keywords/propagator","display_name":"Propagator","score":0.6315199732780457},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6303727626800537},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6186798810958862},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5331919193267822},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5106435418128967},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5055475234985352},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4739277958869934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3959025740623474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33786267042160034},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2691330909729004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18278279900550842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1762811541557312},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.12002909183502197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7519241571426392},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.75138258934021},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.7149398922920227},{"id":"https://openalex.org/C104416048","wikidata":"https://www.wikidata.org/wiki/Q302518","display_name":"Propagator","level":2,"score":0.6315199732780457},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6303727626800537},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6186798810958862},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5331919193267822},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5106435418128967},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5055475234985352},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4739277958869934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3959025740623474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33786267042160034},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2691330909729004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18278279900550842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1762811541557312},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.12002909183502197},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068405002590","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068405002590","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.9.1485","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.1485","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sci.brooklyn.cuny.edu/~zhou/papers/arule.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332202","display_name":"Research Foundation of The City University of New York","ror":"https://ror.org/01d03cj21"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W60619409","https://openalex.org/W60640206","https://openalex.org/W65937437","https://openalex.org/W121483342","https://openalex.org/W159530801","https://openalex.org/W1480778854","https://openalex.org/W1482341588","https://openalex.org/W1488929456","https://openalex.org/W1504803856","https://openalex.org/W1513860237","https://openalex.org/W1517590008","https://openalex.org/W1578535952","https://openalex.org/W1586765942","https://openalex.org/W1586826229","https://openalex.org/W1589232796","https://openalex.org/W1590937195","https://openalex.org/W1972938981","https://openalex.org/W1982482731","https://openalex.org/W1983792792","https://openalex.org/W1986753785","https://openalex.org/W1988095917","https://openalex.org/W2012741612","https://openalex.org/W2043193943","https://openalex.org/W2053384008","https://openalex.org/W2063727779","https://openalex.org/W2079333278","https://openalex.org/W2085891301","https://openalex.org/W2148546044","https://openalex.org/W2164279585","https://openalex.org/W2170803956","https://openalex.org/W2337098149"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W1536604285","https://openalex.org/W1567852657","https://openalex.org/W2032348095","https://openalex.org/W1519282274","https://openalex.org/W2624275032","https://openalex.org/W2073925063","https://openalex.org/W1597500234","https://openalex.org/W2140769824"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,138],"propose":[4],"a":[5,31,79,106,140,149,170],"new":[6],"language,":[7],"called":[8],"AR":[9,54,104],"(":[10],"Action":[11],"Rules":[12],"),":[13],"and":[14,43,91,124,148],"describe":[15],"how":[16],"various":[17],"propagators":[18],"for":[19,33,47,78,127,144,152],"finite-domain":[20,121],"constraints":[21],"can":[22,40,50],"be":[23],"implemented":[24],"in":[25,101,118],"it.":[26],"An":[27],"action":[28,36,163],"rule":[29],"specifies":[30],"pattern":[32,46],"agents,":[34],"an":[35,44,82],"that":[37,49,84,167],"the":[38,52,56,64,86,89,95,98,102,114,119,145],"agents":[39],"carry":[41],"out,":[42],"event":[45],"events":[48],"activate":[51],"agents.":[53],"combines":[55],"goal-oriented":[57],"execution":[58,66,70],"model":[59,71],"of":[60,88,97],"logic":[61],"programming":[62,73],"with":[63],"event-driven":[65],"model.":[67],"This":[68],"hybrid":[69,150],"facilitates":[72],"constraint":[74,80,90,122,147],"propagators.":[75],"A":[76],"propagator":[77,143],"is":[81,92,125],"agent":[83],"maintains":[85],"consistency":[87],"activated":[93],"by":[94],"updates":[96],"domain":[99],"variables":[100],"constraint.":[103],"has":[105,158],"much":[107],"stronger":[108],"descriptive":[109],"power":[110],"than":[111],"indexicals":[112],",":[113],"language":[115],"widely":[116],"used":[117],"current":[120],"systems,":[123],"flexible":[126],"implementing":[128],"not":[129],"only":[130],"interval-consistency":[131],"but":[132],"also":[133],"arc-consistency":[134,142],"algorithms.":[135],"As":[136],"examples,":[137],"present":[139],"weak":[141],"all_distinct":[146],"algorithm":[151],"n-ary":[153],"linear":[154],"equality":[155],"constraints.":[156],"B-Prolog":[157,168],"been":[159],"extended":[160],"to":[161],"accommodate":[162],"rules.":[164],"Benchmarking":[165],"shows":[166],"as":[169],"CLP(FD)":[171,176],"system":[172],"significantly":[173],"outperforms":[174],"other":[175],"systems.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}