Publications for Andrzej Szalas
Co-author map based on ISI articles 2007-

Keywords

temporal semantics relational reasoning proof p>the model modal logics logic knowledge fixpoint first-order distributed complete classical belief arithmetical approximate /><img

Journal Articles

Son Thanh Cao, Linh Anh Nguyen and Andrzej Szalas
  WORL: a nonmonotonic rule language for the semantic web
  Vietnam Journal of Computer Science, 2014, 1(1), 57-69.

Andrzej Szalas
  How an agent might think
  Logic journal of the IGPL (Print), 2013, 21(3), 515-535.
 Web of Science® Times Cited: 2

Linh Anh Nguyen and Andrzej Szalas
  ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
  Studia Logica: An International Journal for Symbolic Logic, 2011, 98(3), 387-428.
 Web of Science® Times Cited: 3

Jan Maluszynski and Andrzej Szalas
  Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
  Journal of Applied Non-Classical Logics, 2011, 21(2), 211-232.

Barbara Dunin-Keplicz, Anh Linh Nguyen and Andrzej Szalas
  Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics
  Journal of Applied Non-Classical Logics, 2011, 21(1), 61-91.

Linh Anh Nguyen and Andrzej Szalas
  Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
  Fundamenta Informaticae, 2010, 102(1), 97-113.
 Web of Science® Times Cited: 6

Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas
  A Framework for Graded Beliefs, Goals and Intentions
  Fundamenta Informaticae, 2010, 100(1-4), 53-76.
 Web of Science® Times Cited: 3

Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas
  A Layered Rule-Based Architecture for Approximate Knowledge Fusion
  COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2010, 7(3), 617-642.
 Web of Science® Times Cited: 1

Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas
  Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
  International Journal of Approximate Reasoning, 2010, 51(3), 346-362.
 Web of Science® Times Cited: 6

Anh Linh Nguyen and Andrzej Szalas
  Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH
  Transactions on Computational Collective Intelligence, 2010, 1(1), 21-38.
 Web of Science® Times Cited: 4

Dov Gabbay and Andrzej Szalas
  Annotation Theories over Finite Graphs
  Studia Logica: An International Journal for Symbolic Logic, 2009, 93(2-3), 147-180.

Andrzej Szalas and Dov Gabbay
  Voting by Eliminating Quantifiers
  Studia Logica: An International Journal for Symbolic Logic, 2009, 92(3), 365-379.

Andrzej Szalas
  Towards Incorporating Background Theories into Quantifier Elimination
  Journal of applied non-classical logics, 2008, 18(2-3), 325-340.

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Communication between agents with heterogeneous perceptual capabilities
  Information Fusion, 2007, 8(1), 56-69.
 Web of Science® Times Cited: 10

D.M. Gabbay and Andrzej Szalas
  Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
  Studia Logica: An International Journal for Symbolic Logic, 2007, 87(1), 37-50.

Patrick Doherty and Andrzej Szalas
  A correspondence framework between three-valued logics and similarity-based approximate reasoning
  Fundamenta Informaticae, 2007, 75(1-4), 179-193.
 Web of Science® Times Cited: 2

Andrzej Szalas
  Second-order Reasoning in Description Logics
  Journal of applied non-classical logics, 2006, 16(3 - 4), 517-530.

Patrick Doherty, Martin Magnusson and Andrzej Szalas
  Approximate Databases: A support tool for approximate reasoning
  Journal of applied non-classical logics, 2006, 16(1-2), 87-118.

Patrick Doherty, M Grabowski, Witold Lukaszewicz and Andrzej Szalas
  Towards a framework for approximate ontologies
  Fundamenta Informaticae, 2003, 57(2-4), 147-165.
 Web of Science® Times Cited: 14

Patrick Doherty, Jaroslaw Kachniarz and Andrzej Szalas
  Meta-queries on deductive databases
  Fundamenta Informaticae, 1999, 40(1), 17-30.

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Declarative PTIME queries for relational databases using quantifier elimination
  Journal of logic and computation (Print), 1999, 9(5), 737-758.

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  General domain circumscription and its effective reductions.
  Fundamenta Informaticae, 1998, 36(1), 23-55.

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Computing circumscription revisited: A reduction algorithm
  Journal of automated reasoning, 1997, 18(3), 297-336.

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  A reduction result for circumscribed semi-horn formulas
  Fundamenta Informaticae, 1996, 28(3,4), 261-272.

