Остановите войну!
for scientists:
default search action
Andrzej Szalas
- > Home > Persons > Andrzej Szalas
Publications
- 2024
- [j55]Patrick Doherty, Andrzej Szalas:
Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions. Artif. Intell. 326: 104036 (2024) - 2023
- [i4]Patrick Doherty, Andrzej Szalas:
Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions. CoRR abs/2305.07233 (2023) - 2022
- [j54]Patrick Doherty, Andrzej Szalas:
A landscape and implementation framework for probabilistic rough sets using ProbLog. Inf. Sci. 593: 546-576 (2022) - 2021
- [j53]Patrick Doherty, Andrzej Szalas:
Rough set reasoning using answer set programs. Int. J. Approx. Reason. 130: 126-149 (2021) - 2020
- [c59]Patrick Doherty, Andrzej Szalas:
Rough Forgetting. IJCRS 2020: 3-18 - 2016
- [c52]Patrick Doherty, Jonas Kvarnström, Andrzej Szalas:
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract). JELIA 2016: 536-542 - [c51]Patrick Doherty, Andrzej Szalas:
An Entailment Procedure for Kleene Answer Set Programs. MIWAI 2016: 24-37 - 2015
- [c50]Patrick Doherty, Andrzej Szalas:
Stability, Supportedness, Minimality and Kleene Answer Set Programs. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 125-140 - 2013
- [j43]Patrick Doherty, Andrzej Szalas:
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination. Fundam. Informaticae 127(1-4): 135-149 (2013) - 2012
- [c37]Patrick Doherty, Jonas Kvarnström, Andrzej Szalas:
Temporal Composite Actions with Constraints. KR 2012 - 2011
- [c34]Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas:
Tractable model checking for fragments of higher-order coalition logic. AAMAS 2011: 743-750 - [c32]Patrick Doherty, Tomasz P. Michalak, Jacek Sroka, Andrzej Szalas:
Contextual Coalitional Games. ICLA 2011: 65-78 - 2010
- [c28]Patrick Doherty, Andrzej Szalas:
On the Correctness of Rough-Set Based Approximate Reasoning. RSCTC 2010: 327-336 - 2008
- [c23]Patrick Doherty, Andrzej Szalas:
Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. KR 2008: 560-570 - 2007
- [j27]Patrick Doherty, Andrzej Szalas:
A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. Fundam. Informaticae 75(1-4): 179-193 (2007) - [j26]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Communication between agents with heterogeneous perceptual capabilities. Inf. Fusion 8(1): 56-69 (2007) - [c19]Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas:
Dynamics of Approximate Information Fusion. RSEISP 2007: 668-677 - 2006
- [b1]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] - [j23]Patrick Doherty, Martin Magnusson, Andrzej Szalas:
Approximate databases: a support tool for approximate reasoning. J. Appl. Non Class. Logics 16(1-2): 87-118 (2006) - 2005
- [c15]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Similarity, Approximations and Vagueness. RSFDGrC (1) 2005: 541-550 - 2004
- [c14]Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas:
Towards a Logical Analysis of Biochemical Reactions. ECAI 2004: 997-998 - [c13]Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas:
Towards a Logical Analysis of Biochemical Pathways. JELIA 2004: 667-679 - [c12]Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz:
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. KR 2004: 459-468 - [c11]Patrick Doherty, Andrzej Szalas:
On the Correspondence between Approximations and Similarity. Rough Sets and Current Trends in Computing 2004: 143-152 - [p2]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 - [p1]Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas:
Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases. Rough-Neural Computing: Techniques for Computing with Words 2004: 219-250 - 2003
- [j21]Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas:
Towards a Framework for Approximate Ontologies. Fundam. Informaticae 57(2-4): 147-165 (2003) - [j20]Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas:
Preface. Fundam. Informaticae 57(2-4) (2003) - [c9]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Tolerance Spaces and Approximative Representational Structures. KI 2003: 475-489 - [c8]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Information Granules for Intelligent Knowledge Structures. RSFDGrC 2003: 405-412 - 2002
- [c7]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
CAKE: A Computer-Aided Knowledge Engineering Technique. ECAI 2002: 220-224 - 2001
- [c5]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. IJCAI 2001: 145-154 - 2000
- [c4]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Efficient Reasoning Using the Local Closed-World Assumption. AIMSA 2000: 49-58 - 1999
- [j19]Patrick Doherty, Jaroslaw Kachniarz, Andrzej Szalas:
Meta-Queries on Deductive Databases. Fundam. Informaticae 40(1): 7-30 (1999) - [j18]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999) - 1998
- [j17]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription and its Effective Reductions. Fundam. Informaticae 36(1): 23-55 (1998) - 1997
- [j16]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reason. 18(3): 297-336 (1997) - 1996
- [j14]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Informaticae 28(3-4): 261-271 (1996) - [c3]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription in its First-Order Reduction. FAPR 1996: 93-109 - [c2]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Explaining Explanation Closure. ISMIS 1996: 521-530 - 1995
- [c1]Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508
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-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint