General Approach to Nonmonotonic Logics. - Witold Lukaszewicz (IJCAI, 1983)

Nonmonotonic Logic for Default Theories. - Witold Lukaszewicz (ECAI, 1984)

Considerations on Default Logic. - Witold Lukaszewicz (NMR, 1984)

Two Results on Default Logic. - Witold Lukaszewicz (IJCAI, 1985)

Towards Discourse-Oriented Nonmonotonic System. - Barbara Dunin-Keplicz; Witold Lukaszewicz (COLING, 1986)

Minimization of Abnormality: A Simple System for Default Reasoning. - Witold Lukaszewicz (ECAI, 1986)

Chronological Minimization of Abnormality: Simple Theories of Action. - Witold Lukaszewicz (ECAI, 1988)

Considerations on default logic: an alternative approach. - Witold Lukaszewicz (Comput. Intell., 1988)

Non-monotonic reasoning - formalization of commonsense reasoning. - Witold Lukaszewicz (Ellis Horwood, 1990)

FONML3 - A First-Order Non-monotonic Logic with Explicit Defaults. - Patrick Doherty 001; Witold Lukaszewicz (ECAI, 1992)

Defaults as First-Class Citizens. - Patrick Doherty 001; Witold Lukaszewicz (ISMVL, 1992)

NML3. A Non-Monotonic Logic with Explicit Defaults. - Patrick Doherty 001; Witold Lukaszewicz (J. Appl. Non Class. Logics, 1992)

Cicumscribing Features and Fluents. - Patrick Doherty 001; Witold Lukaszewicz (ICTL, 1994)

Circumscribing Features and Fluents: A Fluent Logic for Reasoning about Action and Change. - Patrick Doherty 001; Witold Lukaszewicz (ISMIS, 1994)

Program Verification Techniques as a Tool for Reasoning about Action and Change. - Witold Lukaszewicz; Ewa Madalinska-Bugaj (KI, 1994)

CAProDel: a system for computer aided program development. - Barbara Dunin-Keplicz; Janusz Jablonowski; Witold Lukaszewicz; Ewa Madalinska-Bugaj (SEKE, 1994)

Computing Circumscription Revisited: Preliminary Report. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (IJCAI, 1995)

Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report. - Witold Lukaszewicz; Ewa Madalinska-Bugaj (IJCAI, 1995)

Reasoning about Action and Change: Actions with Abnormal Effects. - Witold Lukaszewicz; Ewa Madalinska-Bugaj (KI, 1995)

General Domain Circumscription in its First-Order Reduction. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (FAPR, 1996)

Explaining Explanation Closure. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (ISMIS, 1996)

Reasoning about Action and Change: Defeasible Observations and Actions with Abnormal Effects. - Janusz Jablonowski; Witold Lukaszewicz; Ewa Madalinska-Bugaj (KI, 1996)

A Reduction Result for Circumscribed Semi-Horn Formulas. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (Fundam. Informaticae, 1996)

Reasoning about Plans. - Witold Lukaszewicz; Ewa Madalinska-Bugaj (IJCAI, 1997)

Computing Circumscription Revisited: A Reduction Algorithm. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (J. Autom. Reason., 1997)

General Domain Circumscription and its Effective Reductions. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (Fundam. Informaticae, 1998)

Computing MPMA Updates Using Dijkstra's Semantics. - Patrick Doherty 001; Witold Lukaszewicz; Ewa Madalinska-Bugaj (ISMIS, 1999)

Declarative PTIME Queries for Relational Databases using Quantifier Elimination. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (J. Log. Comput., 1999)

Efficient Reasoning Using the Local Closed-World Assumption. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (AIMSA, 2000)

The PMA and Relativizing Minimal Change for Action Update. - Patrick Doherty 001; Witold Lukaszewicz; Ewa Madalinska-Bugaj (Fundam. Informaticae, 2000)

Lazy Knowledge Base Update. - Witold Lukaszewicz; Ewa Madalinska-Bugaj (IEA/AIE, 2001)

Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (IJCAI, 2001)

CAKE: A Computer-Aided Knowledge Engineering Technique. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (ECAI, 2002)

Tolerance Spaces and Approximative Representational Structures. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (KI, 2003)

Information Granules for Intelligent Knowledge Structures. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (RSFDGrC, 2003)

Towards a Framework for Approximate Ontologies. - Patrick Doherty 001; Michal Grabowski; Witold Lukaszewicz; Andrzej Szalas (Fundam. Informaticae, 2003)

Preface. - Patrick Doherty 001; Andrzej Skowron; Witold Lukaszewicz; Andrzej Szalas (Fundam. Informaticae, 2003)

Formalizing Defeasible Logic in CAKE. - Ewa Madalinska-Bugaj; Witold Lukaszewicz (Fundam. Informaticae, 2003)

Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. - Patrick Doherty 001; Andrzej Szalas; Witold Lukaszewicz (KR, 2004)

Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Skowron; Andrzej Szalas (Rough-Neural Computing: Techniques for Computing with Words, 2004)

Belief Revision Revisited. - Ewa Madalinska-Bugaj; Witold Lukaszewicz (MICAI, 2005)

Similarity, Approximations and Vagueness. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (RSFDGrC (1), 2005)

Knowledge Representation Techniques - A Rough Set Approach - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Skowron; Andrzej Szalas (Springer, 2006)

Communication between agents with heterogeneous perceptual capabilities. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (Inf. Fusion, 2007)

Extending Knowledge Base Update into First-Order Knowledge Bases. - Ewa Madalinska-Bugaj; Witold Lukaszewicz (IEA/AIE, 2008)

First-order Generalization of the MPMA Belief Update Operator. - Ewa Madalinska-Bugaj; Witold Lukaszewicz (Fundam. Informaticae, 2009)

Revising Structured Knowledge Bases. - Michal Korpusik; Witold Lukaszewicz; Ewa Madalinska-Bugaj (FedCSIS, 2012)

Consistency-based Revision of Structured Belief Bases. - Michal Korpusik; Witold Lukaszewicz; Ewa Madalinska-Bugaj (Fundam. Informaticae, 2015)