List of Publications of Teodor C. Przymusinski

As of December 2005

This file contains the complete list of publications as of the above date.

Journal Articles

1. T. Przymusinski, ''Metrizability of inverse images of metric spaces under open, perfect and zero dimensional mappings,'' Colloquium Math, 24, 175-180, 1972.

2. T. Przymusinski, ''Non metrizable inverse images of metric spaces under open, perfect and zero-dimensional mappings,'' Bull. Polon. Acad. Sci., 20, 49-47, 1972.

3. T. Przymusinski, ''A Lindelof space X such that X² is normal, but not paracompact,'' Fundamenta Math, 78, 291-296, 1973.

4. T. Przymusinski, ''On σ-discrete coverings consisting of connected sets,'' Colloquium Math, 27, 237-239, 1973.

5. T. Przymusinski, ''Inverse invariance of metrizability for ordered spaces,'' Colloquium Math, 28, 211-220, 1973.

6. T. Przymusinski, F. D. Tall, ''The undecidability of the existence of a non separable normal Moore space satisfying the countable chain condition,'' Fundamenta Math, 85, 291-294, 1974.

7. T. Przymusinski, ''A note on dimension theory,'' Fundamenta Math, 85, 277-284, 1974.

8. T. Przymusinski, ''A note on collectionwise normality and product spaces,'' Colloquium Math, 33, 66-70, 1975.

9. T. Przymusinski, ''Collectionwise Hausdorf property in product spaces,'' Colloquium Math, 36, 49-56, 1976.

10. T. Przymusinski, ''Extensions of first countable and countable spaces,'' Topology Proceedings, 1, 246-248, 1976.

11. T. Przymusinski, ''Normality and paracompactness in subsets of product spaces,'' Fundamenta Math, 91, 161-165, 1976.

12. K. Alster, T. Przymusinski, ''Normality and Martin's Axiom,'' Fundamenta Math, 71, 123-131, 1976.

13. T. Przymusinski, ''Topological properties of product spaces and the notion of n-cardinality,'' Topology Proceedings, 2, 233-242, 1977.

14. D. Lutzer, T. Przymusinski, E. van Douwen, ''Some extensions of the Tietze-Urysohn Theorem,'' American Math Monthly, 84, 435-441, 1977.

15. T. Przymusinski, ''On the notion of n-cardinality,'' Proceedings American Math. Soc., 69, 333-337, 1978.

16. T. Przymusinski, ''On locally finite coverings,'' Colloquium Math, 38, 187-192, 1978.

17. T. Przymusinski, ''Collectionwise normality and extensions of continuous functions,'' Fundamenta Math, 98, 75-81, 1978.

18. T. Przymusinski, ''Collectionwise normality and absolute retracts,'' Fundamenta Math, 98, 61-73, 1978.

19. T. Przymusinski, ''Normality and paracompactness in finite and countable Cartesian products,'' Fundamenta Math, 105, 9-26, 1979.

20. T. Przymusinski, ''On the dimension of product spaces and the example of M. Wage,'' Proceedings American Math. Soc, 76, 315-321, 1979.

21. T. Przymusinski, E. van Douwen, ''Separable extensions of first countable spaces,'' Fundamenta Math, 105, 68-80, 1979.

22. T. Przymusinski, E. van Douwen, ''First countable and countable spaces all compactifications of which contain β N,'' Fundamenta Math, 102, 229-234, 1979.

23. D. Lutzer, T. Przymusinski, ''Continuous extenders in normal and collectionwise normal spaces,'' Fundamenta Math, 102, 165-171, 1979.

24. T. Przymusinski, ''The existence of Q-sets is equivalent to the existence of strong Q-sets,'' Proceedings American Math. Soc., 79, 626-628, 1980.

25. T. Przymusinski, ''Products of perfectly normal spaces,'' Fundamenta Math, 108, 129-136, 1980.

26. T. Przymusinski, M. Wage, ''Collectionwise normality and extensions of locally finite coverings,'' Fundamenta Math, 109, 175-187, 1980.

27. T. Przymusinski, ''Normality and paracompactness of Pixley Roy hyperspaces,'' Fundamenta Math, 113, 201-219, 1981.

28. T. Przymusinski, ''A note on Martin's Axiom and perfect spaces,'' Colloquium Math, 49, 209-215, 1981.

