{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:45:51Z","timestamp":1742636751187},"reference-count":19,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1093\/logcom\/ext021","type":"journal-article","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:45:15Z","timestamp":1374540315000},"page":"117-141","source":"Crossref","is-referenced-by-count":8,"title":["Basic primal infon logic"],"prefix":"10.1093","volume":"26","author":[{"given":"Carlos","family":"Cotrini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Gurevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,7,22]]},"reference":[{"key":"2016102400372678000_26.1.117.1","unstructured":"Aho A. V. Sethi R. Ullman J. D. Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman; 1986."},{"key":"2016102400372678000_26.1.117.2","unstructured":"Baskar A. Naldurg P. Raghavendra K. R. DKAL \u2014 update. In preparation."},{"key":"2016102400372678000_26.1.117.3","unstructured":"Beklemishev L. Blass A. Gurevich Y. What is the logic of information? In preparation."},{"key":"2016102400372678000_26.1.117.4","first-page":"26","article-title":"Propositional primal logic with disjunction","volume":"22","author":"Beklemishev","year":"2012","journal-title":"Journal of Logic and Computation"},{"key":"2016102400372678000_26.1.117.5","doi-asserted-by":"crossref","unstructured":"Bj\u00f8rner N. de Caso G. Gurevich Y. From primal infon logic with individual variables to datalog. In: Erdem E. , editors. Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz, Vol. 7265, Lecture Notes in Computer Science. Springer; 2012. p. 72-86.","DOI":"10.1007\/978-3-642-30743-0_6"},{"key":"2016102400372678000_26.1.117.6","first-page":"122","article-title":"Hilbertian deductive systems and datalog","volume":"102","author":"Blass","year":"2010","journal-title":"Bulletin of the EATCS"},{"key":"2016102400372678000_26.1.117.7","doi-asserted-by":"crossref","unstructured":"Blass A. Gurevich Y. Moskal M. Neeman I. Evidential authorization. In: Nanz S. , editor. The Future of Software Engineering. Springer; 2011. p. 77-99.","DOI":"10.1007\/978-3-642-15187-3_5"},{"key":"2016102400372678000_26.1.117.8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00183-J"},{"key":"2016102400372678000_26.1.117.9","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. Stein Clifford . Introduction to Algorithms. MIT Press; 1990."},{"key":"2016102400372678000_26.1.117.10","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020312000366"},{"key":"2016102400372678000_26.1.117.11","unstructured":"at CodePlex DKAL . http:\/\/dkal.codeplex.com\/, viewed August 10, 2012."},{"key":"2016102400372678000_26.1.117.12","unstructured":"Fortnow L. Shaving logs with unit cost. http:\/\/blog.computationalcomplexity.org\/2009\/05\/shaving-logs-with-unit-cost.html, seen July 22, 2012."},{"key":"2016102400372678000_26.1.117.13","unstructured":"Gurevich Y. Microsoft Research Technical Report MSR-TR-2011-70. Redmond, WA, USA: Microsoft; 2011 May. Two notes on propositional primal logic. http:\/\/research.microsoft.com\/pubs\/149526\/207.pdf ."},{"key":"2016102400372678000_26.1.117.14","doi-asserted-by":"crossref","unstructured":"Gurevich Y. Neeman I. Proceedings of 2008 IEEE Computer Security Foundations Symposium (CSF 2008). IEEE Computer Society; 2008. DKAL: distributed-knowledge authorization language; p. 149-162.","DOI":"10.1109\/CSF.2008.8"},{"key":"2016102400372678000_26.1.117.15","unstructured":"Gurevich Y. Neeman I. Microsoft Research Technical Report MSR-TR-2009-11. Redmond, WA, USA: Microsoft; 2009 February. DKAL 2 \u2014 a simplified and improved authorization language. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=79528 ."},{"key":"2016102400372678000_26.1.117.16","doi-asserted-by":"crossref","unstructured":"Gurevich Y. Neeman I. ACM Transactions on Computational Logic. Vol. 12. 2011. Logic of infons: the propositional case. article 9, Microsoft Research Technical Report MSR-TR-2011-90. July 2011, corrects an oversight in the published version.","DOI":"10.1145\/1877714.1877715"},{"key":"2016102400372678000_26.1.117.17","doi-asserted-by":"crossref","unstructured":"Gusfield D. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press; 1997. (Reprinted 1999, with corrections).","DOI":"10.1017\/CBO9780511574931"},{"key":"2016102400372678000_26.1.117.18","unstructured":"Sedgewick R. Wayne K. Algorithms. 4th edn. Addison-Wesley Professional; 2011."},{"key":"2016102400372678000_26.1.117.19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90006-9"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/1\/117\/7949333\/ext021.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T23:51:02Z","timestamp":1563493862000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/ext021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,22]]},"references-count":19,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,1,28]]},"published-print":{"date-parts":[[2016,2]]}},"alternative-id":["10.1093\/logcom\/ext021"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/ext021","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,22]]}}}