Andrzej Szalas
  On Natural Deduction in First-Order Fixpoint Logics
  Fundamenta Informaticae, 1996, 26(1), 81-94.

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

Andrzej Szalas
  On the Correspondence between Modal and Classical Logic: An Automated Approach
  Journal of logic and computation (Print), 1993, 3(6), 605-620.

Andrzej Szalas
  Axiomatizing Fixpoint Logics
  Information Processing Letters, 1992, 41(4), 175-180.

Andrzej Szalas
  On Strictly Arithmetical Completeness in Logics of Programs
  Theoretical Computer Science, 1991, 79(2), 341-355.

Uwe Petermann and Andrzej Szalas
  On Temporal Logic for Distributed Systems and its Application to Processes Communicating by Interrupts
  Fundamenta Informaticae, 1989, 12(2), 191-204.

Andrzej Szalas
  Towards the Temporal Approach to Abstract Data Types
  Fundamenta Informaticae, 1988, 11(1), 49-64.

Andrzej Szalas
  An Incompleteness Result in Process Algebra
  Information Processing Letters, 1988, 29(2), 67-70.

Leszek Holenderski and Andrzej Szalas
  Propositional Description of Finite Cause-Effect Structures
  Information Processing Letters, 1988, 27(3), 111-117.

Andrzej Szalas and Leszek Holenderski
  Incompleteness of First-Order Temporal Logic with Until
  Theoretical Computer Science, 1988, 57(2-3), 317-325.

Andrzej Szalas
  A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time
  Theoretical Computer Science, 1987, 54(2-3), 199-214.

Andrzej Szalas
  Arithmetical Axiomatization of First-Order Temporal Logic
  Information Processing Letters, 1987, 26(3), 111-116.

Andrzej Szalas
  Concerning the Semantic Consequence Relation in First-Order Temporal Logic
  Theoretical Computer Science, 1986, 47(3), 329-334.

Uwe Petermann and Andrzej Szalas
  A Note on PCI: Distributed Processes Communicating by Interrupts
  SIGPLAN notices, 1985, 20(3), 37-46.

Andrzej Szalas and Danuta Szczepaska
  Exception Handling in Parallel Computations
  SIGPLAN notices, 1985, 20(10), 95-104.

Andrzej Szalas
  On an Application of Algorithmic Theory of Stacks
  Fundamenta Informaticae, 1984, 7(3), 378-388.

Andrzej Szalas
  Algorithmic Logic with Recursive Functions
  Fundamenta Informaticae, 1981, 4(4), 975-995.

Books

Dov M. Gabbay, Renate A. Schmidt and Andrzej Szalas
  Second-Order Quantifier Elimination. Foundations, Computational Aspects and Applications
    Studies in Logics, 12, College Publications, 2008.


Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron and Andrzej Szalas
  Knowledge Representation Techniques.: a rough set approach
    Studies in Fuzziness and Soft Computing, 202, Springer, 2006.


Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szalas
  Wnioskowanie w logikach nieklasycznych: Automatyzacja wnioskowania
    Academic Pub. PLJ (Akademicka Oficyna Wydawnicza PLJ), 1998.


Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szalas
  Wnioskowanie w logikach nieklasycznych: Podstawy teoretyczne
    Academic Pub. PLJ (Akademicka Oficyna Wydawnicza PLJ), 1995.


Andrzej Szalas
  Zarys dedukcyjnych metod automatycznego wnioskowania
    Academic Pub. RM (Akademicka Oficyna Wydawnicza RM), 1992.


Andrzej Szalas and Jolanta Warpechowska
  Loglan
    Wydawnictwa Naukowo-Techniczne WNT, 1991.


Anthologies

Ewa Orlowska and Andrzej Szalas
  Relational Methods for Computer Science Applications
  Studies in Fuziness and Soft Computing, , Springer Physica Verlag, 2001.


Leonard Bolc and Andrzej Szalas
  Time and Logic: A Computational Approach
  CRC Press, 1995.


Chapters in Books

Barbara Dunin-Keplicz and Andrzej Szalas
  Distributed Paraconsistent Belief Fusion
  Intelligent Distributed Computing VI: Proceedings of the 6th International Symposium on Intelligent Distributed Computing - IDC 2012, Calabria, Italy, September 2012, Springer Berlin/Heidelberg, 2013, 59-69.


Linh Anh Nguyen and Andrzej Szalas
  Logic-Based Roughification
  Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam (vol. I), Springer Berlin/Heidelberg, 2013, 517-543.


