Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars
暂无分享,去创建一个
[1] Victor W. Marek,et al. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning , 2000 .
[2] Zoltán Ésik,et al. A fixed point theorem for non-monotonic functions , 2014, Theor. Comput. Sci..
[3] Panos Rondogiannis,et al. Well-founded semantics for Boolean grammars , 2009, Inf. Comput..
[4] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[5] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[6] Alexander Okhotin. Boolean grammars , 2004, Inf. Comput..
[7] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[8] Zoltán Ésik,et al. Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation , 2014, Theory Pract. Log. Program..
[9] Victor W. Marek,et al. Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..
[10] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[11] William W. Wadge,et al. Minimum model semantics for logic programs with negation-as-failure , 2003, TOCL.