Hilbertian Deductive Systems, Infon Logic, and Datalog
暂无分享,去创建一个
[1] Yuri Gurevich,et al. Logic of infons: The propositional case , 2011, TOCL.
[2] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.
[3] Nikolaj Bjørner,et al. From Primal Infon Logic with Individual Variables to Datalog , 2012, Correct Reasoning.
[4] EiterThomas,et al. Complexity and expressive power of logic programming , 2001 .
[5] Michel Minoux,et al. LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation , 1988, Inf. Process. Lett..
[6] Alon Itai,et al. Unification as a Complexity Measure for Logic Programming , 1987, J. Log. Program..
[7] Andreas Blass,et al. Evidential Authorization , 2010, The Future of Software Engineering.
[8] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[9] G. Mints. A Short Introduction to Intuitionistic Logic , 2000 .
[10] Yuri Gurevich. Two notes on propositional primal logic , 2011 .
[11] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..