Algorithmic logic with recursive functions. - Andrzej Szalas (Fundam. Informaticae, 1981)

A note on PCI: distributed processes communicating by interrupts. - Uwe Petermann; Andrzej Szalas (ACM SIGPLAN Notices, 1985)

Exception handling in parallel computations. - Andrzej Szalas; Danuta Szczepanska (ACM SIGPLAN Notices, 1985)

Concerning the Semantic Consequence Relation in First-Order Temporal Logic. - Andrzej Szalas (Theor. Comput. Sci., 1986)

Arithmetical Axiomatization of First-Order Temporal Logic. - Andrzej Szalas (Inf. Process. Lett., 1987)

A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time. - Andrzej Szalas (Theor. Comput. Sci., 1987)

Propositional Description of Finite Cause-Effect Structures. - Leszek Holenderski; Andrzej Szalas (Inf. Process. Lett., 1988)

An Incompleteness Result in Process Algebra. - Andrzej Szalas (Inf. Process. Lett., 1988)

Incompleteness of First-Order Temporal Logic with Until. - Andrzej Szalas; Leszek Holenderski (Theor. Comput. Sci., 1988)

On Strictly Arithmetical Completeness in Logics of Programs. - Andrzej Szalas (Theor. Comput. Sci., 1991)

Axiomatizing Fixpoint Logics. - Andrzej Szalas (Inf. Process. Lett., 1992)

On the Correspondence between Modal and Classical Logic: An Automated Approach. - Andrzej Szalas (J. Log. Comput., 1993)

On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. - Andrzej Szalas (J. Appl. Non Class. Logics, 1994)

Computing Circumscription Revisited: Preliminary Report. - Patrick Doherty 001; Witold Lukaszewicz; Andrzej Szalas (IJCAI, 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)

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

On Natural Deduction in First-Ortder Fixpoint Logics. - Andrzej Szalas (Fundam. Informaticae, 1996)

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)

Meta-Queries on Deductive Databases. - Patrick Doherty 001; Jaroslaw Kachniarz; Andrzej Szalas (Fundam. Informaticae, 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)

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)

Second-Order Quantifier Elimination in Modal Contexts. - Andrzej Szalas (JELIA, 2002)

On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. - Andrzej Szalas (FCT, 2003)

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)

Towards a Logical Analysis of Biochemical Reactions. - Patrick Doherty 001; Steve Kertes; Martin Magnusson 001; Andrzej Szalas (ECAI, 2004)

Towards a Logical Analysis of Biochemical Pathways. - Patrick Doherty 001; Steve Kertes; Martin Magnusson 001; Andrzej Szalas (JELIA, 2004)

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

On the Correspondence between Approximations and Similarity. - Patrick Doherty 001; Andrzej Szalas (Rough Sets and Current Trends in Computing, 2004)

Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases. - Patrick Doherty 001; Jaroslaw Kachniarz; Andrzej Szalas (Rough-Neural Computing: Techniques for Computing with Words, 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)

Quantifier Elimination in Elementary Set Theory. - Ewa Orlowska; Andrzej Szalas (RelMiCS, 2005)

A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. - Michal Grabowski; Andrzej Szalas (AWIC, 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)

On the Fixpoint Theory of Equality and Its Applications. - Andrzej Szalas; Jerzy Tyszkiewicz (RelMiCS, 2006)

Approximate databases: a support tool for approximate reasoning. - Patrick Doherty 001; Martin Magnusson 001; Andrzej Szalas (J. Appl. Non Class. Logics, 2006)

Second-order reasoning in description logics. - Andrzej Szalas (J. Appl. Non Class. Logics, 2006)

Towards Approximate BGI Systems. - Barbara Dunin-Keplicz; Andrzej Szalas (CEEMAS, 2007)

Dynamics of Approximate Information Fusion. - Patrick Doherty 001; Barbara Dunin-Keplicz; Andrzej Szalas (RSEISP, 2007)

A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. - Patrick Doherty 001; Andrzej Szalas (Fundam. Informaticae, 2007)

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

Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. - Dov M. Gabbay; Andrzej Szalas (Stud Logica, 2007)

