Publikacje

Andrzej Szałas

Liczba publikacji: 161

2024

• Mohua Banerjee, Mihir K. Chakraborty, Andrzej Szałas , Logics from rough sets, Journal of Applied Non-Classical Logics, 34 (2-3) 2024, s. 171-173. Zobacz w PBN

2023

• Patrick Doherty, Andrzej Szałas , Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions, Artificial Intelligence, 2023, s. 104036. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Modeling and shadowing paraconsistent BDI agents, ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2023. Zobacz w PBN

2022

• Patrick Doherty, Andrzej Szałas , A landscape and implementation framework for probabilistic rough sets using ProbLog, Information Sciences, 593 2022, s. 546-576. Zobacz w PBN
• Andrzej Szałas , Inheriting and Fusing Beliefs of Logically Heterogeneous Objects, Procedia Computer Science, 207 2022, s. 299-308. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Modeling and Shadowing Paraconsistent BDI Agents, Engineering Multiagent Systems, Auckland, New Zealand, 9 maja 2022 - 10 maja 2022. Zobacz w PBN

2021

• Andrzej Szałas , Many-Valued Dynamic Object-Oriented Inheritance and Approximations, Lecture Notes in Computer Science, International Joint Conference on Rough Sets IJCRS 2021, Bratislava, Slovakia, 19 września 2021 - 24 września 2021, 12872 2021, s. 103-119. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Optimization Models for Medical Procedures Relocation, Procedia Computer Science, 192 2021, s. 2058-2067. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Rough set reasoning using answer set programs, International Journal of Approximate Reasoning, 130 2021, s. 126-149. Zobacz w PBN

2020

• Barbara Dunin-Kęplicz , Andrzej Szałas , A Framework for Organization-Centered Doxastic Reasoning, Procedia Computer Science, 176 2020, s. 3019-3028. Zobacz w PBN
• Andrzej Szałas , A Paraconsistent ASP-like Language with Tractable Model Generation, Journal of Applied Logics-IfCoLoG Journal of Logics and their Applications, 7 (3) 2020, s. 361-389. Zobacz w PBN
• Andrzej Szałas , On the Probability and Cost of Ignorance, Inconsistency, Nonsense and More, JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 34 (5-6) 2020, s. 423-450. Zobacz w PBN
• Andrzej Szałas , Revisiting Object-Rule Fusion in Query Languages, Procedia Computer Science, 176 2020, s. 50-59. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Rough Forgetting, International Joint Conference on Rough Sets IJCRS 2020, Havana, Cuba, 29 czerwca 2020 - 3 lipca 2020, 12179 2020, s. 3-18. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Shadowing in Many-Valued Nested Structures, 50th IEEE International Symposium on Multiple-Valued Logic, Miyazaki, Japan, 9 listopada 2020 - 11 listopada 2020. Zobacz w PBN

2019

• Łukasz Białek, Barbara Dunin-Kęplicz , Andrzej Szałas , A paraconsistent approach to actions in informationally complex environments, ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 86 (4) 2019, s. pages 231–255. Zobacz w PBN
• Łukasz Białek, Barbara Dunin-Kęplicz , Andrzej Szałas , Belief Shadowing, Engineering Multiagent Systems, Stockholm, Sweden, 14 lipca 2018 - 15 lipca 2018. Zobacz w PBN
• Andrzej Szałas , Decision-Making Support Using Nonmonotonic Probabilistic Reasoning, 11th KES International Conference on Intelligent Decision Technologies, St. Julian’s, Malta, 17 czerwca 2019 - 19 czerwca 2019, 1 2019, s. 39-51. Zobacz w PBN
• Barbara Dunin-Kęplicz , Inga Rüb, Andrzej Szałas , Doxastic Group Reasoning via Multiple Belief Shadowing, 22nd International Conference on Principles and Practice of Multi-Agent Systems, Torino, Italy, 28 października 2019 - 31 października 2019. Zobacz w PBN
• Łukasz Białek, Andrzej Szałas , Jacek Szklarski, Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis, International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems, 2019. Zobacz w PBN

2018

• Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Andrzej Szałas , Paraconsistent Rule-Based Reasoning with Graded Truth Values, Journal of Applied Logic, 5 (1) 2018, s. 185-220. Zobacz w PBN

2017

• Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Barbara Dunin-Kęplicz , Andrzej Szałas , Heterogeneous Approximate Reasoning with Graded Truth Values, Rough Sets : International Joint Conference 2017, Olsztyn, Poland, 2 lipca 2017 - 6 lipca 2017. Zobacz w PBN
• Łukasz Białek, Barbara Dunin-Kęplicz , Andrzej Szałas , Rule-Based Reasoning with Belief Structures, International Symposium on Methodologies for Intelligent Systems - Foundations of Intelligent Systems, Warszawa, Poland, 26 czerwca 2017 - 29 czerwca 2017. Zobacz w PBN
• Łukasz Białek, Barbara Dunin-Kęplicz , Andrzej Szałas , Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments, IDC: International Symposium on Intelligent and Distributed Computing, Belgrad, Serbia, 11 października 2017 - 13 października 2017. Zobacz w PBN

2016

• Patrick Doherty, Andrzej Szałas , An Entailment Procedure for Kleene Answer Set Programs, Multi-disciplinary Trends in Artificial Intelligence, Thailand, 2016. Zobacz w PBN
• Patrick Doherty, Jonas Kvarnström, Andrzej Szałas , Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, 15th European Conference on Logics in Artificial Intelligence, Larnaca, Cyprus, 2016. Zobacz w PBN

2015

• Barbara Dunin-Kęplicz , Andrzej Szałas , A New Perspective on Goals, The Facts Matter: Essays on Logic and Cognition in Honour of Rineke Verbrugge, 2015. Zobacz w PBN
• Barbara Dunin-Kęplicz , Alina Strachocka, Andrzej Szałas , Rineke Verbrugge, Paraconsistent semantics of speech acts, Neurocomputing, 2015. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Stability, Supportedness, Minimality and Kleene Answer Set Programs, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015. Zobacz w PBN
• Anh Linh Nguyen , Thi-Bich-Loc Nguyen, Andrzej Szałas , Towards richer rule languages with polynomial data complexity for the Semantic Web, Data and Knowledge Engineering, 2015. Zobacz w PBN

2014

• Anh Linh Nguyen , Thi-Bich-Loc Nguyen, Andrzej Szałas , A Horn Fragment with PTime Data Complexity of Regular Description Logic with Inverse, VNU Journal of Science: Computer Science and Communication Engineering, 30 (4) 2014, s. 14-28. Zobacz w PBN
• Łukasz Białek, Marta Borkowska, Adam Borkowski, Barbara Dunin-Kęplicz , Michał Gnatowski, Andrzej Szałas , Jacek Szklarski, Coordinating multiple rescue robots, Prace Naukowe Politechniki Warszawskiej. Elektronika, 13 Krajowa Konferencja Robotyki, (194) 2014, s. 185-196. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Indeterministic Belief Structures, Agent and Multi-Agent Systems: Technologies and Applications, 2014. Zobacz w PBN
• Łukasz Białek, Andrzej Szałas , Lightweight Reasoning with Incomplete and Inconsistent Information: a Case Study, Web Intelligence (WI) and Intelligent Agent Technologies (IAT), 2014 IEEE/WIC/ACM International Joint Conferences, 2014. Zobacz w PBN
• Anh Linh Nguyen , Thi-Bich-Loc Nguyen, Andrzej Szałas , On Horn Knowledge Bases in Regular Description Logic with Inverse, 2014. Zobacz w PBN
• Andrzej Szałas , Symbolic Explanations of Generalized Fuzzy Reasoning., Intelligent Decision Technologies 2014, 2014. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Andrzej Szałas , The Web Ontology Rule Language OWL 2 RL+ and Its Extensions, LNCS Transactions on Computational Collective Intelligence, 2014. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Rineke Verbrugge, Tractable Reasoning about Group Beliefs, Second International Workshop, EMAS 2014, 2014. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Andrzej Szałas , WORL: a nonmonotonic rule language for the semantic web, Vietnam Journal of Computer Science, 2014. Zobacz w PBN

2013

