The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Witold Lukaszewicz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Witold Lukaszewicz
    Two Results on Default Logic. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1985, pp:459-461 [Conf]
  2. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Efficient Reasoning Using the Local Closed-World Assumption. [Citation Graph (0, 0)][DBLP]
    AIMSA, 2000, pp:49-58 [Conf]
  3. Barbara Dunin-Keplicz, Witold Lukaszewicz
    Towards Discourse-Oriented Nonmonotonic System. [Citation Graph (0, 0)][DBLP]
    COLING, 1986, pp:504-506 [Conf]
  4. Patrick Doherty, Witold Lukaszewicz
    FONML3 - A First-Order Non-monotonic Logic with Explicit Defaults. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:294-298 [Conf]
  5. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    CAKE: A Computer-Aided Knowledge Engineering Technique. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:220-224 [Conf]
  6. Witold Lukaszewicz
    Nonmonotonic Logic for Default Theories. [Citation Graph (0, 0)][DBLP]
    ECAI, 1984, pp:403-412 [Conf]
  7. Witold Lukaszewicz
    Minimization of Abnormality: A Simple System for Default Reasoning. [Citation Graph (0, 0)][DBLP]
    ECAI, 1986, pp:175-182 [Conf]
  8. Witold Lukaszewicz
    Chronological Minimization of Abnormality: Simple Theories of Action. [Citation Graph (0, 0)][DBLP]
    ECAI, 1988, pp:574-576 [Conf]
  9. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    General Domain Circumscription in its First-Order Reduction. [Citation Graph (0, 0)][DBLP]
    FAPR, 1996, pp:93-109 [Conf]
  10. Patrick Doherty, Witold Lukaszewicz
    Cicumscribing Features and Fluents. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:82-100 [Conf]
  11. Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Lazy Knowledge Base Update. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2001, pp:61-70 [Conf]
  12. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:145-154 [Conf]
  13. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Circumscription Revisited: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1502-1508 [Conf]
  14. Witold Lukaszewicz
    General Approach to Nonmonotonic Logics. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1983, pp:352-354 [Conf]
  15. Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1950-1955 [Conf]
  16. Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Reasoning about Plans. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1997, pp:1215-1220 [Conf]
  17. Patrick Doherty, Witold Lukaszewicz
    Circumscribing Features and Fluents: A Fluent Logic for Reasoning about Action and Change. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1994, pp:521-530 [Conf]
  18. Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Computing MPMA Updates Using Dijkstra's Semantics. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1999, pp:271-281 [Conf]
  19. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Explaining Explanation Closure. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1996, pp:521-530 [Conf]
  20. Patrick Doherty, Witold Lukaszewicz
    Defaults as First-Class Citizens. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1992, pp:146-154 [Conf]
  21. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Tolerance Spaces and Approximative Representational Structures. [Citation Graph (0, 0)][DBLP]
    KI, 2003, pp:475-489 [Conf]
  22. Janusz Jablonowski, Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Reasoning about Action and Change: Defeasible Observations and Actions with Abnormal Effects. [Citation Graph (0, 0)][DBLP]
    KI, 1996, pp:135-147 [Conf]
  23. Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Program Verification Techniques as a Tool for Reasoning about Action and Change. [Citation Graph (0, 0)][DBLP]
    KI, 1994, pp:226-236 [Conf]
  24. Witold Lukaszewicz, Ewa Madalinska-Bugaj
    Reasoning about Action and Change: Actions with Abnormal Effects. [Citation Graph (0, 0)][DBLP]
    KI, 1995, pp:209-220 [Conf]
  25. Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj
    The PMA and Relativizing Minimal Change for Action Update. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:258-269 [Conf]
  26. Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz
    Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:459-468 [Conf]
  27. Ewa Madalinska-Bugaj, Witold Lukaszewicz
    Belief Revision Revisited. [Citation Graph (0, 0)][DBLP]
    MICAI, 2005, pp:31-40 [Conf]
  28. Witold Lukaszewicz
    Considerations on Default Logic. [Citation Graph (0, 0)][DBLP]
    NMR, 1984, pp:165-193 [Conf]
  29. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Information Granules for Intelligent Knowledge Structures. [Citation Graph (0, 0)][DBLP]
    RSFDGrC, 2003, pp:405-412 [Conf]
  30. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Similarity, Approximations and Vagueness. [Citation Graph (0, 0)][DBLP]
    RSFDGrC (1), 2005, pp:541-550 [Conf]
  31. Barbara Dunin-Keplicz, Janusz Jablonowski, Witold Lukaszewicz, Ewa Madalinska-Bugaj
    CAProDel: a system for computer aided program development. [Citation Graph (0, 0)][DBLP]
    SEKE, 1994, pp:470-477 [Conf]
  32. Witold Lukaszewicz
    Considerations on default logic: an alternative approach. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1988, v:4, n:, pp:1-16 [Journal]
  33. Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas
    Towards a Framework for Approximate Ontologies. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:147-165 [Journal]
  34. Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj
    The PMA and Relativizing Minimal Change for Action Update. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:44, n:1-2, pp:95-131 [Journal]
  35. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    A Reduction Result for Circumscribed Semi-Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:3-4, pp:261-271 [Journal]
  36. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    General Domain Circumscription and its Effective Reductions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:1, pp:23-55 [Journal]
  37. Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas
    Preface. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:- [Journal]
  38. Ewa Madalinska-Bugaj, Witold Lukaszewicz
    Formalizing Defeasible Logic in CAKE. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:193-213 [Journal]
  39. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Communication between agents with heterogeneous perceptual capabilities. [Citation Graph (0, 0)][DBLP]
    Information Fusion, 2007, v:8, n:1, pp:56-69 [Journal]
  40. Patrick Doherty, Witold Lukaszewicz
    NML3. A Non-Monotonic Logic with Explicit Defaults. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1992, v:2, n:1, pp:- [Journal]
  41. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Computing Circumscription Revisited: A Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1997, v:18, n:3, pp:297-336 [Journal]
  42. Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
    Declarative PTIME Queries for Relational Databases using Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:5, pp:737-758 [Journal]

  43. Extending Knowledge Base Update into First-Order Knowledge Bases. [Citation Graph (, )][DBLP]


Search in 0.299secs, Finished in 0.302secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002