A Four-Valued Logic for Rough Set-Like Approximate Reasoning. - Jan Maluszynski; Andrzej Szalas; Aida Vitória (Trans. Rough Sets, 2007)

Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications. - Dov M. Gabbay; Renate A. Schmidt; Andrzej Szalas (College Publications, 2008)

Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. - Patrick Doherty 001; Andrzej Szalas (KR, 2008)

Paraconsistent Logic Programs with Four-Valued Rough Sets. - Jan Maluszynski; Andrzej Szalas; Aida Vitória (RSCTC, 2008)

Four-Valued Extension of Rough Sets. - Aida Vitória; Andrzej Szalas; Jan Maluszynski (RSKT, 2008)

Towards incorporating background theories into quantifier elimination. - Andrzej Szalas (J. Appl. Non Class. Logics, 2008)

Paraconsistent Reasoning with Words. - Alicja S. Szalas; Andrzej Szalas (Aspects of Natural Language Processing, 2009)

A Tableau Calculus for Regular Grammar Logics with Converse. - Linh Anh Nguyen; Andrzej Szalas (CADE, 2009)

ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC mathcal{ALC}. - Linh Anh Nguyen; Andrzej Szalas (ICCCI, 2009)

Fusing Approximate Knowledge from Distributed Sources. - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (IDC, 2009)

Optimal Tableau Decision Procedures for PDL - Linh Anh Nguyen; Andrzej Szalas (CoRR, 2009)

Modeling and Reasoning with Paraconsistent Rough Sets. - Aida Vitória; Jan Maluszynski; Andrzej Szalas (Fundam. Informaticae, 2009)

Voting by Eliminating Quantifiers. - Dov M. Gabbay; Andrzej Szalas (Stud Logica, 2009)

Annotation Theories over Finite Graphs. - Dov M. Gabbay; Andrzej Szalas (Stud Logica, 2009)

Living with Inconsistency and Taming Nonmonotonicity. - Jan Maluszynski; Andrzej Szalas (Datalog, 2010)

Three-Valued Paraconsistent Reasoning for Semantic Web Agents. - Linh Anh Nguyen; Andrzej Szalas (KES-AMSTA (1), 2010)

On the Correctness of Rough-Set Based Approximate Reasoning. - Patrick Doherty 001; Andrzej Szalas (RSCTC, 2010)

A layered rule-based architecture for approximate knowledge fusion? - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (Comput. Sci. Inf. Syst., 2010)

A Framework for Graded Beliefs, Goals and Intentions. - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (Fundam. Informaticae, 2010)

Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. - Linh Anh Nguyen; Andrzej Szalas (Fundam. Informaticae, 2010)

Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (Int. J. Approx. Reason., 2010)

Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. - Linh Anh Nguyen; Andrzej Szalas (Trans. Comput. Collect. Intell., 2010)

Tractable model checking for fragments of higher-order coalition logic. - Patrick Doherty 001; Barbara Dunin-Keplicz; Andrzej Szalas (AAMAS, 2011)

On the Web Ontology Rule Language OWL 2 RL. - Son Thanh Cao; Linh Anh Nguyen; Andrzej Szalas (ICCCI (1), 2011)

Contextual Coalitional Games. - Patrick Doherty 001; Tomasz P. Michalak; Jacek Sroka; Andrzej Szalas (ICLA, 2011)

WORL: A Web Ontology Rule Language. - Son Thanh Cao; Linh Anh Nguyen; Andrzej Szalas (KSE, 2011)

Converse-PDL with regular inclusion axioms: a framework for MAS logics. - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (J. Appl. Non Class. Logics, 2011)

Logical foundations and complexity of 4QL, a query language with unrestricted negation. - Jan Maluszynski; Andrzej Szalas (J. Appl. Non Class. Logics, 2011)

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. - Linh Anh Nguyen; Andrzej Szalas (Stud Logica, 2011)