29. T. Przymusinski, J. van Mill, ''There is no compactification theorem for the small inductive dimension,'' Topology and its Applications, 13, 133-136, 1982.

30. T. Przymusinski, ''Perfectly normal compact spaces are continuous images of β-N,'' Proceedings American Math. Soc., 86, 541--544, 1982.

31. T. Przymusinski, ''Extending functions from products with a metric factor and absolutes,'' Pacific Journal of Mathematics, 101, 463-475, 1982.

32. T. Przymusinski, ''A solution to a problem of E. Michael,'' Pacific Journal of Mathematics, 114, 235-242, 1984.

33. K. Chiba, T. Przymusinski, M. E. Rudin, ''Normality of product spaces and Morita's Conjectures,'' Topology and its Applications, 22, 19-32, 1986.

34. T. Przymusinski, V.K. Srinivasan, ''Reflexive algebras and σ algebras,'' International Journal of Mathematics, 9, (4), 811-816, 1986.

35. M. Gelfond, H. Przymusinska, T. Przymusinski, ''On the relationship between circumscription and negation as failure,'' Artificial Intelligence Journal, 38, 75-94, 1989.

36. T. Przymusinski, ''An algorithm to compute circumscription,'' Artificial Intelligence Journal, 38, 49-73, 1989.

37. T. Przymusinski, ''On the declarative and procedural semantics of logic programs,'' Journal of Automated Reasoning, 5, 167-205, 1989.

38. M. Gelfond, H. Przymusinska, T. Przymusinski, ''On the relationship between CWA, minimal model and minimal herbrand model semantics,'' Special Issue of the International Journal of Intelligent Systems on Non Monotonic Reasoning, 5, M. Leash(ed.), 549-564, 1990.

39. H. Przymusinska, T. Przymusinski, ''Weakly stratified logic programs,'' Special Issue of Fundamenta Informaticae on Logical Foundations of AI, 13, K. Apt (ed.), 51-65, 1990.

40. T. Przymusinski, ''The well founded semantics coincides with the three valued stable semantics,'' Special Issue of Fundamenta Informaticae on Non Monotonic Reasoning, 13, (4), W. Marek (ed.), 445-464, 1990.

41. T. Przymusinski, ''Stable semantics for disjunctive programs,'' Special Issue of the New Generation Computing Journal, 9, (3), K. Ueda, T. Chikayama (eds.), 401-424, 1991. (Invited Contribution)

42. T. Przymusinski, ''Three-valued non-monotonic formalisms and semantics of logic programs,'' Special Issue of Artificial Intelligence Journal, 13, 445-464, 1991.

43. T. Przymusinski, ''Well founded and stationary models of logic programs,'' Annals of Mathematics and Artificial Intelligence, 12, 141-187, 1994.

44. H. Przymusinska, T. Przymusinski, ''Stationary default extensions,'' Special Issue of Fundamenta Informaticae, 21, 67-87, 1994.

45. T. Przymusinski, ''Static semantics for normal and disjunctive logic programs,'' Annals of Mathematics and Artificial Intelligence, 14, 323-357, 1995.

46. J. Alferes, L. Pereira, T. Przymusinski, ''Belief revision in non monotonic reasoning and logic programming,'' Fundamenta Informaticae, 28, (1,2), 1-22, 1996.

47. T. Przymusinski, H. Turner, ''Update By Means of Inference Rules,'' Journal of Logic Programming, 30, (2), 125-143, 1997.

48. T. Przymusinski, ''Autoepistemic Logic of Knowledge and Beliefs,'' Journal of Artificial Intelligence, 95, pp. 115-154, 1998.

49. J. Alferes, L. Pereira, T. Przymusinski, ''Classical” Negation In Non-Monotonic Reasoning and Logic Programming,'' Journal of Automated Reasoning, 20, pp. 107-142, 1998.

50. T. Przymusinski, ''Reasoning With Knowledge and Belief,'' Special issue of the Journal of Programming and Computer Software 24, 1, pp. 11-31, 1998. (invited paper)

51. S. Brass, J. Dix, T. Przymusinski, ''Computation of the Semantics of Autoepistemic Belief Theories, Journal of Artificial Intelligence,'' Journal of Artificial Intelligence, 112, 233-250, 1999.

