{"id":"https://openalex.org/W2105321460","doi":"https://doi.org/10.1145/2505879.2505901","title":"Theory propagation and rational-trees","display_name":"Theory propagation and rational-trees","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2105321460","doi":"https://doi.org/10.1145/2505879.2505901","mag":"2105321460"},"language":"en","primary_location":{"id":"doi:10.1145/2505879.2505901","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-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/A5063965821","display_name":"Edward Robbins","orcid":"https://orcid.org/0000-0002-8179-1355"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ed Robbins","raw_affiliation_strings":["University of Kent"],"affiliations":[{"raw_affiliation_string":"University of Kent","institution_ids":["https://openalex.org/I20581793"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039886424","display_name":"Jacob M. Howe","orcid":"https://orcid.org/0000-0001-8013-6941"},"institutions":[{"id":"https://openalex.org/I180825142","display_name":"City, University of London","ror":"https://ror.org/04489at23","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I180825142"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jacob M. Howe","raw_affiliation_strings":["City University London"],"affiliations":[{"raw_affiliation_string":"City University London","institution_ids":["https://openalex.org/I180825142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103107567","display_name":"Andy King","orcid":"https://orcid.org/0000-0001-5806-4822"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andy King","raw_affiliation_strings":["University of Kent"],"affiliations":[{"raw_affiliation_string":"University of Kent","institution_ids":["https://openalex.org/I20581793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063965821"],"corresponding_institution_ids":["https://openalex.org/I20581793"],"apc_list":null,"apc_paid":null,"fwci":3.9551,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.93826491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"204"},"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.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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.9980999827384949,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.8153210878372192},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7996596693992615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6506790518760681},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6321930289268494},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5191634893417358},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5029239058494568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47851312160491943},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4731513261795044},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.4466436803340912},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.4430772364139557},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.42452359199523926},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4152299761772156},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3834573030471802},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.33687645196914673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31819212436676025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17761337757110596},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10843071341514587}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.8153210878372192},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7996596693992615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6506790518760681},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6321930289268494},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5191634893417358},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5029239058494568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47851312160491943},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4731513261795044},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.4466436803340912},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.4430772364139557},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.42452359199523926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4152299761772156},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3834573030471802},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.33687645196914673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31819212436676025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17761337757110596},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10843071341514587},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"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/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2505879.2505901","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:kar.kent.ac.uk:37525","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505901>)","pdf_url":null,"source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:openaccess.city.ac.uk:3872","is_oa":false,"landing_page_url":"https://openaccess.city.ac.uk/view/creators_id/j=2Em=2Ehowe.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4306401940","display_name":"City Research Online (City University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180825142","host_organization_name":"City, University of London","host_organization_lineage":["https://openalex.org/I180825142"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.453.6049","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.453.6049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kar.kent.ac.uk/37525/1/main.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W191489030","https://openalex.org/W1484352250","https://openalex.org/W1498682591","https://openalex.org/W1500991862","https://openalex.org/W1567682528","https://openalex.org/W1578878051","https://openalex.org/W1586826229","https://openalex.org/W1590937195","https://openalex.org/W1602567617","https://openalex.org/W1602826054","https://openalex.org/W1810972023","https://openalex.org/W1853394558","https://openalex.org/W1923495615","https://openalex.org/W1946627845","https://openalex.org/W1975914482","https://openalex.org/W1982205631","https://openalex.org/W1992520783","https://openalex.org/W1999346653","https://openalex.org/W2011306767","https://openalex.org/W2012741612","https://openalex.org/W2022846948","https://openalex.org/W2049460548","https://openalex.org/W2057361103","https://openalex.org/W2064452120","https://openalex.org/W2085301456","https://openalex.org/W2107481678","https://openalex.org/W2107558499","https://openalex.org/W2112481005","https://openalex.org/W2121531736","https://openalex.org/W2122211950","https://openalex.org/W2128389850","https://openalex.org/W2129467562","https://openalex.org/W2130178878","https://openalex.org/W2140525979","https://openalex.org/W2140839850","https://openalex.org/W2142785340","https://openalex.org/W2160848149","https://openalex.org/W2168776788","https://openalex.org/W2287471351","https://openalex.org/W2401156470","https://openalex.org/W2504609973","https://openalex.org/W2561675875","https://openalex.org/W4231708524","https://openalex.org/W4250522981","https://openalex.org/W4285719527","https://openalex.org/W6631338962","https://openalex.org/W6685398549","https://openalex.org/W6823707895"],"related_works":["https://openalex.org/W1868334863","https://openalex.org/W2159786179","https://openalex.org/W1486916474","https://openalex.org/W2585406248","https://openalex.org/W1595962583","https://openalex.org/W2287565210","https://openalex.org/W2624275032","https://openalex.org/W4303044088","https://openalex.org/W202947224","https://openalex.org/W2188204860"],"abstract_inverted_index":{"SAT":[0],"Modulo":[1],"Theories":[2],"(SMT)":[3],"is":[4,51,75,104,130,153],"the":[5,9,58,62,68,87,128],"problem":[6,63,108,122],"of":[7,11,61,89,97,113,132,158],"determining":[8],"satisfiability":[10],"a":[12,19,39,80,107,135,156,165],"formula":[13],"in":[14,49,57,67,86,100,109,139,147],"which":[15],"constraints,":[16,134],"drawn":[17],"from":[18,116],"given":[20],"constraint":[21,69],"theory":[22,65,129,136],"T,":[23],"are":[24],"composed":[25],"with":[26,64],"logical":[27],"connectives.":[28],"The":[29,46,102,118,151],"DPLL(T)":[30,50,98],"approach":[31],"to":[32,36,52,120],"SMT":[33,125,141,167],"has":[34],"risen":[35],"prominence":[37],"as":[38,145],"technique":[40],"for":[41,83],"solving":[42],"these":[43],"quantifier-free":[44],"problems.":[45],"key":[47],"idea":[48],"closely":[53],"couple":[54],"unit":[55],"propagation":[56,66],"propositional":[59],"part":[60],"component.":[70],"In":[71],"this":[72,85,121],"paper":[73],"it":[74],"demonstrated":[76],"how":[77],"reification":[78],"provides":[79],"natural":[81],"way":[82],"orchestrating":[84],"setting":[88],"logic":[90],"programming.":[91],"This":[92],"allows":[93],"an":[94,124],"elegant":[95],"implementation":[96],"solvers":[99],"Prolog.":[101],"work":[103],"motivated":[105],"by":[106],"reverse":[110],"engineering,":[111],"that":[112,131],"type":[114,159],"recovery":[115,160],"binaries.":[117],"solution":[119],"requires":[123],"solver":[126,152,168],"where":[127],"rational-tree":[133],"not":[137],"supported":[138],"off-the-shelf":[140],"solvers,":[142],"but":[143],"realised":[144],"unification":[146],"many":[148],"Prolog":[149],"systems.":[150],"benchmarked":[154],"against":[155,164],"number":[157],"problems,":[161],"and":[162],"compared":[163],"lazy-basic":[166],"built":[169],"on":[170],"PicoSAT.":[171]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}