{"id":"https://openalex.org/W3046698219","doi":"https://doi.org/10.1145/3382734.3405734","title":"Probably Approximately Knowing","display_name":"Probably Approximately Knowing","publication_year":2020,"publication_date":"2020-07-31","ids":{"openalex":"https://openalex.org/W3046698219","doi":"https://doi.org/10.1145/3382734.3405734","mag":"3046698219"},"language":"en","primary_location":{"id":"doi:10.1145/3382734.3405734","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","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/A5005055897","display_name":"Yoram Moses","orcid":"https://orcid.org/0000-0001-5549-1781"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yoram Moses","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091560497","display_name":"Nitzan Zamir","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nitzan Zamir","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005055897"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12446278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"375","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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/T10237","display_name":"Cryptography and Data Security","score":0.9945999979972839,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9908000230789185,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.9405193328857422},{"id":"https://openalex.org/keywords/probabilistic-argumentation","display_name":"Probabilistic argumentation","score":0.7121495008468628},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7089864611625671},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5488052368164062},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.42874860763549805},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.42399224638938904},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3784799575805664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35551396012306213},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.3529534935951233},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3455813527107239},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17269086837768555}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.9405193328857422},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.7121495008468628},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7089864611625671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5488052368164062},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.42874860763549805},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.42399224638938904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3784799575805664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35551396012306213},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3529534935951233},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3455813527107239},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17269086837768555},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3382734.3405734","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1596631366","https://openalex.org/W1844529830","https://openalex.org/W1970606468","https://openalex.org/W1973676112","https://openalex.org/W1984727163","https://openalex.org/W1991153938","https://openalex.org/W2010634640","https://openalex.org/W2018908462","https://openalex.org/W2052990370","https://openalex.org/W2061084197","https://openalex.org/W2070427823","https://openalex.org/W2080947580","https://openalex.org/W2100061495","https://openalex.org/W2142874299","https://openalex.org/W2148957455","https://openalex.org/W2150847784","https://openalex.org/W2568091325","https://openalex.org/W2706788079","https://openalex.org/W2738712979","https://openalex.org/W2963738383","https://openalex.org/W3037461512","https://openalex.org/W3140030144","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W3206245021","https://openalex.org/W2371210594","https://openalex.org/W2225666389","https://openalex.org/W4238495367","https://openalex.org/W2749065928","https://openalex.org/W1499367685","https://openalex.org/W2081887084","https://openalex.org/W1855805902","https://openalex.org/W1585439950","https://openalex.org/W2494523064"],"abstract_inverted_index":{"Whereas":[0],"deterministic":[1],"protocols":[2,13],"are":[3],"typically":[4,14],"guaranteed":[5],"to":[6,150],"obtain":[7],"particular":[8],"goals":[9],"of":[10,24,32,60,85,109,126],"interest,":[11],"probabilistic":[12,17,36,43,58,111,142],"provide":[15],"only":[16],"guarantees.":[18],"This":[19],"paper":[20],"initiates":[21],"an":[22,45,86],"investigation":[23],"the":[25,61,82,96,107,110,135,151,166],"interdependence":[26],"between":[27],"actions":[28],"and":[29],"subjective":[30],"beliefs":[31,44],"agents":[33],"in":[34,52,89],"a":[35,53,57,141],"setting.":[37],"In":[38,156],"particular,":[39],"we":[40],"study":[41],"what":[42],"agent":[46,136,167],"should":[47,65,113],"have":[48],"when":[49,72,91,101,134,177],"performing":[50],"actions,":[51],"protocol":[54],"that":[55,81,98,153,173],"satisfies":[56],"constraint":[59,112],"form:":[62],"Condition":[63],"\u03d5":[64,90,99,154,174],"hold":[66,114],"with":[67,115,129],"probability":[68,97,116,130],"at":[69],"least":[70],"p":[71,117],"action":[73],"\u03b1":[74,94,102],"is":[75,80,103,175],"performed.":[76,104],"Our":[77],"main":[78],"result":[79],"expected":[83],"degree":[84],"agent's":[87],"belief":[88,143,161],"it":[92,138,178],"performs":[93],"equals":[95],"holds":[100],"Indeed,":[105],"if":[106],"threshold":[108],"=":[118],"1":[119,131,147],"\u2212":[120,132,148],"\u03b52":[121],"for":[122],"some":[123],"small":[124],"value":[125],"\u03b5":[127,149],"then,":[128],"\u03b5,":[133],"acts":[137],"will":[139],"assign":[140],"no":[144],"smaller":[145],"than":[146],"possibility":[152],"holds.":[155],"other":[157],"words,":[158],"viewing":[159],"strong":[160],"as,":[162],"intuitively,":[163],"approximate":[164],"knowledge,":[165],"must":[168],"Probably":[169],"Approximately":[170],"Know":[171],"(PAK-know)":[172],"true":[176],"acts.":[179]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}