Reasoning with Finite Set Constraints
暂无分享,去创建一个
[1] Jürg Kohlas,et al. Assumption-Based Modeling Using ABEL , 1997, ECSQARU-FAPR.
[2] James J. Lu. Logic Programming with Signs and Annotations , 1996, J. Log. Comput..
[3] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[4] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[5] Fred B. Schneider,et al. A Logical Approach to Discrete Math , 1993, Texts and Monographs in Computer Science.
[6] Jürg Kohlas,et al. A Mathematical Theory of Hints , 1995 .
[7] Jürg Kohlas,et al. Probabilistic Assumption-Based Reasoning , 1993, UAI.
[8] J. Abraham. An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.
[9] P. Monney,et al. A generalization of the algorithm of Heidtmann to non-monotone formulas , 1996 .
[10] J. Kohlas,et al. A Mathematical Theory of Hints: An Approach to the Dempster-Shafer Theory of Evidence , 1995 .
[11] Reiner Hähnle,et al. Deduction in many-valued logics: a survey , 1997 .
[12] Prakash P. Shenoy,et al. Axioms for probability and belief-function proagation , 1990, UAI.
[13] Klaus D. Heidtmann,et al. Smaller sums of disjoint products by subproduct inversion , 1989 .
[14] Jürg Kohlas,et al. Propositional Information Systems , 1999, J. Log. Comput..
[15] Jürg Kohlas,et al. Model-Based Diagnostics and Probabilistic Assumption-Based Reasoning , 1998, Artif. Intell..
[16] Norbert Eisinger,et al. Deduction systems based on resolution , 1993 .
[17] Neil V. Murray,et al. Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas , 1994, Fundam. Informaticae.
[18] Reiner Hähnle. Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..