default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWitold Lukaszewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j13]Michal Korpusik, Witold Lukaszewicz
, Ewa Madalinska-Bugaj:
Consistency-based Revision of Structured Belief Bases. Fundam. Informaticae 136(4): 381-404 (2015)- 2012
- [c33]Michal Korpusik, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Revising Structured Knowledge Bases. FedCSIS 2012: 81-87
2000 – 2009
- 2009
- [j12]Ewa Madalinska-Bugaj, Witold Lukaszewicz:
First-order Generalization of the MPMA Belief Update Operator. Fundam. Informaticae 94(1): 49-61 (2009) - 2008
- [c32]Ewa Madalinska-Bugaj, Witold Lukaszewicz:
Extending Knowledge Base Update into First-Order Knowledge Bases. IEA/AIE 2008: 631-640 - 2007
- [j11]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Communication between agents with heterogeneous perceptual capabilities. Inf. Fusion 8(1): 56-69 (2007) - 2006
- [b2]Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas:
Knowledge Representation Techniques - A Rough Set Approach. Studies in Fuzziness and Soft Computing 202, Springer 2006, ISBN 978-3-540-33518-4, pp. 3-320 [contents] - 2005
- [c31]Ewa Madalinska-Bugaj, Witold Lukaszewicz:
Belief Revision Revisited. MICAI 2005: 31-40 - [c30]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Similarity, Approximations and Vagueness. RSFDGrC (1) 2005: 541-550 - 2004
- [c29]Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz:
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. KR 2004: 459-468 - [p1]Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szalas:
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge. Rough-Neural Computing: Techniques for Computing with Words 2004: 189-218 - 2003
- [j10]Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas:
Towards a Framework for Approximate Ontologies. Fundam. Informaticae 57(2-4): 147-165 (2003) - [j9]Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas:
Preface. Fundam. Informaticae 57(2-4) (2003) - [j8]Ewa Madalinska-Bugaj, Witold Lukaszewicz:
Formalizing Defeasible Logic in CAKE. Fundam. Informaticae 57(2-4): 193-213 (2003) - [c28]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Tolerance Spaces and Approximative Representational Structures. KI 2003: 475-489 - [c27]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Information Granules for Intelligent Knowledge Structures. RSFDGrC 2003: 405-412 - 2002
- [c26]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
CAKE: A Computer-Aided Knowledge Engineering Technique. ECAI 2002: 220-224 - 2001
- [c25]Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Lazy Knowledge Base Update. IEA/AIE 2001: 61-70 - [c24]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. IJCAI 2001: 145-154 - 2000
- [j7]Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
The PMA and Relativizing Minimal Change for Action Update. Fundam. Informaticae 44(1-2): 95-131 (2000) - [c23]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Efficient Reasoning Using the Local Closed-World Assumption. AIMSA 2000: 49-58
1990 – 1999
- 1999
- [j6]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999) - [c22]Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Computing MPMA Updates Using Dijkstra's Semantics. ISMIS 1999: 271-281 - 1998
- [j5]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription and its Effective Reductions. Fundam. Informaticae 36(1): 23-55 (1998) - [c21]Patrick Doherty, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
The PMA and Relativizing Minimal Change for Action Update. KR 1998: 258-269 - 1997
- [j4]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reason. 18(3): 297-336 (1997) - [c20]Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Reasoning about Plans. IJCAI 1997: 1215-1220 - 1996
- [j3]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Informaticae 28(3-4): 261-271 (1996) - [c19]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription in its First-Order Reduction. FAPR 1996: 93-109 - [c18]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Explaining Explanation Closure. ISMIS 1996: 521-530 - [c17]Janusz Jablonowski, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Reasoning about Action and Change: Defeasible Observations and Actions with Abnormal Effects. KI 1996: 135-147 - 1995
- [c16]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508 - [c15]Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report. IJCAI 1995: 1950-1955 - [c14]Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Reasoning about Action and Change: Actions with Abnormal Effects. KI 1995: 209-220 - 1994
- [c13]Patrick Doherty, Witold Lukaszewicz:
Cicumscribing Features and Fluents. ICTL 1994: 82-100 - [c12]Patrick Doherty, Witold Lukaszewicz:
Circumscribing Features and Fluents: A Fluent Logic for Reasoning about Action and Change. ISMIS 1994: 521-530 - [c11]Witold Lukaszewicz, Ewa Madalinska-Bugaj:
Program Verification Techniques as a Tool for Reasoning about Action and Change. KI 1994: 226-236 - [c10]Barbara Dunin-Keplicz, Janusz Jablonowski, Witold Lukaszewicz, Ewa Madalinska-Bugaj:
CAProDel: a system for computer aided program development. SEKE 1994: 470-477 - 1992
- [j2]Patrick Doherty, Witold Lukaszewicz:
NML3. A Non-Monotonic Logic with Explicit Defaults. J. Appl. Non Class. Logics 2(1) (1992) - [c9]Patrick Doherty, Witold Lukaszewicz:
FONML3 - A First-Order Non-monotonic Logic with Explicit Defaults. ECAI 1992: 294-298 - [c8]Patrick Doherty, Witold Lukaszewicz:
Defaults as First-Class Citizens. ISMVL 1992: 146-154 - 1990
- [b1]Witold Lukaszewicz:
Non-monotonic reasoning - formalization of commonsense reasoning. Ellis Horwood 1990, ISBN 978-0-13-624446-2, pp. 1-328
1980 – 1989
- 1988
- [j1]Witold Lukaszewicz:
Considerations on default logic: an alternative approach. Comput. Intell. 4: 1-16 (1988) - [c7]Witold Lukaszewicz:
Chronological Minimization of Abnormality: Simple Theories of Action. ECAI 1988: 574-576 - 1986
- [c6]Barbara Dunin-Keplicz, Witold Lukaszewicz:
Towards Discourse-Oriented Nonmonotonic System. COLING 1986: 504-506 - [c5]Witold Lukaszewicz:
Minimization of Abnormality: A Simple System for Default Reasoning. ECAI 1986: 175-182 - 1985
- [c4]Witold Lukaszewicz:
Two Results on Default Logic. IJCAI 1985: 459-461 - 1984
- [c3]Witold Lukaszewicz:
Nonmonotonic Logic for Default Theories. ECAI 1984: 403-412 - [c2]Witold Lukaszewicz:
Considerations on Default Logic. NMR 1984: 165-193 - 1983
- [c1]Witold Lukaszewicz:
General Approach to Nonmonotonic Logics. IJCAI 1983: 352-354
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
