Teodor C. Przymusinski

64 papers A* 9B 12C 2Misc 2Journal 20Unranked 15
YearRankTypeTitle / Venue / Authors
2004 J jnl
Super logic programs.
ACM Trans. Comput. Log.
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
2002 — conf
A Language for Multi-dimensional Updates.
CLIMA
João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
2002 — conf
A Language for Updates with Multiple Dimensions.
APPIA-GULP-PRODE
João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
2002 J jnl
LUPSA language for updating logic programs.
Artif. Intell.
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
2001 J jnl
On the equivalence of the static and disjunctive well-founded semantics and its computation.
Theor. Comput. Sci.
Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
2000 Misc conf
Dynamic Knowledge Representation and Its Applications.
AIMSA
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma
2000 J jnl
Dynamic updates of non-monotonic knowledge bases.
J. Log. Program.
José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
2000 J jnl
Super Logic Programs
CoRR
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
1999 J jnl
Computation of the Semantics of Autoepistemic Belief Theories.
Artif. Intell.
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
1999 B conf
LUPS - A Language for Updating Logic Programs.
LPNMR
José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
1999 — conf
Preliminary exploration on actions as updates.
APPIA-GULP-PRODE
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski, Halina Przymusinska, Paulo Quaresma
1998 J jnl
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming.
J. Autom. Reason.
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
1998 A* conf
A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation.
KR
Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
1998 — conf
Dynamic Logic Programming.
APPIA-GULP-PRODE
José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
1998 A* conf
Dynamic Logic Programming.
KR
José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski
1998 — ed.
Logic Programming and Knowledge Representation, Third International Workshop, LPKR '97, Port Jefferson, New York, USA, October 17, 1997, Selected Papers
LPKR
Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
1997 J jnl
Autoepistemic Logic of Knowledge and Beliefs.
Artif. Intell.
Teodor C. Przymusinski
1997 — conf
Logic Programming and Knowledge Representation (LPKR'97).
ILPS
Jürgen Dix, Teodor C. Przymusinski, Luís Moniz Pereira
1997 — ed.
Non-Monotonic Extensions of Logic Programming, NMELP '96, Bad Honnef, Germany, September 5-6, 1996, Selected Papers
NMELP
Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
1997 J jnl
Update by Means of Inference Rules.
J. Log. Program.
Teodor C. Przymusinski, Hudson Turner
1996 J jnl
Belief Revision in Non-Monotonic Reasoning and Logic Programming.
Fundam. Informaticae
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
1996 — conf
Prolegomena to Logic Programming for Non-monotonic Reasoning.
NMELP
Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
1996 B conf
Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming.
JELIA
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
1996 — conf
Super Logic Programs and Negation as Belief.
ELP
Teodor C. Przymusinski
1996 A* conf
Super Logic Programs.
KR
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
1995 Misc conf
Belief Revision in Non-Monotonic Reasoning.
EPIA
José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski
1995 B conf
Loop Checking and the Wll-Founded Semantics.
LPNMR
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
1995 — ed.
Non-Monotonic Extensions of Logic Programming (NMELP'94), ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994, Selected Papers
NMELP
Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski
1995 J jnl
Static Semantics for Normal and Disjunctive Logic Programs.
Ann. Math. Artif. Intell.
Teodor C. Przymusinski
1995 B conf
Update by Means of Inference Rules.
LPNMR
Teodor C. Przymusinski, Hudson Turner
1994 A* conf
A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs.
AAAI
Teodor C. Przymusinski
1994 B conf
Autoepistemic Logic of Minimal Beliefs.
JELIA
Teodor C. Przymusinski
1994 — conf
Semantics of Disjunctive Programs: A Unifying Approach.
GI Jahrestagung
Teodor C. Przymusinski
1994 — conf
Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework.
NMELP
Teodor C. Przymusinski
1994 J jnl
Stationary Default Extensions.
Fundam. Informaticae
Halina Przymusinska, Teodor C. Przymusinski
1994 J jnl
Well-founded and Stationary Models of Logic Programs.
Ann. Math. Artif. Intell.
Teodor C. Przymusinski
1992 B conf
Soundness and Completeness of Partial Deductions for Well-Founded Semantics.
LPAR
Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki
1992 B conf
Two Simple Characterizations of Well-Founded Semantics.
MFCS
Teodor C. Przymusinski
1991 B conf
Autoepistemic Logics of Closed Beliefs and Logic Programming.
LPNMR
Teodor C. Przymusinski
1991 — conf
Non-Monotonic Reasoning and Logic Programming.
ISLP
Teodor C. Przymusinski
1991 — conf
Semantics of Disjunctive Logic Programs and Deductive Databases.
DOOD
Teodor C. Przymusinski
1991 J jnl
Stable Semantics for Disjunctive Programs.
New Gener. Comput.
Teodor C. Przymusinski
1991 J jnl
Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs.
Artif. Intell.
Teodor C. Przymusinski
1991 B conf
Well-Founded Completions of Logic Programs.
ICLP
Teodor C. Przymusinski
1990 B conf
Extended Stable Semantics for Normal and Disjunctive Programs.
ICLP
Teodor C. Przymusinski
1990 J jnl
On the relationship between CWA, minimal model, and minimal herbrand model semantics.
Int. J. Intell. Syst.
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
1990 — conf
Stationary Semantics for Disjunctive Logic Programs and Deductive Databases.
NACLP
Teodor C. Przymusinski
1990 J jnl
The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics.
Fundam. Inform.
Teodor C. Przymusinski
1990 B conf
Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs.
LPNMR
Teodor C. Przymusinski
1989 J jnl
An Algorithm to Compute Circumscription.
Artif. Intell.
Teodor C. Przymusinski
1989 A* conf
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model.
PODS
Teodor C. Przymusinski
1989 B conf
Non-Monotonic Formalisms and Logic Programming.
ICLP
Teodor C. Przymusinski
1989 — conf
On Constructive Negation in Logic Programming.
NACLP
Teodor C. Przymusinski
1989 J jnl
On the Declarative and Procedural Semantics of Logic Programs.
J. Autom. Reason.
Teodor C. Przymusinski
1989 J jnl
On the Relationship Between Circumscription and Negation as Failure.
Artif. Intell.
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
1989 A* conf
Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming.
KR
Teodor C. Przymusinski
1988 C conf
Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics.
ISMIS
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski
1988 — ch.
On the Declarative Semantics of Deductive Databases and Logic Programs.
Foundations of Deductive Databases and Logic Programming.
Teodor C. Przymusinski
1988 A* conf
On the Relationship Between Logic Programming and Nonmonotonic Reasoning.
AAAI
Teodor C. Przymusinski
1988 — conf
Perfect Model Semantics.
ICLP/SLP
Teodor C. Przymusinski
1988 — conf
Weakly Perfect Model Semantics for Logic Programs.
ICLP/SLP
Halina Przymusinska, Teodor C. Przymusinski
1986 C conf
A decidable query answering algorithm for circumscriptive theories.
ISMIS
Teodor C. Przymusinski
1986 A* conf
Query Answering in Circumscriptive and Closed-World Theories.
AAAI
Teodor C. Przymusinski
1986 A* conf
The Extended Closed World Assumpution and its Relationship to Parallel Circumscription.
PODS
Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski