Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Andrzej Szałas
2019
- Jacek Szklarski, Łukasz Sebastian Białek and Andrzej Szałas, Paraconsistent Reasoning in Cops and Robber Game with Uncertain Information: A Simulation-Based Analysis, International Journal Of Uncertainty Fuzziness And Knowledge-based Systems 27 (3) 2019, p. 429–455.see in PBN
- Łukasz Sebastian Białek, Barbara Dunin-Kęplicz and Andrzej Szałas, A paraconsistent approach to actions in informationally complex environments, Annals Of Mathematics And Artificial Intelligence 2019, p. 1–25.see in PBN
- Łukasz Sebastian Białek, Barbara Dunin-Kęplicz and Andrzej Szałas, Belief Shadowing, in: EMAS 2018: Engineering Multi-Agent Systems, Springer, Cham 2019, p. 158–180.see in PBN
- Andrzej Szałas, Decision-Making Support Using Nonmonotonic Probabilistic Reasoning, in: Intelligent Decision Technologies 2019 Proceedings of the 11th KES International Conference on Intelligent Decision Technologies (KES-IDT 2019), Volume 1, Springer, Singapore 2019, r. 4, p. 39–51.see in PBN
2018
- Francesco Luca De Angelis, Giovanna Di Marzo Serugendo and Andrzej Szałas, Paraconsistent Rule-Based Reasoning with Graded Truth Values, Journal Of Applied Logic 5 (1) 2018, p. 185–220.see in PBN
- Barbara Dunin-Kęplicz, Alina Powała and Andrzej Szałas, Variations on Jaśkowski’s Discursive Logic, in: The Lvov-Warsaw School. Past and Present, Birkhäuser, Cham, Birkhäuser Basel 2018, p. 485–497.see in PBN
- Patrick Doherty and Andrzej Szałas, Signed Dual Tableaux for Kleene Answer Set Programs, in: Ewa Orłowska on Relational Methods in Logic and Computer Science, Springer Nature Switzerland AG, 2018, r. 9, p. 233–252.see in PBN
2017
- Łukasz Białek, Barbara Dunin-Kęplicz and Andrzej Szałas, Rule-Based Reasoning with Belief Structures, in: Foundations of Intelligent Systems. 23rd International Symposium, ISMIS 2017, Warsaw, Poland, June 26-29, 2017, Proceedings, Springer, Cham 2017, p. 229–239.see in PBN
- Francesco Luca De Angelis, Giovanna Di Marzo Serugendo, Barbara Dunin-Kęplicz and Andrzej Szałas, Heterogeneous Approximate Reasoning with Graded Truth Values, in: Rough Sets. International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3–7, 2017, Proceedings, Part I, Springer, Cham, Switzerland 2017, p. 61–82.see in PBN
- Łukasz Białek, Barbara Dunin-Kęplicz and Andrzej Szałas, Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments, in: Intelligent Distributed Computing XI, Springer International Publishing, 2017, p. 49–60.see in PBN
2016
- Patrick Doherty, Jonas Kvarnström and Andrzej Szałas, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, in: Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Springer International Publishing, 2016, p. 536–542.see in PBN
- Patrick Doherty and Andrzej Szałas, An Entailment Procedure for Kleene Answer Set Programs, in: Multi-disciplinary Trends in Artificial Intelligence, Springer International Publishing, 2016, p. 24–37.see in PBN
2015
- Barbara Dunin-Kęplicz and Andrzej Szałas, A New Perspective on Goals, in: The Facts Matter: Essays on Logic and Cognition in Honour of Rineke Verbrugge, College Publicatons, UK 2015, p. 50–66.see in PBN
- Anh Linh Nguyen, Thi-Bich-Loc Nguyen and Andrzej Szałas, Towards richer rule languages with polynomial data complexity for the Semantic Web, Data & Knowledge Engineering 96-97 2015, p. 57–77.see in PBN
- Barbara Dunin-Kęplicz, Alina Strachocka, Andrzej Szałas and Rineke Verbrugge, Paraconsistent semantics of speech acts, Neurocomputing 151 (2) 2015, p. 943–952.see in PBN
- Patrick Doherty and Andrzej Szałas, Stability, Supportedness, Minimality and Kleene Answer Set Programs, in: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015, p. 125–140.see in PBN
2014
- Barbara Dunin-Kęplicz and Andrzej Szałas, Indeterministic Belief Structures, in: KES-AMSTA-14, Springer-Verlag, 2014, p. 57–66.see in PBN
- Son Thanh Cao, Anh Linh Nguyen and Andrzej Szałas, WORL: a nonmonotonic rule language for the semantic web, Vietnam Journal Of Computer Science 1 (1) 2014, p. 57–69.see in PBN
- Anh Linh Nguyen, Thi-Bich-Loc Nguyen and 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, p. 14–28.see in PBN
- Łukasz Białek and Andrzej Szałas, Lightweight Reasoning with Incomplete and Inconsistent Information: a Case Study, in: 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol. 3, IEEE, Los Alamitos, California 2014, p. 325–332.see in PBN
- Andrzej Szałas, Symbolic Explanations of Generalized Fuzzy Reasoning., in: Smart Digital Futures 2014, IOS PRESS, 2014, p. 7–16.see in PBN
- Barbara Dunin-Kęplicz, Andrzej Szałas and Rineke Verbrugge, Tractable Reasoning about Group Beliefs, in: Engineering Multi-Agent Systems, Springer-Verlag, 2014, p. 328–350.see in PBN
- Łukasz Białek, Marta Borkowska, Adam Borkowski, Barbara Dunin-Kęplicz, Michał Gnatowski, Andrzej Szałas and Jacek Szklarski, Coordinating multiple rescue robots, Prace Naukowe Politechniki Warszawskiej. Elektronika (194) 2014, p. 185–196.see in PBN
- Son Thanh Cao, Anh Linh Nguyen and Andrzej Szałas, The Web Ontology Rule Language OWL 2 RL+ and Its Extensions, Lncs Transactions On Computational Collective Intelligence 13 2014, p. 152–175.see in PBN
- Anh Linh Nguyen, Thi-Bich-Loc Nguyen and Andrzej Szałas, On Horn Knowledge Bases in Regular Description Logic with Inverse, in: Knowledge and Systems Engineering - Proceedings of the Fifth International Conference, KSE 2013, Volume 1, Hanoi, Vietnam, 17-19 October, 2013, Springer, 2014, p. 37–49.see in PBN
2013
- Anh Linh Nguyen and Andrzej Szałas, On the Horn Fragments of Serial Regular Grammar Logics with Converse, in: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013, p. 225–234.see in PBN
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity, in: 5th International Conference on Computational Collective Intelligence - Technologies and Applications ICCCI 2013., 2013, p. 143–153.see in PBN
- Anh Linh Nguyen, Thi-Bich-Loc Nguyen and Andrzej Szałas, Horn-DL: An Expressive Horn Description Logic with PTime Data Complexity, in: Web Reasoning and Rule Systems - 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings, Springer, 2013, p. 259–264.see in PBN
- Patrick Doherty and Andrzej Szałas, Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination, Fundamenta Informaticae 127 (1-4) 2013, p. 135–149.see in PBN
- Andrzej Szałas, How an Agent Might Think, Logic Journal Of The Igpl 21 (3) 2013, p. 515–535.see in PBN
- Barbara Dunin-Kęplicz and Andrzej Szałas, Paraconsistent Distributed Belief Fusion, in: IDC: 6th International Symposium on Intelligent Distributed Computing, 2013, r. 2013, p. 59–69.see in PBN
- Jan Małuszyński and Andrzej Szałas, Partiality and Inconsistency in Agents' Belief Bases, in: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013.see in PBN
- Barbara Dunin-Kęplicz and Andrzej Szałas, Taming Complex Beliefs, Lncs Transactions On Computational Collective Intelligence 2013.see in PBN
- Barbara Dunin-Kęplicz, Andrzej Szałas, Alina Strachocka and Rineke Verbrugge, Perceiving Speech Acts under Incomplete and Inconsistent Information, in: Advanced Methods and Technologies for Agent and Multi-Agent Systems, Proceedings of the 7th KES Conference on Agent and Multi-Agent Systems - Technologies and Applications (KES-AMSTA 2013), May 27-29, 2013, Hue City, Vietnam, IOS Press, 2013.see in PBN
2012
- Anh Linh Nguyen and Andrzej Szałas, Paraconsistent Reasoning for Semantic Web Agents, Lncs Transactions On Computational Collective Intelligence 7190 2012, p. 36–55.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, Logic-Based Roughification, in: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, Volume 1, Springer, 2012, p. 517–543.see in PBN
- Barbara Dunin-Kęplicz and Andrzej Szałas, Agents in Approximate Environments, in: Games, Actions and Social Software, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2012.see in PBN
- Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen, Hung Son Nguyen and Andrzej Szałas, Concept learning for description logic-based information systems, in: KSE 2012 - International Conference on Knowledge and Systems Engineering, Institute of Electrical and Electronics Engineers, USA 2012.see in PBN
- Barbara Dunin-Kęplicz and Andrzej Szałas, Epistemic Profiles and Belief Structures, in: KES-AMSTA, Springer-Verlag, 2012, p. 360–369.see in PBN
- Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen, Hung Son Nguyen, Andrzej Szałas and Thanh-Luong Tran, A bisimulation-based method of concept learning for knowledge bases in description logics, in: SoICT 2012 - Proceedings of the Third International Symposium on Information and Communication Technology, Association of Computing Machinery, Vietnam 2012.see in PBN
- Barbara Dunin-Kęplicz, Alina Strachocka, Andrzej Szałas and Rineke Verbrugge, A Paraconsistent Approach to Speech Acts, in: ArgMAS'2012: 9th International Workshop on Argumentation in Multi-Agent Systems, 2012.see in PBN
- Patrick Doherty, Jonas Kvarnström and Andrzej Szałas, Temporal Composite Actions with Constraints, in: KR: International Conference on the Principles of Knowledge Representation and Reasoning, AAAI Press, 2012.see in PBN
2011
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics, Journal Of Applied Non-classical Logics 21 (1) 2011, p. 61–81.see in PBN
- Son Thanh Cao, Anh Linh Nguyen and Andrzej Szałas, On the Web Ontology Rule Language OWL 2 RL, Lecture Notes In Computer Science 6922 2011, p. 254–264.see in PBN
- Patrick Doherty, Jacek Sroka, Andrzej Szałas and Tomasz Michalak, Contextual Coalitional Games, Lecture Notes In Computer Science 6521 2011, p. 65–78.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse, Studia Logica 98 (3) 2011, p. 387–428.see in PBN
- Jan Małuszyński and Andrzej Szałas, Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation, Journal Of Applied Non-classical Logics 21 (2) 2011, p. 211–232.see in PBN
- Jan Małuszyński and Andrzej Szałas, Living with Inconsistency and Taming Nonmonotonicity. Datalog Reloaded, Lecture Notes In Computer Science 6702 2011, p. 334–398.see in PBN
- Patrick Doherty, Barbara Dunin-Kęplicz and Andrzej Szałas, Tractable Model Checking for Fragments of Higher-Order Coalition Logic, in: AAMAS'11: 10th International Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, 2011, p. 743–750.see in PBN
- Son Thanh Cao, Linh Anh Nguyen and Andrzej Szałas, WORL: a Web Ontology Rule Language, in: KSE 2011 - International Conference on Knowledge and Systems Engineering, 2011.see in PBN
- Maciej Sysło, Wojciech Cellary, Krzysztof Diks, Andrzej Szałas, Jan Madey, Marcin Engel, Ryszard Tadeusiewicz, Jerzy Gawinecki, Piotr Sienkiewicz and Zenon Gniazdowski (eds.), Podstawy algorytmiki. Zastosowania informatyki, Warszawska Wyższa Szkoła Informatyki, Warszawa 2011.see in PBN
2010
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, Tractable Approximate Knowledge Fusion Using the Horn Fragment of Serial Propositional Dynamic Logic, International Journal Of Approximate Reasoning 51 (3) 2010, p. 346–362.see in PBN
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, Graded Beliefs, Goals and Intentions, in: LAMAS, 2010.see in PBN
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, A Layered Rule-Based Architecture for Approximate Knowledge Fusion, Computer Science And Information Systems 7 (3) 2010, p. 617–642.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, Three-Valued Paraconsistent Reasoning for Semantic Web Agents, Lecture Notes In Computer Science 6070 2010, p. 152–162.see in PBN
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, A Framework for Graded Beliefs, Goals and Intentions, Fundamenta Informaticae 100 (1-4) 2010, p. 53–76.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, Fundamenta Informaticae 102 (1) 2010, p. 97–113.see in PBN
- Anh Linh Nguyen and 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 1 2010, p. 21–38.see in PBN
- Patrick Doherty and Andrzej Szałas, On the Correctness of Rough-Set Based Approximate Reasoning, Lecture Notes In Computer Science 6086 2010, p. 327–336.see in PBN
2009
- Barbara Dunin-Kęplicz, Anh Linh Nguyen and Andrzej Szałas, Fusing Approximate Knowledge from Distributed Sources, in: IDC 2009, 3rd International Symposium on Intelligent Distributed Computing, Springer-Verlag, 2009.see in PBN
- Dov M. Gabbay and Andrzej Szałas, Annotation Theories over Finite Graphs, Studia Logica 93 (2-3) 2009, p. 147–180.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, An Optimal Tableau Decision Procedure for Converse-PDL, in: KSE 2009, 1st International Conference on Knowlegde and Systems Engineering, IEEE Computer Society, 2009.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, in: CS&P 2009, the 18th Concurrency, Specification and Programming Workshop, 2009.see in PBN
- Aida Vitória, Jan Małuszyński and Andrzej Szałas, Modeling and Reasoning with Paraconsistent Rough Sets, Fundamenta Informaticae 97 (4) 2009, p. 405–438.see in PBN
- Anh Linh Nguyen and Andrzej Szałas, ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, Lecture Notes In Computer Science 5796 2009, p. 473–488.see in PBN
- Alicja Szałas and Andrzej Szałas, Paraconsistent Reasoning with Words, Lecture Notes In Computer Science 5070 2009, p. 43–58.see in PBN
- Linh Anh Nguyen and Andrzej Szałas, A Tableau Calculus for Regular Grammar Logics with Converse, Lecture Notes In Computer Science 5663 2009, p. 421–436.see in PBN
- Dov M. Gabbay and Andrzej Szałas, Voting by Eliminating Quantifiers, Studia Logica 92 (3) 2009, p. 365–379.see in PBN
2008
- Jan Małuszyński, Andrzej Szałas and Aida Vitória, Paraconsistent Logic Programs with Four-Valued Rough Sets, Lecture Notes In Computer Science 5306 2008, p. 41–51.see in PBN
- Aida Vitória, Andrzej Szałas and Jan Małuszyński, Four-Valued Extension of Rough Sets, Lecture Notes In Computer Science 5009 2008, p. 106–114.see in PBN
- Patrick Doherty and Andrzej Szałas, Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription., in: KR: International Conference on the Principles of Knowledge Representation and Reasoning, AAAI Press, 2012, p. 560–570.see in PBN
- Andrzej Szałas, Towards Incorporating Background Theories into Quantifier Elimination, Journal Of Applied Non-classical Logics 18 (2-3) 2008, p. 325–340.see in PBN
- Dov M. Gabbay, Renate Schmidt and Andrzej Szałas, Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications, College Publications, London, 2008.see in PBN
2007
- P. Doherty and A. Szałas, A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, Fundamenta Informaticae Vol. 75, nr 1-4 2007, p. 179–193.see in PBN
- Patrick Doherty, Witold Lukaszewicz and Andrzej Szałas, Communication between agents with heterogeneous perceptual capabilities, Information Fusion 8 (1) 2007, p. 56–69.see in PBN
- P. Doherty, Barbara Dunin-Kęplicz and Andrzej Szałas, Dynamics of Approximate Information Fusion, Lecture Notes In Computer Science 4585 2007, p. 668–677.see in PBN
- Jan Maluszynski, Andrzej Szałas and Aida Vitória, A Four-Valued Logic for Rough Set-Like Approximate Reasoning, Lecture Notes In Computer Science Transactions On Rough Sets 6 2007, p. 176–190.see in PBN
- Barbara Dunin-Kęplicz and Andrzej Szałas, Towards Approximate BGI Systems, Lecture Notes In Computer Science 4696 2007, p. 277–287.see in PBN
- D. Gabbay and Andrzej Szałas, Second-order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals, Studia Logica 87 2007, p. 37–50.see in PBN
2006
- Patrick Doherty, Witold Łukaszewicz, Andrzej Skowron and Andrzej Szałas, Knowledge Representation Techniques: Rough Set Approach, Springer, Heidelberg 2006.see in PBN
- Andrzej Szałas and Jerzy Tyszkiewicz, On the Fixpoint Theory of Equality and its Applications, Lecture Notes In Computer Science 4136 2006, p. 388–401.see in PBN
- Patrick Doherty, Martin Magnusson and Andrzej Szałas, Approximate databases: a support tool for approximate reasoning, Journal Of Applied Non-classical Logics 16 (1-2) 2006, p. 87–118.see in PBN
- Andrzej Szałas, Second-order reasoning in description logics, Journal Of Applied Non-classical Logics 16 (3-4) 2006, p. 517–530.see in PBN
- Stella Orłowska and Andrzej Szałas, Quantifier Elimination in Elementary Set Theory, in: Relational Methods in Computer Science, 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, February 22-26, 2005, Selected Revised Papers, Springer, 2006, p. 237–248.see in PBN
- Ewa Orłowska, Alberto Policriti and Andrzej Szałas (eds.), Algebraic and relational deductive tools, 2006.see in PBN
2005
- Michał Grabowski and Andrzej Szałas, A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies, in: Advances in Web Intelligence, Springer, 2005, p. 183–189.see in PBN
- Patrick Doherty, Witold Lukaszewicz and Andrzej Szałas, Similarity, Approximations and Vagueness, in: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Proceedings of the 10th International Conference, RSFDGrC 2005, Regina, Canada, September 1-3, 2005, Part I, Springer Verlag, Berlin 2005, p. 541–550.see in PBN
2004
- P. Doherty, Witold Łukaszewicz, Andrzej Skowron and Andrzej Szałas, Approximate transducers and trees: a technique for combining rough and crisp knowledge, in: Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, In: S. K. Pal, L. Polkowski, A. Skowron (Eds.), Springer, Berlin, Niemcy 2004.see in PBN
- Patrick Doherty and Andrzej Szałas, On the Correspondence between Approximations and Similarity, in: Rough Sets and Current Trends in Computing, Springer, 2004, p. 143–152.see in PBN
- Patrick Doherty, Andrzej Szałas and Witold Łukaszewicz, Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities, in: Principles of Knowledge Representation and Reasoning, AAAI Press, 2004, p. 459–468.see in PBN
- Patrick Doherty, Steve Kertes, Martin Magnusson and Andrzej Szałas, Towards a Logical Analysis of Biochemical Pathways, in: Logics in Artificial Intelligence, 2004, p. 667–679.see in PBN
- Patrick Doherty, Steve Kertes, Martin Magnusson and Andrzej Szałas, Towards a Logical Analysis of Biochemical Reactions, in: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004, 2004, p. 997–998.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities, in: FUSION 2004, 2004, p. 175–182.see in PBN
- Patrick Doherty, Jarosław Kachniarz and Andrzej Szałas, Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases, in: Rough-Neural Computing: Techniques for Computing with Words, Cognitive Technologies, S.K.Pal, L..Polkowski, A.Skowron (Eds), Springer, Berlin 2004, p. 219–250.see in PBN
2003
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, On Mutual Understanding among Communicating Agents, in: Workshop on Formal Approaches to Multi-agent Systems, 2003, p. 83–97.see in PBN
- P. Doherty, M. Grabowski, W. Łukaszewicz and A. Szałas, Towards a Framework for Approximate Ontologies, Fundamenta Informaticae Vol. 57, nr 2-4 2003, p. 147–165.see in PBN
- Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz and Andrzej Szałas, Preface, Fundamenta Informaticae 57 (2-4) 2003.see in PBN
- Andrzej Szałas, On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems, in: Fundamentals of Computation Theory, Springer, 2003, p. 423–431.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Tolerance Spaces and Approximative Representational Structures, in: KI 2003: Advances in Artificial, Springer, 2003, p. 475–489.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Information Granules for Intelligent Knowledge Structures, in: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing: 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26–29, 2003 Proceedings, Springer Verlag, Heidelberg 2003, p. 405–412.see in PBN
2002
- Andrzej Szałas, Second-Order Quantifier Elimination in Modal Contexts, in: Logics in Artificial Intelligence, Springer, 2002, p. 223–232.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, CAKE: A Computer-Aided Knowledge Engineering Technique, in: Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI'2002, IOS Press, 2002, p. 220–224.see in PBN
2001
- Stella Orłowska and Andrzej Szałas (eds.), Relational Methods for Computer Science Applications, Springer Physica Verlag, 2001.see in PBN
- J. Kachniarz and Andrzej Szałas, On a Static Verification of Integrity Constraints in Relational Databases, in: Relational Methods for Computer Science Applications, Springer Physica Verlag, 2001.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas, in: Proceedings of Seventeenth International Joint Conference on Artificial Intelligence, 2001, p. 145–154.see in PBN
1999
- P Doherty, J Kachniarz and Andrzej Szałas, Meta-queries on deductive databases, Fundamenta Informaticae 40 (1) 1999, p. 17–30.see in PBN
- Andreas Nonnengart and Andrzej Szałas, A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, in: Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Springer Physica Verlag, 1999, p. 89–108.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Declarative PTIME Queries for Relational Databases using Quantifier Elimination, Journal Of Logic And Computation 9 (5) 1999, p. 737–758.see in PBN
- Andreas Nonnengart, Hans Juergen Ohlbach and Andrzej Szałas, Elimination of Predicate Quantifiers, in: Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, 1999, p. 159–181.see in PBN
1998
- Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szałas, Wnioskowanie w logikach nieklasycznych. Automatyzacja wnioskowania, Akademicka Oficyna Wydawnicza, Warszawa 1998.see in PBN
- P. Doherty, Witold Łukaszewicz and Andrzej Szałas, General Domain Circumscription and its effective reductions, Fundamenta Informaticae Vol. 36, nr 1 1998, p. 23–55.see in PBN
1996
- Andrzej Szałas, On Natural Deduction in First-Order Fixpoint Logics, Fundamenta Informaticae 26 (1) 1996, p. 81–94.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae 28 (3-4) 1996, p. 261–271.see in PBN
- Wojciech Penczek and Andrzej Szałas (eds.), Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings, Springer, 1996.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, General Domain Circumscription in its First-Order Reduction, in: Practical Reasoning, International Conference on Formal and Applied Practical Reasoning, FAPR '96, Bonn, Germany, June 3-7, 1996, Proceedings, Springer, 1996, p. 93–109.see in PBN
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Explaining Explanation Closure, in: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, Springer, 1996, p. 521–530.see in PBN
1995
- Patrick Doherty, Witold Łukaszewicz and Andrzej Szałas, Computing Circumscription Revisited: Preliminary Report, in: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, 1995, p. 1502–1508.see in PBN
- Leonard Bolc and Andrzej Szałas (eds.), Time and Logic. A Computational Approach, UCL Press Ltd., London 1995.see in PBN
- Andrzej Szałas, Temporal Logic: A Standard Approach, in: Time and Logic. A Computational Approach, UCL Press Ltd., London 1995, p. 1–50.see in PBN
- Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szałas, Wnioskowanie w logikach nieklasycznych. Podstawy teoretyczne, 1995.see in PBN
1988
- Andrzej Szałas, Towards the Temporal Approach to Abstract Data Types, Fundamenta Informaticae 11 (1) 1988, p. 49–64.see in PBN
- Leszek Holenderski and Andrzej Szałas, Incompleteness of First-Order Temporal Logic with Until, Theoretical Computer Science 57 1988, p. 317–325.see in PBN
- Andrzej Szałas, An Incompleteness Result in Process Algebra, Information Processing Letters 29 (2) 1988, p. 67–70.see in PBN
- Leszek Holenderski and Andrzej Szałas, Propositional Description of Finite Cause-Effect Structures, Information Processing Letters 27 (3) 1988, p. 111–117.see in PBN
1987
- Andrzej Szałas, A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time, Theoretical Computer Science 54 1987, p. 199–214.see in PBN
- Andrzej Szałas, Arithmetical Axiomatization of First-Order Temporal Logic, Information Processing Letters 26 (3) 1987, p. 111–116.see in PBN
- Jim R. Cunningham, Andreas Nonnengart and Andrzej Szałas, A Compositional Method for the Design and Proof of Asynchronous Processes, in: Proc. 4th. Annual Conf. ESPRIT'87, Part I, North-Holland, 1987, p. 566–580.see in PBN
You are not logged in | log in