Distributed Paraconsistent Belief Fusion. - Barbara Dunin-Keplicz; Andrzej Szalas (IDC, 2012)

Epistemic Profiles and Belief Structures. - Barbara Dunin-Keplicz; Andrzej Szalas (KES-AMSTA, 2012)

Temporal Composite Actions with Constraints. - Patrick Doherty 001; Jonas Kvarnström; Andrzej Szalas (KR, 2012)

Concept Learning for Description Logic-Based Information Systems. - Thanh-Luong Tran; Quang-Thuy Ha; Thi-Lan-Giao Hoang; Linh Anh Nguyen; Hung Son Nguyen; Andrzej Szalas (KSE, 2012)

A bisimulation-based method of concept learning for knowledge bases in description logics. - Quang-Thuy Ha; Thi-Lan-Giao Hoang; Linh Anh Nguyen; Hung Son Nguyen; Andrzej Szalas; Thanh-Luong Tran (SoICT, 2012)

Paraconsistent Reasoning for Semantic Web Agents. - Linh Anh Nguyen; Andrzej Szalas (Trans. Comput. Collect. Intell., 2012)

Agents in Approximate Environments. - Barbara Dunin-Keplicz; Andrzej Szalas (Games, Actions and Social Software, 2012)

Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity. - Barbara Dunin-Keplicz; Linh Anh Nguyen; Andrzej Szalas (ICCCI, 2013)

Perceiving Speech Acts under Incomplete and Inconsistent Information. - Barbara Dunin-Keplicz; Alina Strachocka; Andrzej Szalas; Rineke Verbrugge (KES-AMSTA, 2013)

Partiality and Inconsistency in Agents' Belief Bases. - Jan Maluszynski; Andrzej Szalas (KES-AMSTA, 2013)

On the Horn Fragments of Serial Regular Grammar Logics with Converse. - Linh Anh Nguyen; Andrzej Szalas (KES-AMSTA, 2013)

On Horn Knowledge Bases in Regular Description Logic with Inverse. - Linh Anh Nguyen; Thi-Bich-Loc Nguyen; Andrzej Szalas (KSE (1), 2013)

HornDL: An Expressive Horn Description Logic with PTime Data Complexity. - Linh Anh Nguyen; Thi-Bich-Loc Nguyen; Andrzej Szalas (RR, 2013)

Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination. - Patrick Doherty 001; Andrzej Szalas (Fundam. Informaticae, 2013)

How an agent might think. - Andrzej Szalas (Log. J. IGPL, 2013)

Taming Complex Beliefs. - Barbara Dunin-Keplicz; Andrzej Szalas (Trans. Comput. Collect. Intell., 2013)

Logic-Based Roughification. - Linh Anh Nguyen; Andrzej Szalas (Rough Sets and Intelligent Systems (1), 2013)

Tractable Reasoning about Group Beliefs. - Barbara Dunin-Keplicz; Andrzej Szalas; Rineke Verbrugge (EMAS@AAMAS, 2014)

Symbolic Explanations of Generalized Fuzzy Reasoning. - Andrzej Szalas (IDT/IIMSS/STET, 2014)

Indeterministic Belief Structures. - Barbara Dunin-Keplicz; Andrzej Szalas (KES-AMSTA, 2014)

Lightweight Reasoning with Incomplete and Inconsistent Information: A Case Study. - Lukasz Bialek; Andrzej Szalas (WI-IAT (3), 2014)

The Web Ontology Rule Language OWL 2 RL + and Its Extensions. - Son Thanh Cao; Linh Anh Nguyen; Andrzej Szalas (Trans. Comput. Collect. Intell., 2014)

WORL: a nonmonotonic rule language for the semantic web. - Son Thanh Cao; Linh Anh Nguyen; Andrzej Szalas (Vietnam. J. Comput. Sci., 2014)

Stability, Supportedness, Minimality and Kleene Answer Set Programs. - Patrick Doherty 001; Andrzej Szalas (Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015)

Towards richer rule languages with polynomial data complexity for the Semantic Web. - Linh Anh Nguyen; Thi-Bich-Loc Nguyen; Andrzej Szalas (Data Knowl. Eng., 2015)

