Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Teodor C. Przymusinski
2000 – 2009
- 2004
[j19]Stefan Brass, Jürgen Dix, Teodor C. Przymusinski: Super logic programs. ACM Trans. Comput. Log. 5(1): 129-176 (2004)- 2002
[j18]José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: LUPSA language for updating logic programs. Artif. Intell. 138(1-2): 87-116 (2002)
[j17]João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: A Language for Multi-dimensional Updates. Electr. Notes Theor. Comput. Sci. 70(5): 20-38 (2002)
[c38]João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: A Language for Multi-dimensional Updates. CLIMA 2002: 19-34- 2001
[j16]Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski: On the equivalence of the static and disjunctive well-founded semantics and its computation. Theor. Comput. Sci. 258(1-2): 523-553 (2001)- 2000
[j15]José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: Dynamic updates of non-monotonic knowledge bases. J. Log. Program. 45(1-3): 43-70 (2000)
[c37]José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma: Dynamic Knowledge Representation and Its Applications. AIMSA 2000: 1-10
[i1]
1990 – 1999
- 1999
[j14]Stefan Brass, Jürgen Dix, Teodor C. Przymusinski: Computation of the Semantics of Autoepistemic Belief Theories. Artif. Intell. 112(1-2): 233-250 (1999)
[c36]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski, Halina Przymusinska, Paulo Quaresma: Preliminary exploration on actions as updates. APPIA-GULP-PRODE 1999: 259-272
[c35]José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: LUPS - A Language for Updating Logic Programs. LPNMR 1999: 162-176- 1998
[j13]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski: `Classical' Negation in Nonmonotonic Reasoning and Logic Programming. J. Autom. Reasoning 20(1): 107-142 (1998)
[c34]José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: Dynamic Logic Programming. APPIA-GULP-PRODE 1998: 393-408
[c33]Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski: A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation. KR 1998: 74-85
[c32]José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: Dynamic Logic Programming. KR 1998: 98-111
[e3]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski (Eds.): Logic Programming and Knowledge Representation, Third International Workshop, LPKR '97, Port Jefferson, New York, USA, October 17, 1997, Selected Papers. Lecture Notes in Computer Science 1471, Springer 1998, ISBN 3-540-64958-1- 1997
[j12]Teodor C. Przymusinski: Autoepistemic Logic of Knowledge and Beliefs. Artif. Intell. 95(1): 115-154 (1997)
[j11]Teodor C. Przymusinski, Hudson Turner: Update by Means of Inference Rules. J. Log. Program. 30(2): 125-143 (1997)
[c31]Jürgen Dix, Teodor C. Przymusinski, Luís Moniz Pereira: Logic Programming and Knowledge Representation (LPKR'97). ILPS 1997: 419-420
[e2]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski (Eds.): Non-Monotonic Extensions of Logic Programming, NMELP '96, Bad Honnef, Germany, September 5-6, 1996, Selected Papers. Lecture Notes in Computer Science 1216, Springer 1997, ISBN 3-540-62843-6- 1996
[j10]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski: Belief Revision in Non-Monotonic Reasoning and Logic Programming. Fundam. Inform. 28(1-2): 1-22 (1996)
[c30]
[c29]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski: Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. JELIA 1996: 143-163
[c28]
[c27]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski: Prolegomena to Logic Programming for Non-monotonic Reasoning. NMELP 1996: 1-36- 1995
[j9]Teodor C. Przymusinski: Static Semantics for Normal and Disjunctive Logic Programs. Ann. Math. Artif. Intell. 14(2-4): 323-357 (1995)
[c26]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski: Belief Revision in Non-Monotonic Reasoning. EPIA 1995: 40-56
[c25]Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk: Loop Checking and the Wll-Founded Semantics. LPNMR 1995: 127-142
[c24]
[e1]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski (Eds.): Non-Monotonic Extensions of Logic Programming (NMELP'94), ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994, Selected Papers. Lecture Notes in Computer Science 927, Springer 1995, ISBN 3-540-59467-1- 1994
[j8]Teodor C. Przymusinski: Well-founded and Stationary Models of Logic Programs. Ann. Math. Artif. Intell. 12(3-4): 141-187 (1994)
[j7]Halina Przymusinska, Teodor C. Przymusinski: Stationary Default Extensions. Fundam. Inform. 21(1/2): 67-87 (1994)
[c23]Teodor C. Przymusinski: A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. AAAI 1994: 952-958
[c22]Teodor C. Przymusinski: Semantics of Disjunctive Programs: A Unifying Approach. GI Jahrestagung 1994: 52
[c21]
[c20]Teodor C. Przymusinski: Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. NMELP 1994: 43-67- 1992
[c19]Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki: Soundness and Completeness of Partial Deductions for Well-Founded Semantics. LPAR 1992: 1-12
[c18]- 1991
[j6]Teodor C. Przymusinski: Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs. Artif. Intell. 49(1-3): 309-343 (1991)
[j5]Teodor C. Przymusinski: Stable Semantics for Disjunctive Programs. New Generation Comput. 9(3/4): 401-424 (1991)
[c17]Teodor C. Przymusinski: Semantics of Disjunctive Logic Programs and Deductive Databases. DOOD 1991: 85-107
[c16]
[c15]Teodor C. Przymusinski: Autoepistemic Logics of Closed Beliefs and Logic Programming. LPNMR 1991: 3-20
[c14]- 1990
[j4]Teodor C. Przymusinski: The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundam. Inform. 13(4): 445-463 (1990)
[c13]Teodor C. Przymusinski: Extended Stable Semantics for Normal and Disjunctive Programs. ICLP 1990: 459-477
[c12]Teodor C. Przymusinski: Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. LPNMR 1990: 103-106
[c11]Teodor C. Przymusinski: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases. NACLP 1990: 40-59
1980 – 1989
- 1989
[j3]
[j2]Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski: On the Relationship Between Circumscription and Negation as Failure. Artif. Intell. 38(1): 75-94 (1989)
[j1]Teodor C. Przymusinski: On the Declarative and Procedural Semantics of Logic Programs. J. Autom. Reasoning 5(2): 167-205 (1989)
[c10]
[c9]Teodor C. Przymusinski: Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. KR 1989: 341-348
[c8]Teodor C. Przymusinski: Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. PODS 1989: 11-21
[c7]- 1988
[p1]Teodor C. Przymusinski: On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216
[c6]Teodor C. Przymusinski: On the Relationship Between Logic Programming and Nonmonotonic Reasoning. AAAI 1988: 444-448
[c5]
[c4]Halina Przymusinska, Teodor C. Przymusinski: Weakly Perfect Model Semantics for Logic Programs. ICLP/SLP 1988: 1106-1120
[c3]Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski: Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. ISMIS 1988: 435-443- 1986
[c2]Teodor C. Przymusinski: Query Answering in Circumscriptive and Closed-World Theories. AAAI 1986: 186-190
[c1]Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski: The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. PODS 1986: 133-139
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-13 22:41 CET by the dblp team