Barbara Dunin-Keplicz and Andrzej Szalas
  Taming Complex Beliefs
  Transactions on Computational Collective Intelligence XI, Springer Berlin/Heidelberg, 2013, 1-21.


Linh Anh Nguyen and Andrzej Szalas
  Paraconsistent Reasoning for Semantic Web Agents
  Transactions on Compuational Collective Intelligence VI, Springer Berlin/Heidelberg, 2012, 36-55.


Barbara Dunin-Keplicz and Andrzej Szalas
  Epistemic Profiles and Belief Structures
  Agent and Multi-Agent Systems. Technologies and Applications: 6th KES International Conference, KES-AMSTA 2012, Dubrovnik, Croatia, June 25-27, 2012. Proceedings, Springer Berlin/Heidelberg, 2012, 360-369.


Barbara Dunin-Keplicz and Andrzej Szalas
  Agents in Approximate Environments
  Games, Actions and Social Software: Multidisciplinary Aspects, Springer, 2012, 141-163.


Andrzej Szalas and Alicja Szalas
  Paraconsistent Reasoning with Words
  Aspects of Natural Language Processing: Essays Dedicated to Leonard Bolc on the Occasion of His 75th Birthday, Springer, 2009, 43-58.


Jan Maluszynski, Andrzej Szalas and Aida Vitoria
  A Four-Valued Logic for Rough Set-Like Approximate Reasoning
  Transactions on Rough Sets VI, Springer, 2007, 176-190.


Patrick Doherty, Jaroslaw Kachniarz and Andrzej Szalas
  Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases
  Rough-Neural Computing: Techniques for Computing with Words, Springer, 2004, 219-250.


Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron and Andrzej Szalas
  Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge
  Rough-Neural Computing: Techniques for Computing with Words, Springer, 2004, 189-218.


Jaroslaw Kachniarz and Andrzej Szalas
  On a Static Approach to Verification of Integrity Constraints in Relational Databases
  Relational Methods for Computer Science Applications, Springer Physica-Verlag, 2001, 97-109.


Andreas Nonnengart and Andrzej Szalas
  A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory
  Logic at work: essays dedicated to the memory of Helena Rasiowa, Physica Verlag, 1998, 307-328.


Andrzej Szalas
  Temporal Logic: A Standard Approach
  Time And Logic: A Computational Approach, UCL Press Ltd., 1995, 1-50.


Conference Proceedings

Ewa Orlowska, Alberto Policriti and Andrzej Szalas
  Algebraic and Relational Deductive Tools
  Éditions Hermès-Lavoisier, 2006.


Patrick Doherty, W. Lukaszewicz, Skowron Andrzej and Andrzej Szalas
  Knowledge Representation and Approximate Reasoning
  Fundamenta Informaticae, 2003(57):2-4, IOS Press, 2003.


Wojciech Penczek and Andrzej Szalas
  Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science (MFCS)
  Lecture Notes in Computer Science, 1113, Springer Verlag, 1996.


Conference Articles

L.A. Nguyen, T.-B.-L. Nguyen and Andrzej Szalas
  On horn knowledge bases in regular description logic with inverse
  KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2013), VOL 1, 2014.


Linh Anh Nguyen, Thi-Bich-Loc Nguyen and Andrzej Szalas
  HornDL: An Expressive Horn Description Logic with PTime Data Complexity
  Web Reasoning and Rule Systems, 2013.


Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas
  Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity
  Computational Collective Intelligence. Technologies and Applications, 2013.


Linh Anh Nguyen and Andrzej Szalas
  On the Horn Fragments of Serial Regular Grammar Logics with Converse
  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), 2013.


Jan Maluszynski and Andrzej Szalas
  Partiality and Inconsistency in Agents' Belief Bases
  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), 2013.


 Web of Science® Times Cited: 1

Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas and Rineke Verbrugge
  Perceiving Speech Acts under Incomplete and Inconsistent Information
  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), 2013.


Ha Quang-Thuy, Hoang Thi-Lan-Giao, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas and Tran Thanh-Luong
  Concept Learning for Description Logic-based Information Systems
  KSE 2012 - International Conference on Knowledge and Systems Engineering, 2012.


Ha Quang-Thuy, Hoang Thi-Lan-Giao, Linh Anh Nguyen, Nguyen Hung-Son, Andrzej Szalas and Tran Thanh-Luong
  A Bisimulation-based Method of Concept Learning for Knowledge Bases in Description Logics
  SoICT 2012 - 3rd International Symposium on Information and Communication Technology, 2012.