Paraconsistent semantics of speech acts. - Barbara Dunin-Keplicz; Alina Strachocka; Andrzej Szalas; Rineke Verbrugge (Neurocomputing, 2015)

Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract). - Patrick Doherty 001; Jonas Kvarnström; Andrzej Szalas (JELIA, 2016)

An Entailment Procedure for Kleene Answer Set Programs. - Patrick Doherty 001; Andrzej Szalas (MIWAI, 2016)

Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments. - Lukasz Bialek; Barbara Dunin-Keplicz; Andrzej Szalas (IDC, 2017)

Rule-Based Reasoning with Belief Structures. - Lukasz Bialek; Barbara Dunin-Keplicz; Andrzej Szalas (ISMIS, 2017)

Heterogeneous Approximate Reasoning with Graded Truth Values. - Francesco Luca De Angelis; Giovanna Di Marzo Serugendo; Barbara Dunin-Keplicz; Andrzej Szalas (IJCRS (1), 2017)

Belief Shadowing. - Lukasz Bialek; Barbara Dunin-Keplicz; Andrzej Szalas (EMAS@AAMAS, 2018)

Paraconsistent Rule-based Reasoning with Graded Truth Values. - Francesco Luca De Angelis; Giovanna Di Marzo Serugendo; Andrzej Szalas (FLAP, 2018)

Decision-Making Support Using Nonmonotonic Probabilistic Reasoning. - Andrzej Szalas (KES-IDT (1), 2019)

Doxastic Group Reasoning via Multiple Belief Shadowing. - Barbara Dunin-Keplicz; Inga Rüb; Andrzej Szalas (PRIMA, 2019)

A paraconsistent approach to actions in informationally complex environments. - Lukasz Bialek; Barbara Dunin-Keplicz; Andrzej Szalas (Ann. Math. Artif. Intell., 2019)

Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis. - Jacek Szklarski; Lukasz Bialek; Andrzej Szalas (Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2019)

Shadowing in Many-Valued Nested Structures. - Barbara Dunin-Keplicz; Andrzej Szalas (ISMVL, 2020)

A Framework for Organization-Centered Doxastic Reasoning. - Barbara Dunin-Keplicz; Andrzej Szalas (KES, 2020)

Revisiting Object-Rule Fusion in Query Languages. - Andrzej Szalas (KES, 2020)

Rough Forgetting. - Patrick Doherty 001; Andrzej Szalas (IJCRS, 2020)

A Paraconsistent ASP-Like Language with Tractable Model Generation. - Andrzej Szalas (FLAP, 2020)

On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More. - Andrzej Szalas (J. Multiple Valued Log. Soft Comput., 2020)

Optimization Models for Medical Procedures Relocation. - Linh Anh Nguyen; Andrzej Szalas (KES, 2021)

Many-Valued Dynamic Object-Oriented Inheritance and Approximations. - Andrzej Szalas (IJCRS, 2021)

Rough set reasoning using answer set programs. - Patrick Doherty 001; Andrzej Szalas (Int. J. Approx. Reason., 2021)

Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions. - Andrzej Szalas (ICCCI, 2022)

Inheriting and Fusing Beliefs of Logically Heterogeneous Objects. - Andrzej Szalas (KES, 2022)

A landscape and implementation framework for probabilistic rough sets using ProbLog. - Patrick Doherty 001; Andrzej Szalas (Inf. Sci., 2022)

Techniques for Measuring the Inferential Strength of Forgetting Policies. - Patrick Doherty 001; Andrzej Szalas (CoRR, 2024)

Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions. - Patrick Doherty 001; Andrzej Szalas (Artif. Intell., 2024)

Logics from rough sets. - Mohua Banerjee; Mihir K. Chakraborty; Andrzej Szalas (J. Appl. Non Class. Logics, 2024)

Modeling and shadowing paraconsistent BDI agents. - Barbara Dunin-Keplicz; Andrzej Szalas (Ann. Math. Artif. Intell., 2024)