Teodor C. Przymusinski

According to our database, Teodor C. Przymusinski authored at least 57 papers between 1986 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2004

Super logic programs.

Stefan Brass, Jürgen Dix, Teodor C. Przymusinski

ACM Trans. Comput. Log., 2004

2002

A Language for Multi-dimensional Updates.

João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the Computational Logic in Multi-Agent Systems, 2002

LUPSA language for updating logic programs.

José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

Artif. Intell., 2002

A Language for Updates with Multiple Dimensions.

João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the AGP 2002: Proceedings of the Joint Conference on Declarative Programming, 2002

2001

On the equivalence of the static and disjunctive well-founded semantics and its computation.

Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski

Theor. Comput. Sci., 2001

2000

Dynamic updates of non-monotonic knowledge bases.

José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

J. Log. Program., 2000

Dynamic Knowledge Representation and Its Applications.

José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma

Proceedings of the Artificial Intelligence: Methodology, 2000

1999

Computation of the Semantics of Autoepistemic Belief Theories.

Stefan Brass, Jürgen Dix, Teodor C. Przymusinski

Artif. Intell., 1999

LUPS - A Language for Updating Logic Programs.

José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Preliminary exploration on actions as updates.

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski, Halina Przymusinska, Paulo Quaresma

Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998

'Classical' Negation in Nonmonotonic Reasoning and Logic Programming.

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski

J. Autom. Reason., 1998

A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation.

Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski

Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

Dynamic Logic Programming.

José Júlio Alferes, João Alexandre Leite, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997

Update by Means of Inference Rules.

Teodor C. Przymusinski, Hudson Turner

J. Log. Program., 1997

Autoepistemic Logic of Knowledge and Beliefs.

Teodor C. Przymusinski

Artif. Intell., 1997

Logic Programming and Knowledge Representation (LPKR'97).

Jürgen Dix, Teodor C. Przymusinski, Luís Moniz Pereira

Proceedings of the Logic Programming, 1997

1996

Belief Revision in Non-Monotonic Reasoning and Logic Programming.

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski

Fundam. Informaticae, 1996

Prolegomena to Logic Programming for Non-monotonic Reasoning.

Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski

Proceedings of the Non-Monotonic Extensions of Logic Programming, 1996

Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming.

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

Super Logic Programs and Negation as Belief.

Teodor C. Przymusinski

Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

1995

Static Semantics for Normal and Disjunctive Logic Programs.

Teodor C. Przymusinski

Ann. Math. Artif. Intell., 1995

Loop Checking and the Wll-Founded Semantics.

Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

Belief Revision in Non-Monotonic Reasoning.

José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski

Proceedings of the Progress in Artificial Intelligence, 1995

1994

Stationary Default Extensions.

Halina Przymusinska, Teodor C. Przymusinski

Fundam. Informaticae, 1994

Well-founded and Stationary Models of Logic Programs.

Teodor C. Przymusinski

Ann. Math. Artif. Intell., 1994

Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework.

Teodor C. Przymusinski

Proceedings of the Non-Monotonic Extensions of Logic Programming (NMELP'94), 1994

Autoepistemic Logic of Minimal Beliefs.

Teodor C. Przymusinski

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

Semantics of Disjunctive Programs: A Unifying Approach.

Teodor C. Przymusinski

Proceedings of the Innovationen bei Rechen- und Kommunikationssystemen, Eine Herausforderung für die Informatik, 24. GI-Jahrestagung im Rahmen des 13th World Computer Congress, IFIP Congress '94, Hamburg, 28. August, 1994

A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs.

Teodor C. Przymusinski

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1992

Two Simple Characterizations of Well-Founded Semantics.

Teodor C. Przymusinski

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Soundness and Completeness of Partial Deductions for Well-Founded Semantics.

Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki

Proceedings of the Logic Programming and Automated Reasoning, 1992

1991

Stable Semantics for Disjunctive Programs.

Teodor C. Przymusinski

New Gener. Comput., 1991

Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs.

Teodor C. Przymusinski

Artif. Intell., 1991

Non-Monotonic Reasoning and Logic Programming.

Teodor C. Przymusinski

Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Autoepistemic Logics of Closed Beliefs and Logic Programming.

Teodor C. Przymusinski

Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

Well-Founded Completions of Logic Programs.

Teodor C. Przymusinski

Proceedings of the Logic Programming, 1991

Semantics of Disjunctive Logic Programs and Deductive Databases.

Teodor C. Przymusinski

Proceedings of the Deductive and Object-Oriented Databases, 1991

1990

On the relationship between CWA, minimal model, and minimal herbrand model semantics.

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski

Int. J. Intell. Syst., 1990

The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics.

Teodor C. Przymusinski

Fundam. Inform., 1990

Stationary Semantics for Disjunctive Logic Programs and Deductive Databases.

Teodor C. Przymusinski

Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs.

Teodor C. Przymusinski

Proceedings of the Workshop Logic Programming and Non-Monotonic Logic, 1990

Extended Stable Semantics for Normal and Disjunctive Programs.

Teodor C. Przymusinski

Proceedings of the Logic Programming, 1990

1989

On the Declarative and Procedural Semantics of Logic Programs.

Teodor C. Przymusinski

J. Autom. Reason., 1989

An Algorithm to Compute Circumscription.

Teodor C. Przymusinski

Artif. Intell., 1989

On the Relationship Between Circumscription and Negation as Failure.

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski

Artif. Intell., 1989

On Constructive Negation in Logic Programming.

Teodor C. Przymusinski

Proceedings of the Logic Programming, 1989

Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model.

Teodor C. Przymusinski

Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming.

Teodor C. Przymusinski

Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Non-Monotonic Formalisms and Logic Programming.

Teodor C. Przymusinski

Proceedings of the Logic Programming, 1989

1988

Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics.

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the Methodologies for Intelligent Systems, 1988

Perfect Model Semantics.

Teodor C. Przymusinski

Proceedings of the Logic Programming, 1988

Weakly Perfect Model Semantics for Logic Programs.

Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the Logic Programming, 1988

On the Relationship Between Logic Programming and Nonmonotonic Reasoning.

Teodor C. Przymusinski

Proceedings of the 7th National Conference on Artificial Intelligence, 1988

On the Declarative Semantics of Deductive Databases and Logic Programs.

Teodor C. Przymusinski

Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1986

The Extended Closed World Assumpution and its Relationship to Parallel Circumscription.

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

A decidable query answering algorithm for circumscriptive theories.

Teodor C. Przymusinski

Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, 1986

Query Answering in Circumscriptive and Closed-World Theories.

Teodor C. Przymusinski

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986