52. J. Alferes, J. Leite, L. Pereira, H. Przymusinska, T. Przymusinski, ''Dynamic Updates of Non-Monotonic Knowledge Bases,'' Journal of Logic Programming, 45, 1-3, 43-70, 2000.

53. S. Brass, J. Dix, I. Niemela, T. Przymusinski, ''On the Equivalence of the Static and Disjunctive Well-Founded Semantics and its Computation,'' Theoretical Computer Science, 258, 1-2, 523-553, 2001.

54. J. Alferes, L. Pereira, H. Przymusinska, T.  Przymusinski, ''LUPS - a language for updating logic programs,'' Artificial Intelligence Journal, 138, (1-2), 87-116, 2002.

55. J. A. Leite, J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''A Language for Multi-dimensional Updates,'' Electronic Notes in Theoretical Computer Science, 70, 5, N/A, 2002.

56. S. Brass, J. Dix, T. Przymusinski, ''Super Logic Programs,'' ACM Transactions on Computational Logic 5(1): 129-176 (2004)

Symposia/Conference Proceedings

1. T. Przymusinski, ''A Lindelof space X such that X² is normal but not paracompact,'' In: Colloquia Mathematica Soc. Janos Bolyai 8, Topics in Topology, North Holland, Amsterdam, July 1994, 77-82, 1974.

2. T. Przymusinski, ''On the equivalence of certain set-theoretic and topological conditions,'' In: Colloquia Mathematica Soc. Janos Bolyai 23, Topics in Topology, North Holland, Amsterdam, July 1978, pp. 998-1003, 1978.

3. T. Przymusinski, ''On the semantics of stratified deductive databases,'' Proc.  Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC, August 1986, pp. 433-443, 1986.

4. M. Gelfond, H. Przymusinska, T. Przymusinski, ''The extended closed world assumption and its relationship to parallel circumscription,'' Proc. ACM SIGACT SIGMOD Symp. on Principles of Database Systems, Cambridge, MA, August 1986, pp. 133-139, 1986.

5. T. Przymusinski, ''Query answering in circumscriptive and closed world theories,'' Proc. Fifth National Conf. on Artificial Intelligence, AAAI 86, Philadelphia, August 1986, 186-190, 1986.

6. T. Przymusinski, ''A query answering algorithm for circumscriptive theories,'' Proc. ACM SIGART Int. Symp. Methodologies for Intelligent Systems, Knoxville, TN, October 1986, pp. 85-93, 1986.

7. T. Przymusinski, ''Perfect model semantics,'' Proc. Int. Logic Programming Conference, Seattle, Wash., August 1988, pp. 1081-1096, 1988.

8. T. Przymusinski, ''On the relationship between non monotonic reasoning and logic programming,'' Proc. Seventh National Conf. on Artificial Intelligence, AAAI'88, St. Paul, MN., August 1988, pp. 444-448, 1988.

9. H. Przymusinska, T. Przymusinski, ''Weakly perfect model semantics for logic programs,'' Proc. Int. Logic Programming Conf., Seattle, WA, August 1988, 1106 - 1122, 1988.

10. M. Gelfond, H. Przymusinska, T. Przymusinski, ''Minimal model semantics vs. negation as failure,'' Proc. Int. Symp. on Methodologies of Intelligent Systems (ISMIS 88), Torino, Italy, October 1988, pp. 435-443, 1988.

11. T. Przymusinski, ''Every logic program has a natural stratification and an iterated least fixed point model,'' Proc. ACM SIGACT SIGMOD Symp. on Principles of Database Systems, Philadelphia, PA, March 1989, pp. 11-21, 1989.

12. T. Przymusinski, ''Three valued non monotonic formalisms and logic programming,'' Proc. First Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, May 1989, pp. 341-348, 1989.

13. T. Przymusinski, ''Non monotonic formalisms and logic programming,'' Proc. Int. Conf. on Logic Programming, MIT Press, Cambridge, MA, July 1989, pp. 655-674, 1989. (Invited Contribution)

14. T. Przymusinski, ''On constructive negation in logic programming,'' Proc. North American Logic Programming Conf., Cleveland, Ohio, October 1989, (Addendum), 1989.

