{"id":"https://openalex.org/W2004683093","doi":"https://doi.org/10.1145/130385.130399","title":"PAC-learnability of determinate logic programs","display_name":"PAC-learnability of determinate logic programs","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W2004683093","doi":"https://doi.org/10.1145/130385.130399","mag":"2004683093"},"language":"en","primary_location":{"id":"doi:10.1145/130385.130399","doi":"https://doi.org/10.1145/130385.130399","is_oa":true,"landing_page_url":"https://doi.org/10.1145/130385.130399","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/130385.130399","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fifth annual workshop on Computational learning theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/130385.130399","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064609702","display_name":"Sa\u0161o D\u017eeroski","orcid":"https://orcid.org/0000-0003-2363-712X","observed_orcids":["https://orcid.org/0000-0003-2363-712X"]},"institutions":[{"id":"https://openalex.org/I125680101","display_name":"Turing Institute","ror":"https://ror.org/02x2mw849","country_code":"GB","type":"facility","lineage":["https://openalex.org/I125680101"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sa\u0161o D\u017eeroski","raw_affiliation_strings":["The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","institution_ids":["https://openalex.org/I125680101"]},{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#","institution_ids":["https://openalex.org/I125680101"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076917665","display_name":"Stephen Muggleton","orcid":"https://orcid.org/0000-0001-6061-6104","observed_orcids":["https://orcid.org/0000-0001-6061-6104"]},"institutions":[{"id":"https://openalex.org/I125680101","display_name":"Turing Institute","ror":"https://ror.org/02x2mw849","country_code":"GB","type":"facility","lineage":["https://openalex.org/I125680101"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stephen Muggleton","raw_affiliation_strings":["The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","institution_ids":["https://openalex.org/I125680101"]},{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#","institution_ids":["https://openalex.org/I125680101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007305440","display_name":"Stuart Russell","orcid":"https://orcid.org/0000-0001-5252-4306","observed_orcids":["https://orcid.org/0000-0001-5252-4306"]},"institutions":[{"id":"https://openalex.org/I125680101","display_name":"Turing Institute","ror":"https://ror.org/02x2mw849","country_code":"GB","type":"facility","lineage":["https://openalex.org/I125680101"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stuart Russell","raw_affiliation_strings":["The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK","institution_ids":["https://openalex.org/I125680101"]},{"raw_affiliation_string":"The Turing Institute Limited, 36 North Hanover Street, Glasgow G1 2AD, Scotland, UK#TAB#","institution_ids":["https://openalex.org/I125680101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I125680101"],"apc_list":null,"apc_paid":null,"fwci":17.6691,"has_fulltext":true,"cited_by_count":118,"citation_normalized_percentile":{"value":0.997815,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.82669997215271,"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.82669997215271,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.05350000038743019,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.039400000125169754,"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/inductive-logic-programming","display_name":"inductive logic programming","score":0.9480000138282776},{"id":"https://openalex.org/keywords/pac-learnability","display_name":"PAC learnability","score":0.7440000176429749},{"id":"https://openalex.org/keywords/horn-clauses","display_name":"Horn clauses","score":0.8420000076293945},{"id":"https://openalex.org/keywords/syntactic-constraints","display_name":"syntactic constraints","score":0.6549999713897705},{"id":"https://openalex.org/keywords/membership-queries","display_name":"membership queries","score":0.8849999904632568}],"concepts":[{"id":"https://openalex.org/C2777723229","wikidata":"https://www.wikidata.org/wiki/Q4367921","display_name":"Learnability","level":2,"score":0.8869396448135376},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.6842296123504639},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.6454102396965027},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5063844919204712},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.4828908443450928},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4733276963233948},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4620591402053833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46064168214797974},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4480670392513275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4450320303440094},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4191352128982544},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.4176715612411499},{"id":"https://openalex.org/C97169998","wikidata":"https://www.wikidata.org/wiki/Q1582738","display_name":"Definite clause grammar","level":5,"score":0.4154953360557556},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3950749337673187},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3862141966819763},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3679977059364319},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26676058769226074},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.2209787666797638},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.1610179841518402},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.15527638792991638},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0873873233795166},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/130385.130399","doi":"https://doi.org/10.1145/130385.130399","is_oa":true,"landing_page_url":"https://doi.org/10.1145/130385.130399","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/130385.130399","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fifth annual workshop on Computational learning theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.2693","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.2693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.york.ac.uk/pub/ML_GROUP/Papers/colt92.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/130385.130399","doi":"https://doi.org/10.1145/130385.130399","is_oa":true,"landing_page_url":"https://doi.org/10.1145/130385.130399","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/130385.130399","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fifth annual workshop on Computational learning theory","raw_type":"proceedings-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Quality education","id":"https://metadata.un.org/sdg/4","score":0.7400000095367432}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004683093.pdf","grobid_xml":"https://content.openalex.org/works/W2004683093.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W31561947","https://openalex.org/W1506152736","https://openalex.org/W1514468887","https://openalex.org/W1536794365","https://openalex.org/W1541434994","https://openalex.org/W1562138751","https://openalex.org/W1565236324","https://openalex.org/W1910499920","https://openalex.org/W1982500696","https://openalex.org/W1990217074","https://openalex.org/W1994022788","https://openalex.org/W1999138184","https://openalex.org/W2019363670","https://openalex.org/W2093252035","https://openalex.org/W2116247345","https://openalex.org/W2428981601","https://openalex.org/W2484153108","https://openalex.org/W2520858206","https://openalex.org/W4206370914","https://openalex.org/W4238893454"],"related_works":["https://openalex.org/W148982944","https://openalex.org/W2009605580","https://openalex.org/W1558569658","https://openalex.org/W1840908421","https://openalex.org/W2149404336","https://openalex.org/W2295316444","https://openalex.org/W4232219978","https://openalex.org/W1608240409","https://openalex.org/W2080672497","https://openalex.org/W2462706391"],"abstract_inverted_index":{"The":[0],"field":[1],"of":[2,18,50,54,71,79],"Inductive":[3],"Logic":[4],"Programming":[5],"(ILP)":[6],"is":[7],"concerned":[8],"with":[9,77],"inducing":[10],"logic":[11,55],"programs":[12],"from":[13],"examples":[14],"in":[15],"the":[16,24,29,48,106],"presence":[17],"background":[19],"knowledge.":[20],"This":[21],"paper":[22],"defines":[23],"ILP":[25],"problem,":[26],"and":[27,102],"describes":[28],"various":[30],"syntactic":[31],"restrictions":[32],"that":[33],"are":[34,82,92],"commonly":[35],"used":[36],"for":[37],"learning":[38,63],"first-order":[39],"representations.":[40],"We":[41],"then":[42],"derive":[43],"some":[44],"positive":[45],"results":[46],"concerning":[47],"learnability":[49],"these":[51],"restricted":[52],"classes":[53],"programs,":[56],"by":[57],"reduction":[58],"to":[59],"a":[60],"standard":[61],"propositional":[62],"problem.":[64],"More":[65],"specifically,":[66],"k-clause":[67,90],"predicate":[68],"definitions":[69,91],"consisting":[70],"determinate,":[72],"function-free,":[73],"non-recursve":[74],"Horn":[75],"clauses":[76],"variables":[78],"bounded":[80],"depth":[81],"polynomially":[83,93],"learnable":[84,94],"under":[85,95],"simple":[86,96],"distributions.":[87],"Similarly,":[88],"recursive":[89],"distributions":[97],"if":[98],"we":[99],"allow":[100],"existential":[101],"membership":[103],"queries":[104],"about":[105],"target":[107],"concept.":[108]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}