'Knowing Whether' in Proper Epistemic Knowledge Bases. Miller, T., Muise, C., Felli, P., Pearce, A. R., & Sonenberg, L. In The 30th AAAI Conference on Artificial Intelligence, 2016. Paper abstract bibtex Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time, and is complete for a large set of arbitrary formulae in logics Kn and KDn. In this paper, we extend PEKBs to deal with a restricted form of disjunction: ‘knowing whether’. An agent i knows whether ϕ iff agent i knows ϕ or knows ¬ϕ; that is, iϕ ∨ i¬ϕ. In our experience, the ability to represent that an agent knows whether something holds is useful in many multi-agent domains. We represent knowing whether with a modal operator, ∆i, and present sound polynomial-time entailment algorithms on PEKBs with ∆i in Kn and KDn, but which are complete for a smaller class of queries than standard PEKBs.
@inproceedings{miller-aaai-16,
author = {Tim Miller and Christian Muise and Paolo Felli and Adrian R. Pearce and Liz Sonenberg},
year = {2016},
booktitle = {The 30th AAAI Conference on Artificial Intelligence},
keywords = {multi-agent planning, epistemic reasoning},
url = {http://www.haz.ca/papers/miller-aaai-16.pdf},
title = {'Knowing Whether' in Proper Epistemic Knowledge Bases},
abstract = {Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time, and is complete for a large set of arbitrary formulae in logics Kn and KDn. In this paper, we extend PEKBs to deal with a restricted form of disjunction: ‘knowing whether’. An agent i knows whether ϕ iff agent i knows ϕ or knows ¬ϕ; that is, iϕ ∨ i¬ϕ. In our experience, the ability to represent that an agent knows whether something holds is useful in many multi-agent domains. We represent knowing whether with a modal operator, ∆i, and present sound polynomial-time entailment algorithms on PEKBs with ∆i in Kn and KDn, but which are complete for a smaller class of queries than standard PEKBs.}
}
Downloads: 0
{"_id":"qJt6AXNMmHoo9deLx","bibbaseid":"miller-muise-felli-pearce-sonenberg-knowingwhetherinproperepistemicknowledgebases-2016","downloads":3,"creationDate":"2015-12-31T02:41:12.925Z","title":"'Knowing Whether' in Proper Epistemic Knowledge Bases","author_short":["Miller, T.","Muise, C.","Felli, P.","Pearce, A. R.","Sonenberg, L."],"year":2016,"bibtype":"inproceedings","biburl":"www.haz.ca/publications.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Tim"],"propositions":[],"lastnames":["Miller"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Muise"],"suffixes":[]},{"firstnames":["Paolo"],"propositions":[],"lastnames":["Felli"],"suffixes":[]},{"firstnames":["Adrian","R."],"propositions":[],"lastnames":["Pearce"],"suffixes":[]},{"firstnames":["Liz"],"propositions":[],"lastnames":["Sonenberg"],"suffixes":[]}],"year":"2016","booktitle":"The 30th AAAI Conference on Artificial Intelligence","keywords":"multi-agent planning, epistemic reasoning","url":"http://www.haz.ca/papers/miller-aaai-16.pdf","title":"'Knowing Whether' in Proper Epistemic Knowledge Bases","abstract":"Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time, and is complete for a large set of arbitrary formulae in logics Kn and KDn. In this paper, we extend PEKBs to deal with a restricted form of disjunction: ‘knowing whether’. An agent i knows whether ϕ iff agent i knows ϕ or knows ¬ϕ; that is, iϕ ∨ i¬ϕ. In our experience, the ability to represent that an agent knows whether something holds is useful in many multi-agent domains. We represent knowing whether with a modal operator, ∆i, and present sound polynomial-time entailment algorithms on PEKBs with ∆i in Kn and KDn, but which are complete for a smaller class of queries than standard PEKBs.","bibtex":"@inproceedings{miller-aaai-16,\n author = {Tim Miller and Christian Muise and Paolo Felli and Adrian R. Pearce and Liz Sonenberg},\n year = {2016},\n booktitle = {The 30th AAAI Conference on Artificial Intelligence},\n keywords = {multi-agent planning, epistemic reasoning},\n url = {http://www.haz.ca/papers/miller-aaai-16.pdf},\n title = {'Knowing Whether' in Proper Epistemic Knowledge Bases},\n abstract = {Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time, and is complete for a large set of arbitrary formulae in logics Kn and KDn. In this paper, we extend PEKBs to deal with a restricted form of disjunction: ‘knowing whether’. An agent i knows whether ϕ iff agent i knows ϕ or knows ¬ϕ; that is, iϕ ∨ i¬ϕ. In our experience, the ability to represent that an agent knows whether something holds is useful in many multi-agent domains. We represent knowing whether with a modal operator, ∆i, and present sound polynomial-time entailment algorithms on PEKBs with ∆i in Kn and KDn, but which are complete for a smaller class of queries than standard PEKBs.}\n}\n\n","author_short":["Miller, T.","Muise, C.","Felli, P.","Pearce, A. R.","Sonenberg, L."],"key":"miller-aaai-16","id":"miller-aaai-16","bibbaseid":"miller-muise-felli-pearce-sonenberg-knowingwhetherinproperepistemicknowledgebases-2016","role":"author","urls":{"Paper":"http://www.haz.ca/papers/miller-aaai-16.pdf"},"keyword":["multi-agent planning","epistemic reasoning"],"metadata":{"authorlinks":{"muise, c":"https://www.haz.ca/academic-publications.html"}}},"search_terms":["knowing","whether","proper","epistemic","knowledge","bases","miller","muise","felli","pearce","sonenberg"],"keywords":["multi-agent planning","epistemic reasoning"],"authorIDs":["3ZsuB8kFuBazYSYay","3aQBFJkJYCcndwCjR","3hYo439g2MuAaCX6e","4QhCAt6rJiarXgGTG","5456f48b8b01c819300000ab","5de6d3d8abd988de010000ca","5deb0462a31587de010000a3","5df13ef7630a9ee0010000b3","5df52514ea1457de01000126","5df7e072dc100cde0100014e","5dfaab875481b4de0100001d","5dfe6b5e4e3a44de0100001f","5dff511bddf837de01000075","5e03673eb1544ef201000082","5e044e70705486df010000b8","5e0602f7e95bcdde0100005b","5e0623ba8e1565f2010000cf","5e12ae713f181ade01000085","5e136ddaf16095df0100010c","5e15ebbcefa1cddf0100005f","5e16303adf1bb4de01000195","5e175171883585df010001f5","5e185337809b84f20100000a","5e194fb886b4aade010000f1","5e1c6302e556c6de010001e8","5e1d8ada3a6d8cde0100011c","5e1dc2b98d71ddde010000f2","5e1eadd6bedb58de01000124","5e1f7406e8f5ddde01000229","5e2093efbdda1fde0100003c","5e21b52196aea7de010000a0","5e270f9cf51e02de0100005a","5e27b36b28f7a6de01000151","5e2dae33732e89de0100005c","5e2e0116524f94de0100005d","5e2ea3edb84405df01000035","5e3081b4cb949bdf01000044","5e3627ac1727e7df010000c2","5e3874ed1f8af9e001000122","5e3b054855f0f2df0100017f","5e3c5333c798e0de01000129","5e3ec74c86a596de0100000b","5e3ffc1d17f17dde01000002","5e3ffd7017f17dde01000014","5e41b0910b4861de01000111","5e441c71fdc393de01000118","5e446fd5084293df010000fd","5e44bf6a7759a7df0100007c","5e4628077f6322df01000042","5e4c5496271596df010000c6","5e4c93785cc521f2010000e0","5e4ea00e64b624de01000072","5e4f7499a01931de010000b6","5e503b938c3a2cde0100013d","5e535d7e45815bf20100006c","5e53f9acd26e87df010001df","5e556ca4e11ab9df01000032","5e56d52696127bde0100020e","5e5d6d8b0b73f6de01000003","5e5eab682fd1fade010000e2","5e66fa7685689bf30100010e","5e670701511133df0100006d","5e68f51f1a389bdf0100045c","5yN3GPwHiapRhtuj9","6C5wfAZryB8LaY2PJ","6Z2RfBdBMBFMMobst","6jNNJBuk6HAtcnEvy","7AuroeLTMFPfJCoc5","8j3GdPnZ34L7MwaRH","BELXag98NmsXoYgsH","CeALjMgBHZmr9SzLQ","D7u3CRvfQdZb2Nsvb","DTvS4QdpaPswfTdKK","Dcjwdot9d5rJFoLNW","EZxoX4JE4byz9dLBS","FE3yhyj5fmmfLuJXZ","FTTuMEgm3yh9QH7pw","GQWTrxJz3HKdJcAEM","GfiiL4m6PWnSrb5pM","HwSBgNFgx9YdcbTkD","J9Cn8pzsqP9mpr6xy","JJ4YdoB6PqRk2mbBH","JjhEWvgeq8Qx6LZof","Jw793vyTqsyX5daKz","KZfCyiyswf4sBtGjP","KgBg49s7JcYbLSctC","KpA6noWknYigzPP4i","MroboN368do5mezgH","NAb7GKwczGhpSRtaE","NAyJtGS6K2wBWJMx2","NBcXbcFrQdwCtndaF","PFRbwQewWEdMfk4Mk","PZYJkWyWoKeykNsHr","QvNgkQwXWMDTxciYq","QwjvvLtMervWzsLig","SLJpkXgMzHPLEP33v","TcNBkSpMyeu2oxw5A","WAx35JxHCScRCfQYK","WMHiPYnuEnrhKxJWi","WiXjNSHmtpmkHsPYF","XDyEccztzCgSrH8JK","YYXt22tWnAnS4ohf4","Yo9NwQNbXRfSjd5LR","Zpzs3SDfCjG7mJAEC","ZysMM8RRSrhEZt4rm","a7KzaH4ok4HAJxnyP","axB6kamRvmWu5vw6X","b6ZAdn6ZpgQcDuejh","bNHECCPaQAsthaP2z","cavuN3YH45oms9mKy","cgdaZmm5NDtBmBJcL","crArqS5DKyENjHyEF","dJyb7wbihKdDzgkGr","emJa7LZmACzm5bbpv","esY7FSKsHpLphjhKg","f4LpZ8LcDrvDyGuip","g2oQsrCb47Nfxjnes","goA6xywLeZi8P9Z3N","grCkvcC8cTZqJzGKu","hfmvhLcJ6rSarhyHM","htW24MBmx67vY4Dky","j6foRqya6fLiniZC3","jBLcydKWE5xxJKofs","jtKbSfonQ5YmGvpfh","jvXSefynz5Ba7gqX2","kYGNCbRdzB9CHBr5s","karY5HSFumjds5vuz","mwfq6DupsNxXZhwFK","n8ip3yxvw6k38QpZL","nhPAKwaJ3yD2ihuqD","o39uWBuFedviW43Cw","ow6c7LGcrn2X6iWQd","qwPzsaveEtEvDqBPs","rhiD5xJXuoWPMReit","rkDRNeSmuJeNswCfv","sYAXaopmi2wx9uPsF","tMexbXp8PoEkbZnrv","uHSZiLRwEgNpbmmRw","wfhA6qG7fcni6LQuw","wsyXZn5iRF2dciL8t","xTKWRxJPtd5N9aKTq","yEypGxYJaM52ipscR","zSHM8azk4tdTPDvou","zzk9ihDtxJrpejbzN"],"dataSources":["94txRcb2YKX3ChmqR","DprwGzu9heN5GXy3u"]}