15. T. Przymusinski, ''Extended stable semantics for normal and disjunctive logic programs,'' Proc. Int. Logic Programming Conf., Jerusalem, MIT Press, Jerusalem, Israel, June 1990, pp. 459-477, 1990.

16. T. Przymusinski, ''Stationary Semantics for Disjunctive Logic Programs and Deductive Databases,'' Proceedings of the North American Logic Programming Conference, Austin, Texas, October 1990, 40-59, 1990.

17. T. Przymusinski, ''Stationary semantics for normal and disjunctive logic programs,'' Proc. Conf. on Deductive Object Oriented Databases (DOOD'91), Munich, Germany, June 1991, pp. 85-107, 1991.

18. T. Przymusinski, ''Autoepistemic logics of closed beliefs and logic programming,'' Proc. First Int. Workshop on Logic Programming and Non-monotonic Reasoning, Washington, DC, July 1991, MIT Press, Cambridge, MA, pp. 3-20, 1991.

19. T. Przymusinski, ''A semantics for disjunctive logic programs,'' Proc. in ILPS'91 workshop on Disjunctive Logic Programs, Washington, DC, August 1991, Loveland, Lobo, Rajasekar (eds.), pp. 10-15, 1991.

20. T. Przymusinski, ''Well-founded completions of logic programs,'' Proc. Eight Int. Logic Programming Conf., Paris, France, September 1991, MIT Press, Cambridge, MA, pp. 726-744, 1991.

21. H. Przymusinska, T. Przymusinski, H. Seki, ''Soundness and completeness of partial deductions for well founded semantics,'' Proc. Conf. on Logic Programming and Automated Reasoning, LPAR 92, V. 624, St.Petersburg, Russia, July 1992, Lecture Notes in Artificial Intelligence, A. Voronkov(ed.), pp. 1-12, 1992.

22. T. Przymusinski, ''Two simple characterizations of well founded semantics,'' Proc. Conf. on Mathematical Foundations of Computer Science, MFCS'92, Prague, August 1992, Springer Verlag., I. Havel, V. Koubek (eds.), pp. 451-462, 1992.

23. T. Przymusinski, ''Semantics of normal and disjunctive logic programs: A unifying framework,'' Proc. Workshop on Non-Monotonic Extensions of Logic Programming at the Eleventh International Logic Programming Conf., ICLP'95, Santa Margherita Ligure, Italy, June 1994, Springer Verlag, pp. 43-67, 1994.

24. T. Przymusinski, ''A knowledge representation framework based on autoepistemic logic of minimal beliefs,'' Proc. Twelfth National Conf. on Artificial Intelligence, AAAI 94, Seattle, WA, August 1994, pp. 952-959, 1994.

25. J. Alferes, L. Pereira, T. Przymusinski., ''Belief revision in logic programming and non-monotonic reasoning,'' In: Progress in Artificial Intelligence, Proc. of the 7th International Artificial Intelligence Conf., EPIA'95, Madeira, Portugal, June 1995, pp. 41-56, 1995.

26. T. Przymusinski, H. Turner, ''Update by means of inference rules,'' Proc. Third Int. Workshop on Logic Programming and Non-Monotonic Reasoning, Lexington, KY, July 1995, LPNMR95, Springer Verlag, A. Nerode (ed.), pp. 156-174, 1995.

27. N. McCain, V. Lifschitz, T. Przymusinski, R. F. Stark, ''Loop checking and the well founded semantics,'' Proc. Third International Workshop on Logic Programming and Non Monotonic Reasoning, Lexington, KY, August 1995, LPNMR95, Springer Verlag, A. Nerode (ed.), pp. 127-142, 1995.

28. J. Alferes, L. Pereira, T. Przymusinski, ''Symmetric negation in non-monotonic reasoning,'' Proc. Int. Conf. on Artificial Intelligence and Mathematics, AI&Math'96, Fort Lauderdale, FL, July 1996, pp. 1-4, 1996.

29. S. Brass, J. Dix, T. Przymusinski, ''Super logic programs,'' Proc. Fifth Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'96), Boston, MA, August 1996, pp. 529--541, 1996.

30. J. Alferes, L. Pereira, T. Przymusinski, ''Strong and explicit negation in non monotonic reasoning,'' Proc. European Workshop on Logic in Artificial Intelligence, JELIA'96, Evora, Portugal, September 1996, pp. 143-163, 1996.

31. S. Brass, J. Dix, I. Niemela, T. Przymusinski, ''Comparison and Efficient Computation of the Static and the Disjunctive WFS,'' Proceedings of the third Dutch-German Workshop on Nonmonotonic Reasoning and its Applications, Amsterdam, February 1997, G. Brewka, E. Weydert,C. Witteveen (eds.), pages 37-42, 1997.

32. J. Alferes, J. Leite, L. Pereira, H. Przymusinska, T. Przymusinski, ''Updates of Logic Programs by Logic Programs,'' Proceedings of the Intelligent Information Systems Workshop (IIS’98), Poland, June 1998, Malbork, pp. 160-177, 1998.

33. S. Brass, J. Dix, I. Niemela, T. Przymusinski, ''A Comparison of the Static and The Disjunctive Well-Founded Semantics,'' Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Toronto, CA, June 1998, Morgan Kaufmann, pp. 74-85, 1998.

34. J. Alferes, J. Leite, L. Pereira, H. Przymusinska, T. Przymusinski, ''Dynamic Logic Programming,'' Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Toronto, CA, June 1998, Morgan Kaufmann, pp. 98-111, 1998.

35. J. J. Alferes, J. A. Leite , L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''Dynamic Logic Programming,'' Procs. of the 1998 Joint Conf. on Declarative Programming (AGP'98),, La Coruña, Spain, July 1998, 393-408, 1998.

36. J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''LUPS - a language for updating logic programs,'' Proceedings of the Fifth International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, El Paso, TX, August 1999, Lecture Notes in AI 1730, Springer Verlag, pp. 162-176, 1999.

37. J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''Preliminary exploration of actions as updates,'' Proceedings of the Joint Conference on Declarative Programming (APPIA-GULP-PRODE'99), Italy, September 1999, M. C. Meo, M. V. Ferro (eds. Università degli Studi di L'Aquila L'Aquila), pp. 259-271, 1999.

38. J. Alferes, L. Pereira, H. Przymusinska, T. Przymusinski,  P. Quaresma., ''Dynamic Logic Representation and its Applications,'' Proceedings of Artificial Intelligence: Methodology, Systems, Architectures (AIMSA’2000), Varna, Bulgaria, September 2000, 1-10, 2000.

39. J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, P. Quaresma, ''An Exercise with Dynamic Logic Programming,'' Procs. of the APPIA-GULP-PRODE'00 Joint Conf. on Declarative Programming (AGP'00), La Habana, Cuba, December 2000, 9 pages, 2000.

40. J. A. Leite, J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''A Language for Multi-dimensional Updates,'' Procs. of the 3rd Intl.Workshop on Computational Logic in Multi-Agent Systems, (CLIMA'02), Roskilde University, Denmark, August 2002, 19-34, 2002.

41. J. A. Leite, J. J. Alferes, L. M. Pereira, H. Przymusinska, T. C. Przymusinski, ''A Language for Updates with Multiple Dimensions,'' Procs. of the APPIA-GULP-PRODE'02 Joint Conf. on Declarative Programming (AGP'02), Madrid, Spain, September 2002, 11 pages, 2002.

Book Chapters

1. T. Przymusinski, ''Normality and separability of Moore spaces,'' In Set theoretic Topology, Academic Press, New York, K. Kunen (Ed.), pp. 325 - 337, 1977.

2. T. Przymusinski, ''Product spaces,'' Surveys in General Topology, Academic Press, New York, G.M. Reed (Ed.), pp. 399 - 430, 1980.

3. T. Przymusinski, ''Normality of product spaces,'' Handbook of Set-theoretic Topology, North Holland, K. Kunen,  J. E. Vaughan (Eds.), pp. 779 - 822, 1983.

4. T. Przymusinski, ''On the declarative semantics of stratified deductive databases and logic programs,'' Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, J. Minker (Ed.), pp. 193 - 216, 1987.

5. T. Przymusinski, ''Non monotonic reasoning vs. logic programming: A new perspective,'' The Foundations of Artificial Intelligence. A Source book, Cambridge University Press, Y. Wilks, D. Partridge (Eds.), pp. 49-79, 1990.

6. H. Przymusinska, T. Przymusinski, ''Semantic issues in deductive databases and logic programs,'' Formal Techniques in Artificial Intelligence, A Source-book, North Holland, R. Banerji (Ed.), pp. 321-367, 1990.

7. T. Przymusinski, ''General topology,'' Lexicon of Mathematics, Wiedza Powszechna, Warsaw (in Polish), W. Sawicka, pp. 176-205, 1993.

8. T. Przymusinski, ''Prolegomena to logic programming for non-monotonic reasoning,'' Non-Monotonic Extensions of Logic Programming, Proc. of the Workshop Int. Logic Programming Conf., JICSLP’96, Bonn, Germany, Italy, September 1996. Lecture Notes in Artificial Intelligence, Vol. 1216, Springer Verlag 1997, J. Dix, L. Pereira, T. Przymusinski (Eds.), pp. 1-36, 1996.

Edited Special Issues of Journals

1. T. Przymusinski, ''Special Issue of the Journal of Logic Programming on Non Monotonic Reasoning and Logic Programming,'' Journal of Logic Programming, 17, (2), T. Przymusinski (Ed.) (Editor's Contribution:Wrote four page introduction - Invited contribution), 1-4, 1993.

2. T. Przymusinski, ''Special Issue of the Journal of Logic Programming on Non Monotonic Reasoning and Logic Programming,'' Journal of Logic Programming, 17, (3), T. Przymusinski (Ed.) (Editor's Contribution:Wrote four page introduction - Invited contribution), 1-4, 1993.

3. T. Przymusinski, ''Special Issue of the Journal of Logic Programming on Non Monotonic Reasoning and Logic Programming,'' Journal of Logic Programming, 17, (4), T. Przymusinski (Ed.) (Editor's Contribution:Wrote four page introduction - Invited contribution), 1-4, 1993.

4. J. Dix, L. Pereira, T. Przymusinski, ''Non-Monotonic Extensions of Logic Programming,'' Proc. of the Workshop at the Eleventh Int. Logic Programming Conf., ICLP'95, Santa Margherita Ligure, Italy, June 1994, Lecture Notes in Artificial Intelligence, Springer Verlag, T. Przymusinski (Ed.), (Guest Editors:J. Dix, L. Pereira (Co-Eds)) (Editor's Contribution:Editor's Forward, 4 - 5 pp.), 4-5, 1995.

5. J. Dix, L. Pereira , T. Przymusinski, ''Non-Montonic Extensions of Logic Programming,'' Proc. Workshop at the Int. Logic Programming Conf. JICSLP’96, V. 1216, Bonn, Germany. Lecture Notes in Artificial Intelligence, Springer Verlag, T. Przymusinski (Ed.), (Guest Editors:J. Dix, L. Pereira (Co-Eds.)) (Editor's Contribution:Editor's forward, 3 pp.), 1-3, 1996.

6. T. Przymusinski, J. Dix, L. Pereira, ''Logic programming and knowledge representation,'' Proceedings of the Third International Workshop, LPKR '97, vol. 1471, Port Jefferson, NY, October 1997 Lecture Notes in Artificial Intelligence, Springer Verlag, 1998, (Guest Editors:T. Przymusinski, J. Dix, L. Pereira (Co-Eds.)) (Editor's Contribution:Editor's contribution), 1-2, 1997.

Abstracts

1. T. Przymusinski, ''Semantics of disjunctive programs -- A unifying approach,'' Workshop on Disjunctive Logic Programs, 13th World Computer Congress, IFIP 94, Hamburg, July 1994, Innovationen bei Rechen und Kommunikations systemen, Springer Verlag, B. Wolfinger (ed.), p. 52, 1994.

2. T. Przymusinski, ''Autoepistemic logic of minimal beliefs,'' Proc. of the 4th European Workshop on Logics in AI, JELIA 94, York, England, September 1994, Springer Verlag, p. 364, 1994. [Invited Contribution]

3. T. Przymusinski, ''Super Logic Programs and Negation as Belief,'' Proc. of the 5th Int. Workshop on Extensions of Logic Programming,ELP'96, Leipzig, Germany, March 1996, Springer Verlag, p. 229-236 (Extended Abstract), 1996.

Return to Teodor C. Przymusinski's Home Page