Analytic tableaux for default logics

Journal of Applied Non-Classical Logics

Volumn 6, Issue 1, 1996, Pages 71-88

  Risch, Vincent ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Default logics; Tableaux

Indexed keywords

EID: 0043128774     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.1080/11663081.1996.10510867     Document Type: Conference Paper

References (23)

1. Baader, Hollunder, Embedding Defaults into Terminological Knowledge Representation Formalisms. Proceedings of KR'92.
2. Besnard P., An Introduction to Default Logic. Springer Verlag.
3. Besnard P., Quiniou R. , Quinton P., A Theorem-Prover for a Decidable Subset of Default Logic. Proceedings of AAAI-83, p. 27-30.
4. Besnard P., Schaub T., Possible Worlds Semantzcs for Default Logics. Working Notes of fourth International Workshop on Nonmonotonic Reasoning, Hawk Inn, Plymouth, Vermont, U.S.A., may 1992, p. 34-40.
5. Brewka G., Cumulative Default Logic: in Defense of Nonmonotonic Inference Rule. Artificial Intelligence, 50, 1991, p. 183-205. (Pubitemid 21707422)
6. Eder E., Relative Complexities of First Order Calculi. Vieweg.
7. Fitting M., First-Order Logic and Automated Theorem Proving. Springer Verlag.
8. Gueirrero R. A., Casanova M. A., Hermely A. S., Contributions to a Proof Theory for Generic Defaults. Proceedings of the 9th European Conference on Artificial Intelligence, ECAI-90, p. 213-218.
9. Gottlob G., Complexity resnlts for nonmonotonic logics. Journal ofLogic and Computation, 2(3), june 1992, p. 397-425.
10. Junker U., Prioritized Defanlts: Implementation by TMS and Application to Diagnosis. Proceedings of IJCAI-91, Melbourne, Australie.
11. Junker U., Brewka G., Handling Partially Ordered Defanlts in TMS. Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France. Siegel, Kruse (Eds). Lecture Notes in Computer Science 548, Springer Verlag, p. 211-218.
12. Junker U., Konolige K., Computing the Extensions of A utoepistemic and Default Logics with a Truth Maintenance System. Proceedings of AAAI-90, Boston, Massachuset, USA, p. 278-283.
13. Levy F., Computing Extensions of Default Theories. Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France. Siegel, Kruse (Eds). Lecture Notes in Computer Science 548, Springer Verlag, p. 211-226.
14. Lukaszewicz W., Considerations on Default Logzc - An Alternative Approach. Computational Intelligence 4, 1988, p. 1-16.
15. Reiter R., A Logic for Default Reasoning. Artificial Intelligence, 13, 1, 1980, p. 81-132.
16. Risch V., Les Tablea1t1: A nalytiques au Service des Logiques de Defauts. PhD thesis, GIA, Faculte des Sciences de Luminy, Universite Aix-Marseille II, France, april 1993.
17. Risch V., Schwind C., Tableau-Based Characterization and Theorem Proving for Default Logic. Journal of Automated Reasoning, Vol 13, No 2, october 1994, p. 223-242.
18. Robinson J. A., A Machine-oriented Logic Based on the Resolution Principle Journal of the ACM, vol. 12, 1965, p. 23-41.
19. Schaub T., On Commitment and Cumulativity in Default Logics. Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, Lecture Notes in Computer Science548, Springer Verlag, p. 305-309.
20. Schwind C., A Tableau-based Theorem Prover for a Decidable Subset of Default Logic. Proceedings of the lOth International Conference on Automated Deduction, CADE 10, Springer Verlag, p. 541-546.
21. Schwind C., Risch V., A Tableau-Based Characterisation for Default Logic. Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, Lecture Notes in Computer Science 548, Springer Verlag, p. 310-317.
22. Smullyan R. M., First-Order Logic. Springer Verlag.
23. Vialard V., Calcul des Modeles en Logique Propositionnelle : Une Approche Hybride. Technical Report, Laboratoire d'lnformatique de Marseille, 1994.