{"id":"https://openalex.org/W2963869083","doi":"https://doi.org/10.1017/s1471068416000223","title":"Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)","display_name":"Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2963869083","doi":"https://doi.org/10.1017/s1471068416000223","mag":"2963869083"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000223","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,"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,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5085662277","display_name":"Michael Frank","orcid":"https://orcid.org/0000-0001-8972-2154"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Frank","raw_affiliation_string":"Ben\u2010Gurion University of the Negev","raw_affiliation_strings":["Ben\u2010Gurion University of the Negev"]},{"author_position":"last","author":{"id":"https://openalex.org/A5063747415","display_name":"Michael Codish","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Codish","raw_affiliation_string":"Ben\u2010Gurion University of the Negev","raw_affiliation_strings":["Ben\u2010Gurion University of the Negev"]}],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"cited_by_percentile_year":{"min":78,"max":81},"biblio":{"volume":"16","issue":"5-6","first_page":"688","last_page":"702"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Program Analysis and Verification Techniques","score":0.9989,"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":"Program Analysis and Verification Techniques","score":0.9989,"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/T11010","display_name":"Logic Programming and Knowledge Representation","score":0.9986,"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 Software Verification and Control","score":0.9975,"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"}}],"keywords":[{"keyword":"integratingnautywith prolog","score":0.6162},{"keyword":"graph automorphism","score":0.5118},{"keyword":"logic","score":0.404}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.9381361},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8146013},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7641045},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7302395},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6911624},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.527708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4842162},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4491333},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.4480798},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12208381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10133189},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C157915830","wikidata":"https://www.wikidata.org/wiki/Q2928001","display_name":"Bubble","level":2,"score":0.0},{"id":"https://openalex.org/C129307140","wikidata":"https://www.wikidata.org/wiki/Q6795880","display_name":"Maximum bubble pressure method","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000223","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,"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,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1972567131","https://openalex.org/W1990600049","https://openalex.org/W2027876313","https://openalex.org/W2119027206","https://openalex.org/W2121142598","https://openalex.org/W2208979138","https://openalex.org/W2257609876","https://openalex.org/W2409645877","https://openalex.org/W2911601159","https://openalex.org/W3102811762","https://openalex.org/W4255952705"],"related_works":["https://openalex.org/W1596719193","https://openalex.org/W2365168741","https://openalex.org/W1591583250","https://openalex.org/W1591778271","https://openalex.org/W2510050445","https://openalex.org/W2525470665","https://openalex.org/W2963869083","https://openalex.org/W1999702466","https://openalex.org/W1481700938","https://openalex.org/W2741053223"],"ngrams_url":"https://api.openalex.org/works/W2963869083/ngrams","abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"the":[4,11,16,23,26,42,55,98],"pl-nauty":[5,80],"library,":[6],"a":[7,94,115,120],"Prolog":[8,21,95],"interface":[9,83],"to":[10,20,44,129],"nauty":[12,19,58,85,102],"graph-automorphism":[13],"tool.":[14],"Adding":[15],"capabilities":[17],"of":[18,25,57,77,101,122],"combines":[22],"strength":[24],"\u201cgenerate":[27],"and":[28,38,91],"prune\u201d":[29],"approach":[30],"that":[31,127],"is":[32,112],"commonly":[33],"used":[34],"in":[35,59],"logic":[36],"programming":[37],"constraint":[39],"solving,":[40],"with":[41,89,107],"ability":[43],"reduce":[45],"symmetries":[46],"while":[47],"reasoning":[48],"over":[49],"graph":[50],"objects.":[51],"Moreover,":[52],"it":[53],"enables":[54],"integration":[56],"existing":[60],"tool-chains,":[61],"such":[62],"as":[63,114],"SAT-solvers":[64],"or":[65],"finite":[66],"domain":[67],"constraints":[68],"compilers":[69],"which":[70],"exist":[71],"for":[72],"Prolog.":[73,108],"The":[74,109],"implementation":[75],"consists":[76],"two":[78,126],"components:":[79],",":[81,93,103,106],"an":[82],"connecting":[84],"'s":[86],"C":[87],"library":[88],"Prolog,":[90],"pl-gtools":[92],"framework":[96],"integrating":[97],"software":[99],"component":[100],"called":[104],"gtools":[105],"complete":[110],"tool":[111],"available":[113],"SWI-Prolog":[116],"module.":[117],"We":[118],"provide":[119],"series":[121],"usage":[123],"examples":[124],"including":[125],"apply":[128],"generate":[130],"Ramsey":[131],"graphs.":[132]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2963869083","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2024-03-02T14:03:30.654962","created_date":"2019-07-30"}