Patrick Doherty, Jonas Kvarnström and Andrzej Szalas
  Temporal Composite Actions with Constraints
  Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2012.


Jan Maluszynski and Andrzej Szalas
  Living with Inconsistency and Taming Nonmonotonicity
  Datalog Reloaded, 2011.


 Web of Science® Times Cited: 2

Son Thanh Cao, Linh Anh Nguyen and Andrzej Szalas
  WORL: A Web Ontology Rule Language
  Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE), 2011.


Patrick Doherty, Barbara Dunin-Keplicz and Andrzej Szalas
  Tractable model checking for fragments of higher-order coalition logic
  Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, 2011.


Son Thanh Cao, Anh Linh Nguyen and Andrzej Szalas
  On the Web Ontology Rule Language OWL 2 RL
  Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI), 2011.


 Web of Science® Times Cited: 1

Patrick Doherty, Tomasz Michalak, Jacek Sroka and Andrzej Szalas
  Contextual Coalitional Games
  Proceedings of the 4th Indian Conference on Logic and its Applications (ICLA), 2011.


Anh Linh Nguyen and Andrzej Szalas
  Three-Valued Paraconsistent Reasoning for Semantic Web Agents
  Proceedings of the 4th International KES Symposium on Agents and Multi-agent Systems – Technologies and Applications (KES-AMSTA), 2010.


 Web of Science® Times Cited: 3

Patrick Doherty and Andrzej Szalas
  On the Correctness of Rough-Set Based Approximate Reasoning
  Proceedings of the 7th International Conference on Rough Sets and Current Trends in Computing (RSCTC), 2010.


Barbara Dunin-Keplicz, Anh Linh Nguyen and Andrzej Szalas
  Graded Beliefs, Goals and Intentions
  Proceedings of the 3rd Workshop on Logical Aspects of Multi-Agent Systems (LAMAS), 2010.


Linh Anh Nguyen and Andrzej Szalas
  A tableau calculus for regular grammar logics with converse
  Proceedings of the 22nd International Conference on Automated Deduction (CADE), 2009.


 Web of Science® Times Cited: 6

Andrzej Szalas and Linh Anh Nguyen
  EXPTIME Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC
  Proceedings of the 1st International Conference on Computational Collective Intelligence - Semantic Web, Social Networks &amp; Multiagent Systems (ICCCI), 2009.


 Web of Science® Times Cited: 5

Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas
  Fusing Approximate Knowledge from Distributed Sources
  Proceedings of the 3rd International Symposium on Intelligent Distributed Computing (IDC), 2009.


 Web of Science® Times Cited: 2

Linh Anh Nguyen and Andrzej Szalas
  Checking Consistency of an ABox w.r.t. Global Assumptions in PDL*
  Proceedings of the 18th Concurrency, Specification and Programming Workshop (CS&amp;P), 2009.


Linh Anh Nguyen and Andrzej Szalas
  An Optimal Tableau Decision Procedure for Converse-PDL
  Proceedings of the 1st International Conference on Knowlegde and Systems Engineering (KSE), 2009.


 Web of Science® Times Cited: 4

Patrick Doherty and Andrzej Szalas
  Reasoning with Qualitative Preferences and Cardinalities Using Generalized Circumscription
  Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2008.


Aida Vitoria, Andrzej Szalas and Jan Maluszynski
  Four-valued Extension of Rough Sets
  Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), 2008.


 Web of Science® Times Cited: 3

Jan Maluszynski, Aida Vitoria and Andrzej Szalas
  Paraconsistent Logic Programs with Four-valued Rough Sets
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008.


 Web of Science® Times Cited: 9

Patrick Doherty, Barbara Dunin-Keplicz and Andrzej Szalas
  Dynamics of approximate information fusion
  Proceedings of the International Conference on Rough Sets and Emerging Intelligent Systems Paradigms (RSEISP), 2007.


 Web of Science® Times Cited: 9

Barbara Dunin-Keplicz and Andrzej Szalas
  Towards Approximate BGI Systems
  Proceedings of the 5th International Central and Eastern European Conference on Multi-Agent Systems (CEEMAS), 2007.


 Web of Science® Times Cited: 6

Andrzej Szalas and Jerzy Tyszkiewicz
  On the fixpoint theory of equality and its applications
  Proceedings of the 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra (RelMiCS/AKA), 2006.


Ewa Orlowska and Andrzej Szalas
  Quantifier Elimination in Elementary Set Theory
  Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS), 2006.


