Dynamic updates of non-monotonic knowledge bases JJ Alferes, JA Leite, LM Pereira, H Przymusinska, TC Przymusinski The journal of logic programming 45 (1-3), 43-70, 2000 | 265 | 2000 |
On the relationship between circumscription and negation as failure M Gelfond, H Przymusinska, T Przymusinski Artificial Intelligence 38 (1), 75-94, 1989 | 219 | 1989 |
Disjunctive defaults M Gelfond, V Lifschitz, H Przymusinska, M Truszczynski Proc. Second International Conf. on Principles of Knowledge Representation …, 1991 | 210 | 1991 |
Semantic issues in deductive databases and logic programs H Przymusinska Formal techniques in artificial intelligence: A sourcebook, 321-367, 1990 | 186 | 1990 |
Dynamic logic programming JJ Alferes, JA Leite, LM Pereira, H Przymusinska, TC Przymusinski KR 98, 98-109, 1998 | 151 | 1998 |
LUPS—A language for updating logic programs JJ Alferes, LM Pereira, H Przymusinska, TC Przymusinski Artificial Intelligence 138 (1-2), 87-116, 2002 | 143 | 2002 |
Weakly Perfect Model Semantics for Logic Programs. H Przymusinska, TC Przymusinski ICLP/SLP, 1106-1120, 1988 | 106 | 1988 |
The extended closed world assumption and its relationship to parallel circumscription M Gelfond, H Przymusinska, T Przymusinski Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of …, 1985 | 100 | 1985 |
Negation as failure: Careful closure procedure M Gelfond, H Przymusinska Artificial Intelligence 30 (3), 273-287, 1986 | 86 | 1986 |
Weakly stratified logic programs H Przymusinska, TC Przymusinski Fundamenta Informaticae 13 (1), 51-65, 1990 | 67 | 1990 |
Stationary default extensions H Przymusinska, TC Przymusinski Fundamenta Informaticae 21 (1/2), 67-87, 1994 | 60 | 1994 |
Formalization of inheritance reasoning in autoepistemic logic M Gelfond, H Przymusinska Fundamenta Informaticae 13 (4), 403-443, 1990 | 45 | 1990 |
Reasoning in open domains M Gelfond, H Przymusinska | 42 | 1993 |
Preliminary exploration on actions as updates. JJ Alferes, LM Pereira, TC Przymusinski, H Przymusinska, P Quaresma APPIA-GULP-PRODE, 259-272, 1999 | 32 | 1999 |
Definitions in Epistemic Specifications. M Gelfond, H Przymusinska LPNMR, 245-259, 1991 | 32 | 1991 |
Towards a theory of elaboration tolerance: Logic programming approach M Gelfond, H Przymusinska International Journal of Software Engineering and Knowledge Engineering 6 …, 1996 | 28 | 1996 |
On consistency and completeness of autoepistemic theories M Gelfond, H Przymusinska Fundamenta Informaticae 16 (1), 59-92, 1992 | 22 | 1992 |
On the relationship between CWA, minimal model, and minimal Herbrand model semantics M Gelfond, H Przymusinska, T Przymusinski International Journal of Intelligent Systems 5 (5), 549-564, 1990 | 20 | 1990 |
Soundness and completeness of partial deductions for well-founded semantics H Przymusinska, T Przymusinski, H Seki International Conference on Logic for Programming Artificial Intelligence …, 1992 | 17 | 1992 |
Inheritance hierarchies and autoepistemic logic H Przymusinska, M Gelfond Intl. Symposium on Methodologies for Intelligent Systems (ISMIS), 1989 | 15 | 1989 |