• Patrick Doherty, Andrzej Szałas , Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination, Fundamenta Informaticae, 2013. Zobacz w PBN
• Anh Linh Nguyen , Thi-Bich-Loc Nguyen, Andrzej Szałas , Horn-DL: An Expressive Horn Description Logic with PTime Data Complexity, RR'2013: 7th International Conference on Web Reasoning and Rule Systems, 2013. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity, 5th International Conference on Computational Collective Intelligence Technologies and Applications, 2013. Zobacz w PBN
• Andrzej Szałas , How an Agent Might Think, Logic Journal of the IGPL, 2013. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , On the Horn Fragments of Serial Regular Grammar Logics with Converse, 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA), Hue, Viet Nam, Viet Nam, 27 maja 2013 - 29 maja 2013. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Paraconsistent Distributed Belief Fusion, 6th International Symposium on Intelligent Distributed Computing, 2013. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Partiality and Inconsistency in Agents' Belief Bases, 7th KES Conference on Agent and Multi-Agent Systems – Technologies and Applications, 2013. Zobacz w PBN
• Barbara Dunin-Kęplicz , Alina Strachocka, Andrzej Szałas , Rineke Verbrugge, Perceiving Speech Acts under Incomplete and Inconsistent Information, 7th KES Conference on Agent and Multi-Agent Systems – Technologies and Applications, 2013. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Taming Complex Beliefs, LNCS Transactions on Computational Collective Intelligence, 2013. Zobacz w PBN

2012

• Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen , Hung Son Nguyen , Andrzej Szałas , Thanh-Luong Tran, A bisimulation-based method of concept learning for knowledge bases in description logics, SoICT 2012 - 3rd International Symposium on Information and Communication Technology, 2012. Zobacz w PBN
• Barbara Dunin-Kęplicz , Alina Strachocka, Andrzej Szałas , Rineke Verbrugge, A Paraconsistent Approach to Speech Acts, 9th International Workshop on Argumentation in Multi-Agent Systems, 2012. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Agents in Approximate Environments, 2012. Zobacz w PBN
• Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen , Hung Son Nguyen , Andrzej Szałas , Thanh-Luong Tran, Concept learning for description logic-based information systems, KSE 2012 - International Conference on Knowledge and Systems Engineering, 2012. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Epistemic Profiles and Belief Structures, 6th International KES Conference on Agents and Multi-agent Systems – Technologies and Applications, 2012. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Logic-Based Roughification, 2012. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Paraconsistent Reasoning for Semantic Web Agents, LNCS Transactions on Computational Collective Intelligence, 2012. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription., KR: International Conference on the Principles of Knowledge Representation and Reasoning, 2012. Zobacz w PBN
• Patrick Doherty, Jonas Kvarnström, Andrzej Szałas , Temporal Composite Actions with Constraints, KR: International Conference on the Principles of Knowledge Representation and Reasoning, 2012. Zobacz w PBN

2011

• Patrick Doherty, Tomasz Michalak , Jacek Sroka , Andrzej Szałas , Contextual Coalitional Games, Lecture Notes in Computer Science, 4th Indian Conference on Logic and its Applications, 2011. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics, Journal of Applied Non-Classical Logics, 2011. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse, Studia Logica, 2011. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation, Journal of Applied Non-Classical Logics, 2011. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Andrzej Szałas , On the Web Ontology Rule Language OWL 2 RL, Lecture Notes in Computer Science, 2011. Zobacz w PBN
• Krzysztof Diks , Marcin Engel, Jerzy Gawinecki, Jan Madey, Andrzej Szałas , Wojciech Cellary, Zenon Gniazdowski, Piotr Sienkiewicz, Maciej Sysło, Ryszard Tadeusiewicz, Podstawy algorytmiki. Zastosowania informatyki, 1 2011. Zobacz w PBN
• Patrick Doherty, Barbara Dunin-Kęplicz , Andrzej Szałas , Tractable Model Checking for Fragments of Higher-Order Coalition Logic, 10th International Conference on Autonomous Agents and Multiagent Systems, 2011. Zobacz w PBN
• Son Thanh Cao, Anh Linh Nguyen , Andrzej Szałas , WORL: a Web Ontology Rule Language, KSE 2011 - International Conference on Knowledge and Systems Engineering, 2011. Zobacz w PBN

2010

• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , A Framework for Graded Beliefs, Goals and Intentions, Fundamenta Informaticae, 2010. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , A Layered Rule-Based Architecture for Approximate Knowledge Fusion, Computer Science and Information Systems, 2010. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, Fundamenta Informaticae, 2010. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , Graded Beliefs, Goals and Intentions, 2010. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , On the Correctness of Rough-Set Based Approximate Reasoning, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH, LNCS Transactions on Computational Collective Intelligence, 2010. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Three-Valued Paraconsistent Reasoning for Semantic Web Agents, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , Tractable Approximate Knowledge Fusion Using the Horn Fragment of Serial Propositional Dynamic Logic, International Journal of Approximate Reasoning, 2010. Zobacz w PBN

