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