The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Teodor C. Przymusinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Teodor C. Przymusinski
    Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. [Citation Graph (15, 15)][DBLP]
    PODS, 1989, pp:11-21 [Conf]
  2. Halina Przymusinska, Teodor C. Przymusinski
    Weakly Perfect Model Semantics for Logic Programs. [Citation Graph (10, 0)][DBLP]
    ICLP/SLP, 1988, pp:1106-1120 [Conf]
  3. Teodor C. Przymusinski
    Perfect Model Semantics. [Citation Graph (7, 0)][DBLP]
    ICLP/SLP, 1988, pp:1081-1096 [Conf]
  4. Teodor C. Przymusinski
    On the Declarative and Procedural Semantics of Logic Programs. [Citation Graph (7, 0)][DBLP]
    J. Autom. Reasoning, 1989, v:5, n:2, pp:167-205 [Journal]
  5. Teodor C. Przymusinski
    Stable Semantics for Disjunctive Programs. [Citation Graph (7, 0)][DBLP]
    New Generation Comput., 1991, v:9, n:3/4, pp:401-424 [Journal]
  6. Teodor C. Przymusinski
    Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. [Citation Graph (4, 0)][DBLP]
    KR, 1989, pp:341-348 [Conf]
  7. Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
    The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. [Citation Graph (4, 9)][DBLP]
    PODS, 1986, pp:133-139 [Conf]
  8. Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
    On the Relationship Between Circumscription and Negation as Failure. [Citation Graph (4, 0)][DBLP]
    Artif. Intell., 1989, v:38, n:1, pp:75-94 [Journal]
  9. Teodor C. Przymusinski
    An Algorithm to Compute Circumscription. [Citation Graph (3, 0)][DBLP]
    Artif. Intell., 1989, v:38, n:1, pp:49-73 [Journal]
  10. Teodor C. Przymusinski
    Semantics of Disjunctive Logic Programs and Deductive Databases. [Citation Graph (2, 0)][DBLP]
    DOOD, 1991, pp:85-107 [Conf]
  11. Teodor C. Przymusinski
    Non-Monotonic Formalisms and Logic Programming. [Citation Graph (2, 0)][DBLP]
    ICLP, 1989, pp:655-674 [Conf]
  12. Teodor C. Przymusinski
    Extended Stable Semantics for Normal and Disjunctive Programs. [Citation Graph (2, 0)][DBLP]
    ICLP, 1990, pp:459-477 [Conf]
  13. Teodor C. Przymusinski
    Stationary Semantics for Disjunctive Logic Programs and Deductive Databases. [Citation Graph (2, 0)][DBLP]
    NACLP, 1990, pp:40-59 [Conf]
  14. Teodor C. Przymusinski
    The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. [Citation Graph (2, 0)][DBLP]
    Fundam. Inform., 1990, v:13, n:4, pp:445-463 [Journal]
  15. Teodor C. Przymusinski
    A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. [Citation Graph (1, 0)][DBLP]
    AAAI, 1994, pp:952-958 [Conf]
  16. Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
    Super Logic Programs. [Citation Graph (1, 0)][DBLP]
    KR, 1996, pp:529-540 [Conf]
  17. Teodor C. Przymusinski
    On Constructive Negation in Logic Programming. [Citation Graph (1, 0)][DBLP]
    NACLP, 1989, pp:0-0 [Conf]
  18. Teodor C. Przymusinski
    Query Answering in Circumscriptive and Closed-World Theories. [Citation Graph (0, 0)][DBLP]
    AAAI, 1986, pp:186-190 [Conf]
  19. Teodor C. Przymusinski
    On the Relationship Between Logic Programming and Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:444-448 [Conf]
  20. José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    Dynamic Logic Programming. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1998, pp:393-408 [Conf]
  21. José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski, Halina Przymusinska, Paulo Quaresma
    Preliminary exploration on actions as updates. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:259-272 [Conf]
  22. José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma
    Dynamic Knowledge Representation and Its Applications. [Citation Graph (0, 0)][DBLP]
    AIMSA, 2000, pp:1-10 [Conf]
  23. João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    A Language for Multi-dimensional Updates. [Citation Graph (0, 0)][DBLP]
    CLIMA III, 2002, pp:19-34 [Conf]
  24. Teodor C. Przymusinski
    Super Logic Programs and Negation as Belief. [Citation Graph (0, 0)][DBLP]
    ELP, 1996, pp:229-235 [Conf]
  25. José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
    Belief Revision in Non-Monotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    EPIA, 1995, pp:40-56 [Conf]
  26. Teodor C. Przymusinski
    Semantics of Disjunctive Programs: A Unifying Approach. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1994, pp:52- [Conf]
  27. Teodor C. Przymusinski
    Well-Founded Completions of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:726-741 [Conf]
  28. Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
    Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:435-443 [Conf]
  29. José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
    Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:143-163 [Conf]
  30. Teodor C. Przymusinski
    Autoepistemic Logic of Minimal Beliefs. [Citation Graph (0, 0)][DBLP]
    JELIA, 1994, pp:364- [Conf]
  31. José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    Dynamic Logic Programming. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:98-111 [Conf]
  32. Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
    A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:74-85 [Conf]
  33. Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki
    Soundness and Completeness of Partial Deductions for Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:1-12 [Conf]
  34. José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    LUPS - A Language for Updating Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:162-176 [Conf]
  35. Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
    Loop Checking and the Wll-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:127-142 [Conf]
  36. Teodor C. Przymusinski
    Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1990, pp:103-106 [Conf]
  37. Teodor C. Przymusinski
    Autoepistemic Logics of Closed Beliefs and Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1991, pp:3-20 [Conf]
  38. Teodor C. Przymusinski, Hudson Turner
    Update by Means of Inference Rules. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:156-174 [Conf]
  39. Teodor C. Przymusinski
    Two Simple Characterizations of Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:451-462 [Conf]
  40. Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
    Prolegomena to Logic Programming for Non-monotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    NMELP, 1996, pp:1-36 [Conf]
  41. Teodor C. Przymusinski
    Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. [Citation Graph (0, 0)][DBLP]
    NMELP, 1994, pp:43-67 [Conf]
  42. Jürgen Dix, Teodor C. Przymusinski, Luís Moniz Pereira
    Logic Programming and Knowledge Representation (LPKR'97). [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:419-420 [Conf]
  43. Teodor C. Przymusinski
    Non-Monotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:735-736 [Conf]
  44. José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    LUPSA language for updating logic programs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:138, n:1-2, pp:87-116 [Journal]
  45. Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
    Computation of the Semantics of Autoepistemic Belief Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:112, n:1-2, pp:233-250 [Journal]
  46. Teodor C. Przymusinski
    Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1991, v:49, n:1-3, pp:309-343 [Journal]
  47. Teodor C. Przymusinski
    Autoepistemic Logic of Knowledge and Beliefs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:95, n:1, pp:115-154 [Journal]
  48. Teodor C. Przymusinski
    Well-founded and Stationary Models of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1994, v:12, n:3-4, pp:141-187 [Journal]
  49. Teodor C. Przymusinski
    Static Semantics for Normal and Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:14, n:2-4, pp:323-357 [Journal]
  50. Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
    Super Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  51. João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    A Language for Multi-dimensional Updates. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:5, pp:- [Journal]
  52. José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
    Belief Revision in Non-Monotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:1-22 [Journal]
  53. Halina Przymusinska, Teodor C. Przymusinski
    Stationary Default Extensions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:21, n:1/2, pp:67-87 [Journal]
  54. José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
    `Classical' Negation in Nonmonotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1998, v:20, n:1, pp:107-142 [Journal]
  55. José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
    Dynamic updates of non-monotonic knowledge bases. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:45, n:1-3, pp:43-70 [Journal]
  56. Teodor C. Przymusinski, Hudson Turner
    Update by Means of Inference Rules. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:30, n:2, pp:125-143 [Journal]
  57. Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
    On the equivalence of the static and disjunctive well-founded semantics and its computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:523-553 [Journal]
  58. Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
    Super logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:1, pp:129-176 [Journal]

Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002