2009

• Linh Anh Nguyen, Andrzej Szałas , A Tableau Calculus for Regular Grammar Logics with Converse, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , An Optimal Tableau Decision Procedure for Converse-PDL, 2009. Zobacz w PBN
• Dov M. Gabbay, Andrzej Szałas , Annotation Theories over Finite Graphs, Studia Logica, 2009. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, 2009. Zobacz w PBN
• Anh Linh Nguyen , Andrzej Szałas , ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , Fusing Approximate Knowledge from Distributed Sources, 2009. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Aida Vitória, Modeling and Reasoning with Paraconsistent Rough Sets, Fundamenta Informaticae, 2009. Zobacz w PBN
• Alicja Szałas, Andrzej Szałas , Paraconsistent Reasoning with Words, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Dov M. Gabbay, Andrzej Szałas , Voting by Eliminating Quantifiers, Studia Logica, 2009. Zobacz w PBN

2008

• Jan Małuszyński, Andrzej Szałas , Aida Vitória, Four-Valued Extension of Rough Sets, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Jan Małuszyński, Andrzej Szałas , Aida Vitória, Paraconsistent Logic Programs with Four-Valued Rough Sets, Lecture Notes in Computer Science, 2008. Zobacz w PBN
• Dov M. Gabbay, Renate Schmidt, Andrzej Szałas , Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications, 2008. Zobacz w PBN
• Andrzej Szałas , Towards Incorporating Background Theories into Quantifier Elimination, Journal of Applied Non-Classical Logics, 2008. Zobacz w PBN

2007

• P. Doherty, Andrzej Szałas , A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, Fundamenta Informaticae, 2007. Zobacz w PBN
• Jan Maluszynski, Andrzej Szałas , Aida Vitória, A Four-Valued Logic for Rough Set-Like Approximate Reasoning, LECTURE NOTES IN COMPUTER SCIENCE TRANSACTIONS ON ROUGH SETS, 2007. Zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz, Andrzej Szałas , Communication between agents with heterogeneous perceptual capabilities, Information Fusion, 2007. Zobacz w PBN
• P. Doherty, Barbara Dunin-Kęplicz , Andrzej Szałas , Dynamics of Approximate Information Fusion, Lecture Notes in Computer Science, 2007. Zobacz w PBN
• D. Gabbay, Andrzej Szałas , Second-order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals, Studia Logica, 2007. Zobacz w PBN
• Barbara Dunin-Kęplicz , Andrzej Szałas , Towards Approximate BGI Systems, Lecture Notes in Computer Science, 2007. Zobacz w PBN

2006

• Ewa Orłowska, Alberto Policriti, Andrzej Szałas , Algebraic and relational deductive tools, 2006. Zobacz w PBN
• Patrick Doherty, Martin Magnusson, Andrzej Szałas , Approximate databases: a support tool for approximate reasoning, Journal of Applied Non-Classical Logics, 2006. Zobacz w PBN
• Patrick Doherty, Andrzej Skowron, Andrzej Szałas , Witold Łukaszewicz, Knowledge Representation Techniques: Rough Set Approach, 2006. Zobacz w PBN
• Andrzej Szałas , Jerzy Tyszkiewicz , On the Fixpoint Theory of Equality and its Applications, Lecture Notes in Computer Science, 2006. Zobacz w PBN
• Stella Orłowska, Andrzej Szałas , Quantifier Elimination in Elementary Set Theory, 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, 2006. Zobacz w PBN
• Andrzej Szałas , Second-order reasoning in description logics, Journal of Applied Non-Classical Logics, 2006. Zobacz w PBN

2005

• Michał Grabowski, Andrzej Szałas , A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies, Third International Atlantic Web IntelligenceConference, AWIC 2005, 2005. Zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz, Andrzej Szałas , Similarity, Approximations and Vagueness, 10th International Conference, RSFDGrC 2005, Regina, Canada, 2005. Zobacz w PBN

