{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:10Z","timestamp":1725558490302},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135286"},{"type":"electronic","value":"9783642135293"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13529-3_35","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T19:01:53Z","timestamp":1277319713000},"page":"327-336","source":"Crossref","is-referenced-by-count":0,"title":["On the Correctness of Rough-Set Based Approximate Reasoning"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Doherty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Sza\u0142as","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W. Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen \u00fcber das eliminationsproblem der mathematischen logik. Mathematische Annalen\u00a0110, 390\u2013413 (1935)","journal-title":"Mathematische Annalen"},{"issue":"1-5","key":"35_CR2","first-page":"1","volume":"2","author":"W. Conradie","year":"2006","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic: I. The core algorithm SQEMA. Logical Methods in Computer Science\u00a02(1-5), 1\u201326 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Doherty, P., Kachniarz, J., Sza\u0142as, A.: Using contextually closed queries for local closed-world reasoning in rough knowledge databases. In: Pal, et al [12]","DOI":"10.1007\/978-3-642-18859-6_9"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Doherty, P., \u0141ukaszewicz, W., Skowron, A., Sza\u0142as, A.: Approximation transducers and trees: A technique for combining rough and crisp knowledge. In: Pal, et al [12]","DOI":"10.1007\/978-3-642-18859-6_8"},{"key":"35_CR5","series-title":"Studies in Fuziness and Soft Computing","volume-title":"Knowledge Representation Techniques. A Rough Set Approach","author":"P. Doherty","year":"2006","unstructured":"Doherty, P., \u0141ukaszewicz, W., Skowron, A., Sza\u0142as, A.: Knowledge Representation Techniques. A Rough Set Approach. Studies in Fuziness and Soft Computing, vol.\u00a0202. Springer, Heidelberg (2006)"},{"issue":"3-4","key":"35_CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.3233\/FI-1996-283404","volume":"28","author":"P. Doherty","year":"1996","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: A reduction result for circumscribed semi-Horn formulas. Fundamenta Informaticae\u00a028(3-4), 261\u2013271 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing circumscription revisited. Journal of Automated Reasoning\u00a018(3), 297\u2013336 (1997)","journal-title":"Journal of Automated Reasoning"},{"issue":"1-2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.3166\/jancl.16.87-117","volume":"16","author":"P. Doherty","year":"2006","unstructured":"Doherty, P., Magnusson, M., Sza\u0142as, A.: Approximate databases: A support tool for approximate reasoning. Journal of Applied Non-Classical Logics\u00a016(1-2), 87\u2013118 (2006); Special issue on Implementation of logics","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"35_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-540-25929-9_16","volume-title":"Rough Sets and Current Trends in Computing","author":"P. Doherty","year":"2004","unstructured":"Doherty, P., Sza\u0142as, A.: On the correspondence between approximations and similarity. In: Tsumoto, S., Slowinski, R., Komorowski, J., Grzymala-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol.\u00a03066, pp. 143\u2013152. Springer, Heidelberg (2004)"},{"key":"35_CR10","unstructured":"Gabbay, D.M., Schmidt, R., Sza\u0142as, A.: Second-Order Quantifier Elimination. In: Foundations, Computational Aspects and Applications. Studies in Logic, vol.\u00a012. College Publications (2008)"},{"issue":"1","key":"35_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0218488500000071","volume":"8","author":"C.-J. Liau","year":"2000","unstructured":"Liau, C.-J.: An overview of rough set semantics for modal and quantifier logics. Int. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems\u00a08(1), 93\u2013118 (2000)","journal-title":"Int. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"volume-title":"Rough-Neuro Computing: Techniques for Computing with Words","year":"2003","key":"35_CR12","unstructured":"Pal, S.K., Polkowski, L., Skowron, A. (eds.): Rough-Neuro Computing: Techniques for Computing with Words. Springer, Heidelberg (2003)"},{"key":"35_CR13","volume-title":"Rough Sets. Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A. Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae\u00a027, 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"35_CR15","unstructured":"S\u0142owi\u0144ski, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations. In: Wang, P. (ed.) Advances in Machine Intelligence & Soft Computing, Raleigh, NC, pp. 17\u201333. Bookwrights (1997)"},{"issue":"2","key":"35_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/69.842271","volume":"12","author":"R. S\u0142owi\u0144ski","year":"2000","unstructured":"S\u0142owi\u0144ski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. on Data and Knowledge Engineering\u00a012(2), 331\u2013336 (2000)","journal-title":"IEEE Trans. on Data and Knowledge Engineering"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13529-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:26Z","timestamp":1606185566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13529-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135286","9783642135293"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13529-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}