A query answering algorithm for lukaszewicz' general open default theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1126, Issue , 1996, Pages 208-223

  Ciorba, Viorica ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

DEFAULT LOGIC; FREE VARIABLE; GROUNDNESS; OPEN DEFAULTS; PARAMETERIZED; QUERY ANSWERING; REGULARITY PROPERTIES;

COMPUTATION THEORY;

EID: 84955599598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (22)

1. Baader F. & Hollunder B., Embedding defaults into terminological knowledge representation formalism, Proceedings of KR 92, p. 306-317, 1992.
2. Besnard Ph., Quiniou R., Quinton P., A theorem prover for a decidable subset of default logic, Proceedings of AAAI, 1983, p. 27-30.
3. Bibel W., Automated Theorem Proving, Vieweg, 1987.
4. Boï J.M., Innocente E., Rauzy A., Siegel P., Production Fields: a new approach to deduction problems and two algorithms for propositional calculus, Revue d'Intelligence Artificielle, vol. 6, hr. 3, 1992, po 235-253.
5. Brewka G., Cumulative default logics: in defense of non-monotonic inference rules, Artificial Intelligence, vol. 50 (1-2), 1991, p. 183-205.
6. Chang C. & Lee R., Symbolic logic and mechanical theorem proving, Academic Press, 1973.
7. Ciorba V., Une méthode de preuve pour la logique des défauts de Lukaszewicz, Technical report LRI, 1996, to appear.
8. K. Inoue, Linear resolution for consequence finding, Artificial Intelligence, hr. 56, p.301-353, 1992.
9. Junker U. et Konolige K., Computing the extensions of autoepistemic and default logics with a Truth Maintenance System, Proceedings of AAAI, 1990, p. 278-283.
10. L6vy F., Weak extensions for default theories, Proceedings of ECSQARU, 1993, Lecture Notes in Computer Science, hr. 747, p. 233-240.
11. Lukaszewicz W., Considerations on default logic -an alternative approach, Computational Intelligence, vol 4, 1988, p. 1-16.
12. Mengin J., Prioritized conflict resolution for default reasoning, Proceedings of ECAI, 1994, p.376-380.
13. Nicolas P. & Duval B., A theorem prover for Lukaszewicz' Open Default Theory, Proceedings of ECSQARU, 1995, Lecture Notes in Computer Science, hr. 946, p. 311-319.
14. Poole D., Variables in hypotheses, Proceedings of UCAI, 1987, p. 905-908.
15. Poole D., A logical framework for default reasoning, Artificial Intelligence, vol. 36, 1988, p. 27-46.
16. Reiter R., A logic for default reasoning, Artificial Intelligence, vol 13, 1980, p. 81-132.
17. Risch V., Analytic tableaux for default logics, Journal of Applied Non-Classical Logics, vol.6, hr. 1., 1996, p. 71-88.
18. Rychlik P., Some variations on default logic, Proceedings of AAAI, 1991, p. 373-378.
19. Schaub T., On constrained default theories, Proceedings of ECAI, 1992, p. 304-308.
20. Schaub T. A new methodology for query-answering in default logics via structure oriented theorem prover, Journal of Automated Reasoning, vol. 15, hr.1, 1995, p. 95-165.
21. Siegel P., Representation et utilisation de la connaissance en calcul propositionnel, Thése de doctorat d'état en informatique, Université d'Aix-Marseille II, juillet 1987.
22. Thielscher M, On prediction in Theorist, Artificial Intelligence, vol. 60, 1993, p. 283-292.