2004

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities, 7th International Conference on Information Fusion, 2004. Zobacz w PBN
• P. Doherty, Andrzej Skowron, Andrzej Szałas , Witold Łukaszewicz, Approximate transducers and trees: a technique for combining rough and crisp knowledge, 2004. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities, Principles of Knowledge Representation and Reasoning: the Ninth International Conference, 2004. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , On the Correspondence between Approximations and Similarity, 4th International Conference, RSCTC 2004, 2004. Zobacz w PBN
• Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szałas , Towards a Logical Analysis of Biochemical Pathways, 9th European Conference, JELIA 2004, 2004. Zobacz w PBN
• Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szałas , Towards a Logical Analysis of Biochemical Reactions, 16th Eureopean Conference on Artificial Intelligence, 2004. Zobacz w PBN
• Patrick Doherty, Jarosław Kachniarz, Andrzej Szałas , Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases, Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, S.K.Pal, L..Polkowski, A.Skowron (Eds), 2004. Zobacz w PBN

2003

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Information Granules for Intelligent Knowledge Structures, 9th International Conference, RSFDGrC 2003, 2003. Zobacz w PBN
• Andrzej Szałas , On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems, 14th International Symposium, FCT 2003, 2003. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, On Mutual Understanding among Communicating Agents, FAMAS'03, Workshop on Formal Approaches to Multi-agent Systems, 2003. Zobacz w PBN
• Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szałas , Preface, Fundamenta Informaticae, 2003. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Tolerance Spaces and Approximative Representational Structures, 26th Annual German Conference on AI, 2003. Zobacz w PBN
• P. Doherty, M. Grabowski, Andrzej Szałas , W. Łukaszewicz, Towards a Framework for Approximate Ontologies, Fundamenta Informaticae, 2003. Zobacz w PBN

2002

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, CAKE: A Computer-Aided Knowledge Engineering Technique, ECAI'15: 15th European Conference on Artificial Intelligence, 2002. Zobacz w PBN
• Andrzej Szałas , Second-Order Quantifier Elimination in Modal Contexts, 8th European Conference, JELIA 2002, 2002. Zobacz w PBN

2001

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas, Seventeenth International Joint Conference on Artificial Intelligence, 2001. Zobacz w PBN
• J. Kachniarz, Andrzej Szałas , On a Static Verification of Integrity Constraints in Relational Databases, 2001. Zobacz w PBN
• Stella Orłowska, Andrzej Szałas , Relational Methods for Computer Science Applications, 2001. Zobacz w PBN

2000

• P. Dohery, Andrzej Szałas , Witold Łukaszewicz, Efficient reasoning using the local closed-world assumption, Lecture Notes in Computer Science, 2000. Zobacz w PBN
• J Kachniarz, Andrzej Szałas , On rule-based approach to the construction of logical transformers, 2000. Zobacz w PBN

1999

• Andreas Nonnengart, Andrzej Szałas , A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, 1999. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Declarative PTIME Queries for Relational Databases using Quantifier Elimination, Journal of Logic and Computation, 1999. Zobacz w PBN
• Andreas Nonnengart, Hans Juergen Ohlbach, Andrzej Szałas , Elimination of Predicate Quantifiers, 1999. Zobacz w PBN
• P Doherty, J Kachniarz, Andrzej Szałas , Meta-queries on deductive databases, Fundamenta Informaticae, 1999. Zobacz w PBN

1998

• P. Doherty, Andrzej Szałas , Witold Łukaszewicz, General Domain Circumscription and its effective reductions, Fundamenta Informaticae, 1998. Zobacz w PBN
• Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik, Andrzej Szałas , Wnioskowanie w logikach nieklasycznych. Automatyzacja wnioskowania, 1998. Zobacz w PBN

1997

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Computing Circumscription Revisited, Journal of Automated Reasoning, 1997. Zobacz w PBN

1996

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae, 1996. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Explaining Explanation Closure, Foundations of Intelligent Systems, 9th International Symposium ISMIS, 1996. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, General Domain Circumscription in its First-Order Reduction, Practical Reasoning, International Conference on Formal and Applied Practical Reasoning, FAPR, 1996. Zobacz w PBN
• Wojciech Penczek, Andrzej Szałas , Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, 1996. Zobacz w PBN
• Andrzej Szałas , On Natural Deduction in First-Order Fixpoint Logics, Fundamenta Informaticae, 1996. Zobacz w PBN

1995

• Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, Computing Circumscription Revisited: Preliminary Report, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, 1995. Zobacz w PBN
• Andrzej Szałas , Temporal Logic: A Standard Approach, Time and Logic. A Computational Approach, 1995. Zobacz w PBN
• Leonard Bolc, Andrzej Szałas , Time and Logic. A Computational Approach, 1995. Zobacz w PBN
• Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik, Andrzej Szałas , Wnioskowanie w logikach nieklasycznych. Podstawy teoretyczne, 1995. Zobacz w PBN

1994

• Andrzej Szałas , Genetic Algorithms for Decision Problems, 6th International Conference on Artificial Intelligence and Information-Control Systems of Robots (AIICSR), 1994. Zobacz w PBN
• Andrzej Szałas , On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic, Journal of Applied Non-Classical Logics, 1994. Zobacz w PBN

1993

• Andrzej Szałas , On the Correspondence between Modal and Classical Logic: An Automated Approach, Journal of Logic and Computation, 1993. Zobacz w PBN

1992

• Andrzej Szałas , Axiomatizing Fixpoint Logics, Information Processing Letters, 1992. Zobacz w PBN
• Andrzej Szałas , Zarys dedukcyjnych metod automatycznego wnioskowania, 1992. Zobacz w PBN

1991

• Andrzej Szałas , Jolanta Warpechowska, Loglan, 1991. Zobacz w PBN
• Andrzej Szałas , On Strictly Arithmetical Completeness in Logics of Programs, Theoretical Computer Science, 1991. Zobacz w PBN

1989

• Uwe Petermann, Andrzej Szałas , On Temporal Logic for Distributed Systems and Its Application to Processes Communicating by Interrupts, Fundamenta Informaticae, 1989. Zobacz w PBN

1988

• Andrzej Szałas , An Incompleteness Result in Process Algebra, Information Processing Letters, 1988. Zobacz w PBN
• Leszek Holenderski, Andrzej Szałas , Incompleteness of First-Order Temporal Logic with Until, Theoretical Computer Science, 1988. Zobacz w PBN
• Leszek Holenderski, Andrzej Szałas , Propositional Description of Finite Cause-Effect Structures, Information Processing Letters, 1988. Zobacz w PBN
• Andrzej Szałas , Towards the Temporal Approach to Abstract Data Types, Fundamenta Informaticae, 1988. Zobacz w PBN

1987

• Andrzej Szałas , A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time, Theoretical Computer Science, 1987. Zobacz w PBN
• Jim R. Cunningham, Andreas Nonnengart, Andrzej Szałas , A Compositional Method for the Design and Proof of Asynchronous Processes, 4th Annual ESPRIT Conference, 1987. Zobacz w PBN
• Andrzej Szałas , Arithmetical Axiomatization of First-Order Temporal Logic, Information Processing Letters, 1987. Zobacz w PBN

1986

• Andrzej Szałas , Concerning the Semantic Consequence Relation in First-Order Temporal Logic, Theoretical Computer Science, 1986. Zobacz w PBN

1985

• Uwe Petermann, Andrzej Szałas , A Note on PCI - Distributed Processes Communicating by Interrupts, ACM SIGPLAN NOTICES, 1985. Zobacz w PBN
• Andrzej Szałas , Danuta Szczepańska, Exception Handling in Parallel Computations, ACM SIGPLAN NOTICES, 1985. Zobacz w PBN

1984

• Andrzej Szałas , On an Application of Algorithmic Theory of Stacks, Fundamenta Informaticae, 1984. Zobacz w PBN

1981

• Andrzej Szałas , Algorithmmic Logic with Recursive Functions, Fundamenta Informaticae, 1981. Zobacz w PBN

Inne

• Barbara Dunin-Kęplicz , Andrzej Szałas , A New Perspective on Goals, The Facts Matter: Essays on Logic and Cognition in Honour of Rineke Verbrugge, , s. 50-66. Zobacz w PBN
• Andrzej Szałas , Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions, Computational Collective Intelligence: 14th International Conference, ICCCI 2022, Hammamet, Tunisia, September 28–30, 2022, Proceedings, , s. 396-409. Zobacz w PBN
• Patrick Doherty, Andrzej Szałas , Signed Dual Tableaux for Kleene Answer Set Programs, Ewa Orłowska on Relational Methods in Logic and Computer Science, , s. 233-252. Zobacz w PBN
• Barbara Dunin-Kęplicz , Alina Powała, Andrzej Szałas , Variations on Jaśkowski’s Discursive Logic, The Lvov-Warsaw school: past and present, , s. 485-497. Zobacz w PBN