Teodor C. Przymusinski

Publication Activity (10 Years)

Years Active: 1986-2004
Publications (10 Years): 0

Publications

Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Super logic programs. ACM Trans. Comput. Log. 5 (1) (2004)
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)
João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
A Language for Multi-dimensional Updates. Electron. Notes Theor. Comput. Sci. 70 (5) (2002)
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
LUPSA language for updating logic programs. Artif. Intell. 138 (1-2) (2002)
João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
A Language for Updates with Multiple Dimensions. APPIA-GULP-PRODE (2002)
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) (2001)
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma
Dynamic Knowledge Representation and Its Applications. AIMSA (2000)
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) (2000)
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Super Logic Programs CoRR (2000)
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
LUPS - A Language for Updating Logic Programs. LPNMR (1999)
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)
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Computation of the Semantics of Autoepistemic Belief Theories. Artif. Intell. 112 (1-2) (1999)
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)
José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
Dynamic Logic Programming. APPIA-GULP-PRODE (1998)
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming. J. Autom. Reason. 20 (1) (1998)
José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
Dynamic Logic Programming. KR (1998)
Teodor C. Przymusinski
Autoepistemic Logic of Knowledge and Beliefs. Artif. Intell. 95 (1) (1997)
Teodor C. Przymusinski, Hudson Turner
Update by Means of Inference Rules. J. Log. Program. 30 (2) (1997)
Jürgen Dix, Teodor C. Przymusinski, Luís Moniz Pereira
Logic Programming and Knowledge Representation (LPKR'97). ILPS (1997)
Teodor C. Przymusinski
Super Logic Programs and Negation as Belief. ELP (1996)
Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
Prolegomena to Logic Programming for Non-monotonic Reasoning. NMELP (1996)
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Super Logic Programs. KR (1996)
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
Belief Revision in Non-Monotonic Reasoning and Logic Programming. Fundam. Informaticae 28 (1-2) (1996)
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. JELIA (1996)
Teodor C. Przymusinski
Static Semantics for Normal and Disjunctive Logic Programs. Ann. Math. Artif. Intell. 14 (2-4) (1995)
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
Loop Checking and the Wll-Founded Semantics. LPNMR (1995)
Teodor C. Przymusinski, Hudson Turner
Update by Means of Inference Rules. LPNMR (1995)
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
Belief Revision in Non-Monotonic Reasoning. EPIA (1995)
Teodor C. Przymusinski
Well-founded and Stationary Models of Logic Programs. Ann. Math. Artif. Intell. 12 (3-4) (1994)
Halina Przymusinska, Teodor C. Przymusinski
Stationary Default Extensions. Fundam. Informaticae 21 (1/2) (1994)
Teodor C. Przymusinski
Autoepistemic Logic of Minimal Beliefs. JELIA (1994)
Teodor C. Przymusinski
Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. NMELP (1994)
Teodor C. Przymusinski
A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. AAAI (1994)
Teodor C. Przymusinski
Semantics of Disjunctive Programs: A Unifying Approach. GI Jahrestagung (1994)
Teodor C. Przymusinski
Two Simple Characterizations of Well-Founded Semantics. MFCS (1992)
Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki
Soundness and Completeness of Partial Deductions for Well-Founded Semantics. LPAR (1992)
Teodor C. Przymusinski
Non-Monotonic Reasoning and Logic Programming. ISLP (1991)
Teodor C. Przymusinski
Stable Semantics for Disjunctive Programs. New Gener. Comput. 9 (3/4) (1991)
Teodor C. Przymusinski
Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs. Artif. Intell. 49 (1-3) (1991)
Teodor C. Przymusinski
Autoepistemic Logics of Closed Beliefs and Logic Programming. LPNMR (1991)
Teodor C. Przymusinski
Well-Founded Completions of Logic Programs. ICLP (1991)
Teodor C. Przymusinski
Semantics of Disjunctive Logic Programs and Deductive Databases. DOOD (1991)
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
On the relationship between CWA, minimal model, and minimal herbrand model semantics. Int. J. Intell. Syst. 5 (5) (1990)
Teodor C. Przymusinski
Stationary Semantics for Disjunctive Logic Programs and Deductive Databases. NACLP (1990)
Teodor C. Przymusinski
The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundam. Inform. 13 (4) (1990)
Teodor C. Przymusinski
Extended Stable Semantics for Normal and Disjunctive Programs. ICLP (1990)
Teodor C. Przymusinski
Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. LPNMR (1990)
Teodor C. Przymusinski
Non-Monotonic Formalisms and Logic Programming. ICLP (1989)
Teodor C. Przymusinski
On the Declarative and Procedural Semantics of Logic Programs. J. Autom. Reason. 5 (2) (1989)
Teodor C. Przymusinski
On Constructive Negation in Logic Programming. NACLP (1989)
Teodor C. Przymusinski
Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. KR (1989)
Teodor C. Przymusinski
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. PODS (1989)
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
On the Relationship Between Circumscription and Negation as Failure. Artif. Intell. 38 (1) (1989)
Teodor C. Przymusinski
An Algorithm to Compute Circumscription. Artif. Intell. 38 (1) (1989)
Teodor C. Przymusinski
Perfect Model Semantics. ICLP/SLP (1988)
Teodor C. Przymusinski
On the Relationship Between Logic Programming and Nonmonotonic Reasoning. AAAI (1988)
Halina Przymusinska, Teodor C. Przymusinski
Weakly Perfect Model Semantics for Logic Programs. ICLP/SLP (1988)
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. ISMIS (1988)
Teodor C. Przymusinski
Query Answering in Circumscriptive and Closed-World Theories. AAAI (1986)
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. PODS (1986)
Teodor C. Przymusinski
A decidable query answering algorithm for circumscriptive theories. ISMIS (1986)