Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Robert Saxon Milnikel
@article{DBLP:journals/apal/Milnikel14, author = {Robert Saxon Milnikel}, title = {The Logic of Uncertain Justifications}, journal = {Ann. Pure Appl. Log.}, volume = {165}, number = {1}, pages = {305--315}, year = {2014}, url = {https://doi.org/10.1016/j.apal.2013.07.015}, doi = {10.1016/J.APAL.2013.07.015}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Milnikel14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Milnikel12, author = {Robert Saxon Milnikel}, title = {Conservativity for logics of justified belief: Two approaches}, journal = {Ann. Pure Appl. Log.}, volume = {163}, number = {7}, pages = {809--819}, year = {2012}, url = {https://doi.org/10.1016/j.apal.2011.09.015}, doi = {10.1016/J.APAL.2011.09.015}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Milnikel12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lfcs/Milnikel09, author = {Robert Saxon Milnikel}, editor = {Sergei N. Art{\"{e}}mov and Anil Nerode}, title = {Conservativity for Logics of Justified Belief}, booktitle = {Logical Foundations of Computer Science, International Symposium, {LFCS} 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5407}, pages = {354--364}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-540-92687-0\_24}, doi = {10.1007/978-3-540-92687-0\_24}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/lfcs/Milnikel09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Milnikel07, author = {Robert Saxon Milnikel}, title = {Derivability in certain subsystems of the Logic of Proofs is Pi\({}_{\mbox{2}}\)\({}^{\mbox{p}}\)-complete}, journal = {Ann. Pure Appl. Log.}, volume = {145}, number = {3}, pages = {223--239}, year = {2007}, url = {https://doi.org/10.1016/j.apal.2006.03.001}, doi = {10.1016/J.APAL.2006.03.001}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Milnikel07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/Milnikel05, author = {Robert Saxon Milnikel}, title = {Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics}, journal = {Ann. Math. Artif. Intell.}, volume = {44}, number = {1-2}, pages = {1--34}, year = {2005}, url = {https://doi.org/10.1007/s10472-005-1808-3}, doi = {10.1007/S10472-005-1808-3}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/Milnikel05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nmr/Milnikel04, author = {Robert Saxon Milnikel}, editor = {James P. Delgrande and Torsten Schaub}, title = {A sequent calculus for skeptical reasoning in autopeistemic logic}, booktitle = {10th International Workshop on Non-Monotonic Reasoning {(NMR} 2004), Whistler, Canada, June 6-8, 2004, Proceedings}, pages = {292--296}, year = {2004}, url = {http://www.pims.math.ca/science/2004/NMR/papers/paper38.pdf}, timestamp = {Mon, 21 Jun 2004 10:11:59 +0200}, biburl = {https://dblp.org/rec/conf/nmr/Milnikel04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/Milnikel03, author = {Robert Saxon Milnikel}, title = {The complexity of predicate default logic over a countable domain}, journal = {Ann. Pure Appl. Log.}, volume = {120}, number = {1-3}, pages = {151--163}, year = {2003}, url = {https://doi.org/10.1016/S0168-0072(02)00064-7}, doi = {10.1016/S0168-0072(02)00064-7}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/Milnikel03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sLogica/Milnikel03, author = {Robert Saxon Milnikel}, title = {Embedding Modal Nonmonotonic Logics into Default Logic}, journal = {Stud Logica}, volume = {75}, number = {3}, pages = {377--382}, year = {2003}, url = {https://doi.org/10.1023/B:STUD.0000009566.83940.4f}, doi = {10.1023/B:STUD.0000009566.83940.4F}, timestamp = {Tue, 01 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sLogica/Milnikel03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ecsqaru/Milnikel03, author = {Robert Saxon Milnikel}, editor = {Thomas D. Nielsen and Nevin Lianwen Zhang}, title = {A Sequent Calculus for Skeptical Reasoning in Predicate Default Logic (Extended Abstract)}, booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 7th European Conference, {ECSQARU} 2003, Aalborg, Denmark, July 2-5, 2003. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2711}, pages = {564--575}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45062-7\_46}, doi = {10.1007/978-3-540-45062-7\_46}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/ecsqaru/Milnikel03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Milnikel01, author = {Robert Saxon Milnikel}, title = {Skeptical Reasoning in FC-Normal Logic Programs is P11-complete}, journal = {Fundam. Informaticae}, volume = {45}, number = {3}, pages = {237--252}, year = {2001}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi45-3-07}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Milnikel01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.