default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTeodor C. Przymusinski
Person information
- affiliation: University of California, Riverside, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
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) - [c40]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: 325-341 - [c39]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: 20-38 - 2001
- [j17]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
- [j16]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) - [c38]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]Stefan Brass, Jürgen Dix, Teodor C. Przymusinski:
Super Logic Programs. CoRR cs.AI/0010032 (2000)
1990 – 1999
- 1999
- [j15]Stefan Brass, Jürgen Dix, Teodor C. Przymusinski:
Computation of the Semantics of Autoepistemic Belief Theories. Artif. Intell. 112(1-2): 233-250 (1999) - [c37]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 - [c36]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
- [j14]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski:
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming. J. Autom. Reason. 20(1): 107-142 (1998) - [c35]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 - [c34]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 - [c33]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:
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 [contents] - 1997
- [j13]Teodor C. Przymusinski:
Autoepistemic Logic of Knowledge and Beliefs. Artif. Intell. 95(1): 115-154 (1997) - [j12]Teodor C. Przymusinski, Hudson Turner:
Update by Means of Inference Rules. J. Log. Program. 30(2): 125-143 (1997) - [c32]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:
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 [contents] - 1996
- [j11]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): 1-22 (1996) - [c31]Teodor C. Przymusinski:
Super Logic Programs and Negation as Belief. ELP 1996: 229-235 - [c30]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 - [c29]Stefan Brass, Jürgen Dix, Teodor C. Przymusinski:
Super Logic Programs. KR 1996: 529-540 - [c28]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski:
Prolegomena to Logic Programming for Non-monotonic Reasoning. NMELP 1996: 1-36 - 1995
- [j10]Teodor C. Przymusinski:
Static Semantics for Normal and Disjunctive Logic Programs. Ann. Math. Artif. Intell. 14(2-4): 323-357 (1995) - [c27]José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski:
Belief Revision in Non-Monotonic Reasoning. EPIA 1995: 40-56 - [c26]Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk:
Loop Checking and the Wll-Founded Semantics. LPNMR 1995: 127-142 - [c25]Teodor C. Przymusinski, Hudson Turner:
Update by Means of Inference Rules. LPNMR 1995: 156-174 - [e1]Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski:
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 [contents] - 1994
- [j9]Teodor C. Przymusinski:
Well-founded and Stationary Models of Logic Programs. Ann. Math. Artif. Intell. 12(3-4): 141-187 (1994) - [j8]Halina Przymusinska, Teodor C. Przymusinski:
Stationary Default Extensions. Fundam. Informaticae 21(1/2): 67-87 (1994) - [c24]Teodor C. Przymusinski:
A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. AAAI 1994: 952-958 - [c23]Teodor C. Przymusinski:
Semantics of Disjunctive Programs: A Unifying Approach. GI Jahrestagung 1994: 52 - [c22]Teodor C. Przymusinski:
Autoepistemic Logic of Minimal Beliefs. JELIA 1994: 364 - [c21]Teodor C. Przymusinski:
Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. NMELP 1994: 43-67 - 1992
- [c20]Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki:
Soundness and Completeness of Partial Deductions for Well-Founded Semantics. LPAR 1992: 1-12 - [c19]Teodor C. Przymusinski:
Two Simple Characterizations of Well-Founded Semantics. MFCS 1992: 451-462 - 1991
- [j7]Teodor C. Przymusinski:
Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs. Artif. Intell. 49(1-3): 309-343 (1991) - [j6]Teodor C. Przymusinski:
Stable Semantics for Disjunctive Programs. New Gener. Comput. 9(3/4): 401-424 (1991) - [c18]Teodor C. Przymusinski:
Semantics of Disjunctive Logic Programs and Deductive Databases. DOOD 1991: 85-107 - [c17]Teodor C. Przymusinski:
Well-Founded Completions of Logic Programs. ICLP 1991: 726-741 - [c16]Teodor C. Przymusinski:
Autoepistemic Logics of Closed Beliefs and Logic Programming. LPNMR 1991: 3-20 - [c15]Teodor C. Przymusinski:
Non-Monotonic Reasoning and Logic Programming. ISLP 1991: 735-736 - 1990
- [j5]Teodor C. Przymusinski:
The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics. Fundam. Inform. 13(4): 445-463 (1990) - [j4]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): 549-564 (1990) - [c14]Teodor C. Przymusinski:
Extended Stable Semantics for Normal and Disjunctive Programs. ICLP 1990: 459-477 - [c13]Teodor C. Przymusinski:
Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. LPNMR 1990: 103-106 - [c12]Teodor C. Przymusinski:
Stationary Semantics for Disjunctive Logic Programs and Deductive Databases. NACLP 1990: 40-59
1980 – 1989
- 1989
- [j3]Teodor C. Przymusinski:
An Algorithm to Compute Circumscription. Artif. Intell. 38(1): 49-73 (1989) - [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. Reason. 5(2): 167-205 (1989) - [c11]Teodor C. Przymusinski:
Non-Monotonic Formalisms and Logic Programming. ICLP 1989: 655-674 - [c10]Teodor C. Przymusinski:
Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. KR 1989: 341-348 - [c9]Teodor C. Przymusinski:
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. PODS 1989: 11-21 - [c8]Teodor C. Przymusinski:
On Constructive Negation in Logic Programming. NACLP 1989: 0-0 - 1988
- [c7]Teodor C. Przymusinski:
On the Relationship Between Logic Programming and Nonmonotonic Reasoning. AAAI 1988: 444-448 - [c6]Teodor C. Przymusinski:
Perfect Model Semantics. ICLP/SLP 1988: 1081-1096 - [c5]Halina Przymusinska, Teodor C. Przymusinski:
Weakly Perfect Model Semantics for Logic Programs. ICLP/SLP 1988: 1106-1120 - [c4]Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski:
Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. ISMIS 1988: 435-443 - [p1]Teodor C. Przymusinski:
On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216 - 1986
- [c3]Teodor C. Przymusinski:
Query Answering in Circumscriptive and Closed-World Theories. AAAI 1986: 186-190 - [c2]Teodor C. Przymusinski:
A decidable query answering algorithm for circumscriptive theories. ISMIS 1986: 85-93 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
