( en | de | ru )

 

Disambiguation of "Lukaszewicz, Witold"

Author of the publication

copydeleteadd this publication to your clipboard
The PMA and Relativizing Minimal Change for Action Update.

, , and . Fundam. Informaticae, 44 (1-2): 95-131 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ursula Lukaszewicz

Johannes Lukaszewicz

Witold Lesniak

Witold Ostapowicz

Witold Jeszke

 

Other publications of authors with the same name

Towards a Framework for Approximate Ontologies., , , and . Fundam. Informaticae, 57 (2-4): 147-165 (2003)A Reduction Result for Circumscribed Semi-Horn Formulas., , and . Fundam. Informaticae, 28 (3-4): 261-271 (1996)Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas., , and . IJCAI, page 145-154. Morgan Kaufmann, (2001)Reasoning about Action and Change: Actions with Abnormal Effects., and . KI, volume 981 of Lecture Notes in Computer Science, page 209-220. Springer, (1995)Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities., , and . KR, page 459-468. AAAI Press, (2004)Similarity, Approximations and Vagueness., , and . RSFDGrC (1), volume 3641 of Lecture Notes in Computer Science, page 541-550. Springer, (2005)Minimization of Abnormality: A Simple System for Default Reasoning.. ECAI, page 175-182. North-Holland, (1986)Lazy Knowledge Base Update., and . IEA/AIE, volume 2070 of Lecture Notes in Computer Science, page 61-70. Springer, (2001)Computing Circumscription Revisited: A Reduction Algorithm., , and . J. Autom. Reason., 18 (3): 297-336 (1997)Declarative PTIME Queries for Relational Databases using Quantifier Elimination., , and . J. Log. Comput., 9 (5): 737-758 (1999)