An Implementation and Optimization of an Algorithm for Reducing Formulae in Second-Order Logic
暂无分享,去创建一个
[1] W. Ackermann. Untersuchungen über das Eliminationsproblem der mathematischen Logik , 1935 .
[2] Wilhelm Ackermann,et al. Solvable Cases Of The Decision Problem , 1954 .
[3] George Boolos,et al. Computability and logic , 1974 .
[4] John McCarthy,et al. Epistemological Problems of Artificial Intelligence , 1987, IJCAI.
[5] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[6] J.F.A.K. van Benthem,et al. Modal logic and classical logic , 1983 .
[7] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[8] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[9] Vladimir Lifschitz,et al. On the Satisfiability of Circumscription , 1986, Artif. Intell..
[10] Witold Łukaszewicz. Non-monotonic reasoning : formalization of commonsense reasoning , 1990 .
[11] Dov M. Gabbay,et al. Quantifier Elimination in Second-Order Predicate Logic , 1992, KR.
[12] Andrzej Szalas. On the Correspondence between Modal and Classical Logic: An Automated Approach , 1993, J. Log. Comput..
[13] Kurt Konolige,et al. Autoepistemic logic , 1994 .
[14] Vladimir Lifschitz,et al. A Simple Formalization of Actions Using Circumscription , 1995, IJCAI.
[15] Vladimir Lifschitz,et al. Nested Abnormality Theories , 1995, Artif. Intell..
[16] Zhendong Su,et al. Automating the Computation of Nested Abnormality Theories , 1995 .