Andrzej Szalas

Linh Anh Nguyen, Andrzej Szalas: Paraconsistent Reasoning for Semantic Web Agents. T. Computational Collective Intelligence 6: 36-55 (2012)

Barbara Dunin-Keplicz, Andrzej Szalas: Epistemic Profiles and Belief Structures. KES-AMSTA 2012: 360-369

Patrick Doherty, Jonas Kvarnström, Andrzej Szalas: Temporal Composite Actions with Constraints. KR 2012

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

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

Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: Converse-PDL with regular inclusion axioms: a framework for MAS logics. Journal of Applied Non-Classical Logics 21(1): 61-91 (2011)

Jan Maluszynski, Andrzej Szalas: Logical foundations and complexity of 4QL, a query language with unrestricted negation. Journal of Applied Non-Classical Logics 21(2): 211-232 (2011)

Linh Anh Nguyen, Andrzej Szalas: ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse. Studia Logica 98(3): 387-428 (2011)

Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas: Tractable model checking for fragments of higher-order coalition logic. AAMAS 2011: 743-750

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

Patrick Doherty, Tomasz P. Michalak, Jacek Sroka, Andrzej Szalas: Contextual Coalitional Games. ICLA 2011: 65-78

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

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

Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: A Framework for Graded Beliefs, Goals and Intentions. Fundam. Inform. 100(1-4): 53-76 (2010)

Linh Anh Nguyen, Andrzej Szalas: Checking Consistency of an ABox w.r.t. Global Assumptions in PDL. Fundam. Inform. 102(1): 97-113 (2010)

Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reasoning 51(3): 346-362 (2010)

Linh Anh Nguyen, Andrzej Szalas: Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH. T. Computational Collective Intelligence 1: 21-38 (2010)

Jan Maluszynski, Andrzej Szalas: Living with Inconsistency and Taming Nonmonotonicity. Datalog 2010: 384-398

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

Patrick Doherty, Andrzej Szalas: On the Correctness of Rough-Set Based Approximate Reasoning. RSCTC 2010: 327-336

Jan Maluszynski, Andrzej Szalas: Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation. CoRR abs/1011.5105 (2010)

Aida Vitória, Jan Maluszynski, Andrzej Szalas: Modeling and Reasoning with Paraconsistent Rough Sets. Fundam. Inform. 97(4): 405-438 (2009)

Dov M. Gabbay, Andrzej Szalas: Voting by Eliminating Quantifiers. Studia Logica 92(3): 365-379 (2009)

Dov M. Gabbay, Andrzej Szalas: Annotation Theories over Finite Graphs. Studia Logica 93(2-3): 147-180 (2009)

Alicja S. Szalas, Andrzej Szalas: Paraconsistent Reasoning with Words. Aspects of Natural Language Processing 2009: 43-58

Linh Anh Nguyen, Andrzej Szalas: A Tableau Calculus for Regular Grammar Logics with Converse. CADE 2009: 421-436

Linh Anh Nguyen, Andrzej Szalas: ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC\mathcal{ALC}. ICCCI 2009: 437-448

Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas: Fusing Approximate Knowledge from Distributed Sources. IDC 2009: 75-86

Linh Anh Nguyen, Andrzej Szalas: Optimal Tableau Decision Procedures for PDL. CoRR abs/0904.0721 (2009)

Andrzej Szalas: Towards incorporating background theories into quantifier elimination. Journal of Applied Non-Classical Logics 18(2-3): 325-340 (2008)

Patrick Doherty, Andrzej Szalas: Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. KR 2008: 560-570

Jan Maluszynski, Andrzej Szalas, Aida Vitória: Paraconsistent Logic Programs with Four-Valued Rough Sets. RSCTC 2008: 41-51

Aida Vitória, Andrzej Szalas, Jan Maluszynski: Four-Valued Extension of Rough Sets. RSKT 2008: 106-114

Patrick Doherty, Andrzej Szalas: A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning. Fundam. Inform. 75(1-4): 179-193 (2007)

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Communication between agents with heterogeneous perceptual capabilities. Information Fusion 8(1): 56-69 (2007)

Dov M. Gabbay, Andrzej Szalas: Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. Studia Logica 87(1): 37-50 (2007)

Jan Maluszynski, Andrzej Szalas, Aida Vitória: A Four-Valued Logic for Rough Set-Like Approximate Reasoning. T. Rough Sets 6: 176-190 (2007)

Barbara Dunin-Keplicz, Andrzej Szalas: Towards Approximate BGI Systems. CEEMAS 2007: 277-287

Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szalas: Dynamics of Approximate Information Fusion. RSEISP 2007: 668-677

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

Patrick Doherty, Martin Magnusson, Andrzej Szalas: Approximate databases: a support tool for approximate reasoning. Journal of Applied Non-Classical Logics 16(1-2): 87-118 (2006)

