|
Search the dblp DataBase
Witold Lukaszewicz:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Witold Lukaszewicz
Two Results on Default Logic. [Citation Graph (1, 0)][DBLP] IJCAI, 1985, pp:459-461 [Conf]
- 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]
- Barbara Dunin-Keplicz, Witold Lukaszewicz
Towards Discourse-Oriented Nonmonotonic System. [Citation Graph (0, 0)][DBLP] COLING, 1986, pp:504-506 [Conf]
- 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]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
CAKE: A Computer-Aided Knowledge Engineering Technique. [Citation Graph (0, 0)][DBLP] ECAI, 2002, pp:220-224 [Conf]
- Witold Lukaszewicz
Nonmonotonic Logic for Default Theories. [Citation Graph (0, 0)][DBLP] ECAI, 1984, pp:403-412 [Conf]
- Witold Lukaszewicz
Minimization of Abnormality: A Simple System for Default Reasoning. [Citation Graph (0, 0)][DBLP] ECAI, 1986, pp:175-182 [Conf]
- Witold Lukaszewicz
Chronological Minimization of Abnormality: Simple Theories of Action. [Citation Graph (0, 0)][DBLP] ECAI, 1988, pp:574-576 [Conf]
- 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]
- Patrick Doherty, Witold Lukaszewicz
Cicumscribing Features and Fluents. [Citation Graph (0, 0)][DBLP] ICTL, 1994, pp:82-100 [Conf]
- Witold Lukaszewicz, Ewa Madalinska-Bugaj
Lazy Knowledge Base Update. [Citation Graph (0, 0)][DBLP] IEA/AIE, 2001, pp:61-70 [Conf]
- 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]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
Computing Circumscription Revisited: Preliminary Report. [Citation Graph (0, 0)][DBLP] IJCAI, 1995, pp:1502-1508 [Conf]
- Witold Lukaszewicz
General Approach to Nonmonotonic Logics. [Citation Graph (0, 0)][DBLP] IJCAI, 1983, pp:352-354 [Conf]
- 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]
- Witold Lukaszewicz, Ewa Madalinska-Bugaj
Reasoning about Plans. [Citation Graph (0, 0)][DBLP] IJCAI, 1997, pp:1215-1220 [Conf]
- 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]
- 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]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
Explaining Explanation Closure. [Citation Graph (0, 0)][DBLP] ISMIS, 1996, pp:521-530 [Conf]
- Patrick Doherty, Witold Lukaszewicz
Defaults as First-Class Citizens. [Citation Graph (0, 0)][DBLP] ISMVL, 1992, pp:146-154 [Conf]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
Tolerance Spaces and Approximative Representational Structures. [Citation Graph (0, 0)][DBLP] KI, 2003, pp:475-489 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- Ewa Madalinska-Bugaj, Witold Lukaszewicz
Belief Revision Revisited. [Citation Graph (0, 0)][DBLP] MICAI, 2005, pp:31-40 [Conf]
- Witold Lukaszewicz
Considerations on Default Logic. [Citation Graph (0, 0)][DBLP] NMR, 1984, pp:165-193 [Conf]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
Information Granules for Intelligent Knowledge Structures. [Citation Graph (0, 0)][DBLP] RSFDGrC, 2003, pp:405-412 [Conf]
- Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
Similarity, Approximations and Vagueness. [Citation Graph (0, 0)][DBLP] RSFDGrC (1), 2005, pp:541-550 [Conf]
- 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]
- Witold Lukaszewicz
Considerations on default logic: an alternative approach. [Citation Graph (0, 0)][DBLP] Computational Intelligence, 1988, v:4, n:, pp:1-16 [Journal]
- 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]
- 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]
- 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]
- 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]
- Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas
Preface. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2003, v:57, n:2-4, pp:- [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
Extending Knowledge Base Update into First-Order Knowledge Bases. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.304secs
|