Patrick Doherty, Andrzej Szalas and Witold Lukaszewicz
  Similarity, approximations and vagueness
  Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC), 2005.


 Web of Science® Times Cited: 3

Michali Grabowski and Andrzej Szalas
  A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies
  Proceedings of the 3rd Atlantic Web Intelligence Conference (AWIC), 2005.


Martin Magnusson, Patrick Doherty and Andrzej Szalas
  An Experimental Platform for Approximate Databases
  3rd joint SAIS-SSL event on Artificial Intelligence and Learning Systems,2005, 2005.


Patrick Doherty, Steven Kertes, Martin Magnusson and Andrzej Szalas
  Towards a logical analysis of biochemical pathways
  Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA), 2004.


 Web of Science® Times Cited: 2

Patrick Doherty, Steven Kertes, Martin Magnusson and Andrzej Szalas
  Towards a Logical Analysis of Biochemical Reactions (Extended abstract)
  Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), 2004.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities
  Proceedings of the 7th International Conference on Information Fusion, 2004.


Patrick Doherty and Andrzej Szalas
  On the Correspondence between Approximations and Similarity
  Proceedings of the International Conference on Rough Sets and Current Trends in Computing (RSCTC), 2004.


 Web of Science® Times Cited: 17

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
  Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning, 2004.


Andrzej Szalas
  On a logical approach to estimating computational complexity of potentially intractable problems
  Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT), 2003.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  On mutual understanding among communicating agents
  Proceedings of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS), 2003.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Tolerance Spaces and Approximative Representational Structures
  Proceedings of the 26th German Conference on Artificial Intelligence (KI), 2003.


 Web of Science® Times Cited: 11

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Information Granules for Intelligent Knowledge Structures
  Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC), 2003.


 Web of Science® Times Cited: 4

Andrzej Szalas
  Second-order quantifier elimination in modal contexts
  Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), 2002.


 Web of Science® Times Cited: 4

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  CAKE: A computer aided knowledge engineering technique.
  Proceedings of the 15th European Conference on Artificial Intelligence,2002, 2002.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Computing strongest necessary and weakest sufficient conditions of first-order formulas
  17th International Joint Conference on Artificial Intelligence,2001, 2001.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Efficient reasoning using the local closed-world assumption
  Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA), 2000.


 Web of Science® Times Cited: 4

Jaroslaw Kachniarz and Andrzej Szalas
  Algorithms based on Symbolic Transformations of Logical Formulas in the RDL Language
  Proceedings of the 2nd Conference on Applications of Computer Science in Mathematics and Economy, 2000.


Jaroslaw Kachniarz and Andrzej Szalas
  On Rule-Based Approach to the Construction of Logical Transformers
  Proceedings of the 1st International Workshop on Rule-Based Programming (RULE), 2000.


Andreas Nonnengart, Hans-Jürgen Ohlbach and Andrzej Szalas
  Elimination of Predicate Quantifiers
  Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, 1999.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Explaining explanation closure
  Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems,1996, 1996.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  General domain circumscription and its first-order reduction.
  Proceedings of the 1st International Conference on Formal and Applied Practical Reasoning (FAPR), 1996.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Computing circumscription revisited.
  Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 1995.


Andrzej Szalas
  Genetic Algorithms for Decision Problems
  Proceedings of the 6th International Conference on Artificial Intelligence and Information-Control Systems of Robots (AIICSR), 1994.


R. J. Cunningham, Andreas Nonnengart and Andrzej Szalas
  A Compositional Method for the Design and Proof of Asynchronous Processes
  Proceedings of the 4th Annual ESPRIT Conference (ESPRIT), 1987.


Licentiate Theses

Piotr Rudol
  Increasing Autonomy of Unmanned Aircraft Systems Through the Use of Imaging Sensors
  2011.


  Fulltext PDF

Mariusz Wzorek
  Selected Aspects of Navigation and Path Planning in Unmanned Aircraft Systems
  2011.


  Fulltext PDF

Reports

Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Declarative ptime queries to relational databases.
  LITH-IDA-R, 34, 1996.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  General domain circumscription and its first-order reduction.
  LITH-IDA-R, 1, 1996.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  A characterization result for circumscribed normal logic programs. Revised version accepted for publication: Special issue of honor of H. Rasiowa, Fundamenta Informaticae.
  LITH-IDA-R, 20, 1995.


Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas
  Computing circumscription revisited: A reduction algorithm.
  LITH-IDA-R, 94-42, 1994.