Andrzej Szalas: Second-order reasoning in description logics. Journal of Applied Non-Classical Logics 16(3-4): 517-530 (2006)

Andrzej Szalas, Jerzy Tyszkiewicz: On the Fixpoint Theory of Equality and Its Applications. RelMiCS 2006: 388-401

Ewa Orlowska, Andrzej Szalas: Quantifier Elimination in Elementary Set Theory. RelMiCS 2005: 237-248

Michal Grabowski, Andrzej Szalas: A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. AWIC 2005: 183-189

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Similarity, Approximations and Vagueness. RSFDGrC (1) 2005: 541-550

Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas: Towards a Logical Analysis of Biochemical Reactions. ECAI 2004: 997-998

Patrick Doherty, Steve Kertes, Martin Magnusson, Andrzej Szalas: Towards a Logical Analysis of Biochemical Pathways. JELIA 2004: 667-679

Patrick Doherty, Andrzej Szalas, Witold Lukaszewicz: Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. KR 2004: 459-468

Patrick Doherty, Andrzej Szalas: On the Correspondence between Approximations and Similarity. Rough Sets and Current Trends in Computing 2004: 143-152

Patrick Doherty, Michal Grabowski, Witold Lukaszewicz, Andrzej Szalas: Towards a Framework for Approximate Ontologies. Fundam. Inform. 57(2-4): 147-165 (2003)

Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz, Andrzej Szalas: Preface. Fundam. Inform. 57(2-4) (2003)

Andrzej Szalas: On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems. FCT 2003: 423-431

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Tolerance Spaces and Approximative Representational Structures. KI 2003: 475-489

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Information Granules for Intelligent Knowledge Structures. RSFDGrC 2003: 405-412

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: CAKE: A Computer-Aided Knowledge Engineering Technique. ECAI 2002: 220-224

Andrzej Szalas: Second-Order Quantifier Elimination in Modal Contexts. JELIA 2002: 223-232

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. IJCAI 2001: 145-154

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Efficient Reasoning Using the Local Closed-World Assumption. AIMSA 2000: 49-58

Patrick Doherty, J. Kachniarz, Andrzej Szalas: Meta-Queries on Deductive Databases. Fundam. Inform. 40(1): 7-30 (1999)

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Declarative PTIME Queries for Relational Databases using Quantifier Elimination. J. Log. Comput. 9(5): 737-758 (1999)

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: General Domain Circumscription and its Effective Reductions. Fundam. Inform. 36(1): 23-55 (1998)

Ewa Orlowska, Andrzej Szalas (Eds.): Participants Copies for Relational Methods in Logic, Algebra and Computer Science, 4th International Seminar RelMiCS, Warsaw, Poland, Septermber 14-20, 1998. 1998

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: A Reduction Algorithm. J. Autom. Reasoning 18(3): 297-336 (1997)

Andrzej Szalas: On Natural Deduction in First-Ortder Fixpoint Logics. Fundam. Inform. 26(1): 81-94 (1996)

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: A Reduction Result for Circumscribed Semi-Horn Formulas. Fundam. Inform. 28(3-4): 261-271 (1996)

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: General Domain Circumscription in its First-Order Reduction. FAPR 1996: 93-109

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Explaining Explanation Closure. ISMIS 1996: 521-530

Wojciech Penczek, Andrzej Szalas (Eds.): Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings. Lecture Notes in Computer Science 1113, Springer 1996, isbn 3-540-61550-4

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas: Computing Circumscription Revisited: Preliminary Report. IJCAI 1995: 1502-1508

Andrzej Szalas: On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic. Journal of Applied Non-Classical Logics 4(2): 119-127 (1994)

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

Andrzej Szalas: Axiomatizing Fixpoint Logics. Inf. Process. Lett. 41(4): 175-180 (1992)

Andrzej Szalas: On Strictly Arithmetical Completeness in Logics of Programs. Theor. Comput. Sci. 79(2): 341-355 (1991)

Leszek Holenderski, Andrzej Szalas: Propositional Description of Finite Cause-Effect Structures. Inf. Process. Lett. 27(3): 111-117 (1988)

Andrzej Szalas: An Incompleteness Result in Process Algebra. Inf. Process. Lett. 29(2): 67-70 (1988)

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

Andrzej Szalas: Arithmetical Axiomatization of First-Order Temporal Logic. Inf. Process. Lett. 26(3): 111-116 (1987)

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

Andrzej Szalas: Concerning the Semantic Consequence Relation in First-Order Temporal Logic. Theor. Comput. Sci. 47(3): 329-334 (1986)

Andrzej Szalas: Algorithmic logic with recursive functions. Fundam. Inform. 4(4): 975-996 (1981)