AIICS

Andrzej Szalas

Recent Publications

Show abstracts (where available) BibTeX entries
2014
[122] Son Thanh Cao, Linh Anh Nguyen and Andrzej Szalas. 2014.
WORL: a nonmonotonic rule language for the semantic web.
Vietnam Journal of Computer Science, 1(1):57–69. Springer Berlin/Heidelberg.
DOI: 10.1007/s40595-013-0009-y.
2013
[121] Linh Anh Nguyen, Thi-Bich-Loc Nguyen and Andrzej Szalas. 2013.
HornDL: An Expressive Horn Description Logic with PTime Data Complexity.
In Wolfgang Faber, Domenico Lembo, editors, Web Reasoning and Rule Systems, pages 259–264. In series: Lecture Notes in Computer Science #7994. Springer Berlin/Heidelberg. ISBN: 978-3-642-39665-6.
DOI: 10.1007/978-3-642-39666-3_25.
[120] Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas. 2013.
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity.
In Costin B«édic«é, Ngoc Thanh Nguyen, Marius Brezovan, editors, Computational Collective Intelligence. Technologies and Applications, pages 143–153. In series: Lecture Notes in Computer Science #8083. Springer Berlin/Heidelberg. ISBN: ISBN: 978-3-642-40494-8.
DOI: 10.1007/978-3-642-40495-5_15.
[119] Linh Anh Nguyen and Andrzej Szalas. 2013.
On the Horn Fragments of Serial Regular Grammar Logics with Converse.
In Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, editors, 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), pages 225–234. In series: Frontiers in Artificial Intelligence and Applications #252. IOS Press. ISBN: 978-1-61499-253-0.
DOI: 10.3233/978-1-61499-254-7-225.
[118] Jan Maluszynski and Andrzej Szalas. 2013.
Partiality and Inconsistency in Agents' Belief Bases.
In Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, editors, 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), pages 3–17. In series: Frontiers in Artificial Intelligence and Applications #252. IOS Press. ISBN: 978-1-61499-253-0.
DOI: 10.3233/978-1-61499-254-7-3.
[117] Barbara Dunin-Keplicz, Alina Strachocka, Andrzej Szalas and Rineke Verbrugge. 2013.
Perceiving Speech Acts under Incomplete and Inconsistent Information.
In Dariusz Barbucha, Manh Thanh Le, Robert J. Howlett, Lakhmi C. Jain, editors, 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), pages 255–264. In series: Frontiers in Artificial Intelligence and Applications #252. IOS Press. ISBN: 978-1-61499-253-0.
DOI: 10.3233/978-1-61499-254-7-255.
[116] Barbara Dunin-Keplicz and Andrzej Szalas. 2013.
Taming Complex Beliefs.
In Ngoc Thanh Nguyen, editor, Transactions on Computational Collective Intelligence XI, pages 1–21. In series: Lecture Notes in Computer Science #8065. Springer Berlin/Heidelberg. ISBN: 978-3-642-41775-7 (print), 978-3-642-41776-4 (online).
DOI: 10.1007/978-3-642-41776-4_1.
[115] Andrzej Szalas. 2013.
How an agent might think.
Logic journal of the IGPL (Print), 21(3):515–535. Oxford University Press (OUP): Policy A - Oxford Open Option A.
DOI: 10.1093/jigpal/jzs051.
[114] Linh Anh Nguyen and Andrzej Szalas. 2013.
Logic-Based Roughification.
In A. Skowron and Z. Suraj, editors, Rough Sets and Intelligent Systems - Professor ZdzisŇāaw Pawlak in Memoriam (vol. I), pages 517–543. In series: Intelligent Systems Reference Library #42. Springer Berlin/Heidelberg. ISBN: 978-3-642-30343-2.
DOI: 10.1007/978-3-642-30344-9_19.
[113] Barbara Dunin-Keplicz and Andrzej Szalas. 2013.
Distributed Paraconsistent Belief Fusion.
In Giancarlo Fortino , Costin Badica , Michele Malgeri and Rainer Unland, editors, Intelligent Distributed Computing VI: Proceedings of the 6th International Symposium on Intelligent Distributed Computing - IDC 2012, Calabria, Italy, September 2012, pages 59–69. In series: Studies in Computational Intelligence #446. Springer Berlin/Heidelberg. ISBN: 978-3-642-32523-6.
DOI: 10.1007/978-3-642-32524-3_9.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/13601893
2012
[112] Ha Quang-Thuy, Hoang Thi-Lan-Giao, Linh Anh Nguyen, Hung Son Nguyen, Andrzej Szalas and Tran Thanh-Luong. 2012.
Concept Learning for Description Logic-based Information Systems.
In KSE 2012 - International Conference on Knowledge and Systems Engineering, pages 65–73. IEEE Computer Society.
DOI: 10.1109/KSE.2012.23.
[111] Ha Quang-Thuy, Hoang Thi-Lan-Giao, Linh Anh Nguyen, Nguyen Hung-Son, Andrzej Szalas and Tran Thanh-Luong. 2012.
A Bisimulation-based Method of Concept Learning for Knowledge Bases in Description Logics.
In SoICT 2012 - 3rd International Symposium on Information and Communication Technology, pages 241–249. ACM Press.
DOI: 10.1145/2350716.2350753.
[110] Barbara Dunin-Keplicz and Andrzej Szalas. 2012.
Epistemic Profiles and Belief Structures.
In Gordan Jezic , Mario Kusek , Ngoc-Thanh Nguyen , Robert J. Howlett and Lakhmi C. Jain, editors, Agent and Multi-Agent Systems. Technologies and Applications: 6th KES International Conference, KES-AMSTA 2012, Dubrovnik, Croatia, June 25-27, 2012. Proceedings, pages 360–369. In series: Lecture Notes in Computer Science #7327. Springer Berlin/Heidelberg. ISBN: 978-3-642-30946-5, e- 978-3-642-30947-2.
DOI: 10.1007/978-3-642-30947-2_40.
[109] Linh Anh Nguyen and Andrzej Szalas. 2012.
Paraconsistent Reasoning for Semantic Web Agents.
In Ngoc Thanh Nguyen, editor, Transactions on Compuational Collective Intelligence VI, pages 36–55. In series: Lecture Notes in Computer Science #7190. Springer Berlin/Heidelberg. ISBN: 978-3-642-29355-9, e-978-3-642-29356-6.
DOI: 10.1007/978-3-642-29356-6_2.
[108] Barbara Dunin-Keplicz and Andrzej Szalas. 2012.
Agents in Approximate Environments.
In Jan Ejick and Rineke Verbrugge, editors, Games, Actions and Social Software: Multidisciplinary Aspects, pages 141–163. In series: Lecture Notes in Computer Science #7010. Springer. ISBN: 978-3-642-29325-2 (print), 978-3-642-29326-9 (online).
DOI: 10.1007/978-3-642-29326-9_8.
[107] Full text  Patrick Doherty, Jonas Kvarnstr√∂m and Andrzej Szalas. 2012.
Temporal Composite Actions with Constraints.
In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 478–488. AAAI Press. ISBN: 978-1-57735-560-1, 978-1-57735-561-8.
Link: http://www.aaai.org/ocs/index.php/KR/KR1...
2011
[106] Jan Maluszynski and Andrzej Szalas. 2011.
Living with Inconsistency and Taming Nonmonotonicity.
In O. de Moor, G. Gottlob, T. Furche, A. Sellers, editors, Datalog Reloaded, pages 334–398. In series: Lecture Notes in Computer Science #6702. Springer Berlin/Heidelberg. ISBN: 978-3-642-24205-2.
DOI: 10.1007/978-3-642-24206-9_22.
[105] Son Thanh Cao, Linh Anh Nguyen and Andrzej Szalas. 2011.
WORL: A Web Ontology Rule Language.
In Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE), pages 32–39. IEEE. ISBN: 978-1-4577-1848-9.
DOI: 10.1109/KSE.2011.14.
[104] Patrick Doherty, Barbara Dunin-Keplicz and Andrzej Szalas. 2011.
Tractable model checking for fragments of higher-order coalition logic.
In Liz Sonenberg, Peter Stone, Kagan Tumer, Pinar Yolum, editors, Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, pages 743–750. AAAI Press. ISBN: 0-9826571-6-1, 978-0-9826571-6-4.
Link: http://dl.acm.org/citation.cfm?id=203172...
[103] Son Thanh Cao, Anh Linh Nguyen and Andrzej Szalas. 2011.
On the Web Ontology Rule Language OWL 2 RL.
In Piotr Jedrzejowicz, Ngoc Thanh Nguyen and Kiem Hoang, editors, Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI), pages 254–264. In series: Lecture Notes in Computer Science #6922. Springer Berlin/Heidelberg. ISBN: 978-3-642-23934-2.
DOI: 10.1007/978-3-642-23935-9_25.
[102] Full text  Patrick Doherty, Tomasz Michalak, Jacek Sroka and Andrzej Szalas. 2011.
Contextual Coalitional Games.
In Mohua Banerjee, Anil Seth, editors, Proceedings of the 4th Indian Conference on Logic and its Applications (ICLA), pages 65–78. In series: Lecture Notes in Artificial Intelligence #6521. Springer Berlin/Heidelberg.
DOI: 10.1007/978-3-642-18026-2_7.
[101] Barbara Dunin-Keplicz, Anh Linh Nguyen and Andrzej Szalas. 2011.
Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics.
Journal of Applied Non-Classical Logics, 21(1):61–81. Lavoisier.
DOI: 10.3166/jancl.21.61-91.
[100] Linh Anh Nguyen and Andrzej Szalas. 2011.
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.
Studia Logica: An International Journal for Symbolic Logic, 98(3):387–428. Springer Berlin/Heidelberg.
DOI: 10.1007/s11225-011-9341-3.
[99] Jan Maluszynski and Andrzej Szalas. 2011.
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation.
Journal of Applied Non-Classical Logics, 21(2):211–232. Lavoisier.
DOI: 10.3166/jancl.21.211-232.
2010
[98] Barbara Dunin-Keplicz, Anh Linh Nguyen and Andrzej Szalas. 2010.
Graded Beliefs, Goals and Intentions.
In Proceedings of the 3rd Workshop on Logical Aspects of Multi-Agent Systems (LAMAS), pages 1–15. AAAI Press.
[97] Anh Linh Nguyen and Andrzej Szalas. 2010.
Three-Valued Paraconsistent Reasoning for Semantic Web Agents.
In Proceedings of the 4th International KES Symposium on Agents and Multi-agent Systems ‚Äď Technologies and Applications (KES-AMSTA), pages 152–162. In series: Lecture Notes in Artificial Intelligence #6070. Springer. ISBN: 978-3-642-13479-1.
DOI: 10.1007/978-3-642-13480-7_17.
[96] Anh Linh Nguyen and Andrzej Szalas. 2010.
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH.
Transactions on Computational Collective Intelligence, 1(1):21–38. Springer. ISBN: 978-3-642-15033-3.
DOI: 10.1007/978-3-642-15034-0_2.
[95] Linh Anh Nguyen and Andrzej Szalas. 2010.
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL.
Fundamenta Informaticae, 102(1):97–113. IOS Press.
DOI: 10.3233/FI-2010-299.
[94] Patrick Doherty and Andrzej Szalas. 2010.
On the Correctness of Rough-Set Based Approximate Reasoning.
In M. Szczuka, M. Kryszkiewicz, S. Ramanna, R. Jensen, Q. Hu, editors, Proceedings of the 7th International Conference on Rough Sets and Current Trends in Computing (RSCTC), pages 327–336. In series: Lecture Notes in Computer Science #6086. Springer. ISBN: 978-3-642-13528-6.
DOI: 10.1007/978-3-642-13529-3_35.
[93] Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas. 2010.
A Framework for Graded Beliefs, Goals and Intentions.
Fundamenta Informaticae, 100(1-4):53–76. IOS Press.
DOI: 10.3233/FI-2010-263.
[92] Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas. 2010.
A Layered Rule-Based Architecture for Approximate Knowledge Fusion.
COMPUTER SCIENCE AND INFORMATION SYSTEMS, 7(3):617–642. COMSIS CONSORTIUM.
DOI: 10.2298/CSIS100209015D.
[91] Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas. 2010.
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic.
International Journal of Approximate Reasoning, 51(3):346–362. Elsevier.
DOI: 10.1016/j.ijar.2009.11.002.
2009
[90] Barbara Dunin-Keplicz, Linh Anh Nguyen and Andrzej Szalas. 2009.
Fusing Approximate Knowledge from Distributed Sources.
In Proceedings of the 3rd International Symposium on Intelligent Distributed Computing (IDC), pages 75–86. In series: Studies in Computational Intelligence #237. Springer Berlin/Heidelberg. ISBN: 978-3-642-03213-4, 978-3-642-26930-1.
DOI: 10.1007/978-3-642-03214-1_8.
[89] Linh Anh Nguyen and Andrzej Szalas. 2009.
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL*.
In Proceedings of the 18th Concurrency, Specification and Programming Workshop (CS&P), pages 431–442.
[88] Linh Anh Nguyen and Andrzej Szalas. 2009.
An Optimal Tableau Decision Procedure for Converse-PDL.
In Proceedings of the 1st International Conference on Knowlegde and Systems Engineering (KSE), pages 207–214. IEEE Computer Society. ISBN: 978-1-4244-5086-2.
DOI: 10.1109/KSE.2009.12.
[87] Dov Gabbay and Andrzej Szalas. 2009.
Annotation Theories over Finite Graphs.
Studia Logica: An International Journal for Symbolic Logic, 93(2-3):147–180. Springer.
DOI: 10.1007/s11225-009-9220-3.
[86] Andrzej Szalas and Alicja Szalas. 2009.
Paraconsistent Reasoning with Words.
In Aspects of Natural Language Processing: Essays Dedicated to Leonard Bolc on the Occasion of His 75th Birthday, pages 43–58. In series: Lecture Notes in Computer Science #5070. Springer. ISBN: 978-3-642-04734-3.
DOI: 10.1007/978-3-642-04735-0_2.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/11741557
[85] Andrzej Szalas and Dov Gabbay. 2009.
Voting by Eliminating Quantifiers.
Studia Logica: An International Journal for Symbolic Logic, 92(3):365–379. Springer.
DOI: 10.1007/s11225-009-9200-7.
[84] Andrzej Szalas and Linh Anh Nguyen. 2009.
EXPTIME Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC.
In Ngoc Thanh; Kowalczyk, Ryszard; Chen, Shyi-Ming, editors, Proceedings of the 1st International Conference on Computational Collective Intelligence - Semantic Web, Social Networks & Multiagent Systems (ICCCI), pages 437–448. In series: Lecture Notes in Artificial Intelligence #5796. Springer. ISBN: 978-3-642-04440-3.
DOI: 10.1007/978-3-642-04441-0_38.
[83] Linh Anh Nguyen and Andrzej Szalas. 2009.
A tableau calculus for regular grammar logics with converse.
In Proceedings of the 22nd International Conference on Automated Deduction (CADE), pages 421–436. In series: Lecture Notes in Artificial Intelligence #5663. Springer. ISBN: 978-364202958-5.
DOI: 10.1007/978-3-642-02959-2_31.
2008
[82] Andrzej Szalas. 2008.
Towards Incorporating Background Theories into Quantifier Elimination.
Journal of applied non-classical logics, 18(2-3):325–340. √Čditions Herm√®s-Lavoisier.
DOI: 10.3166/jancl.18.325-340.
[81] Patrick Doherty and Andrzej Szalas. 2008.
Reasoning with Qualitative Preferences and Cardinalities Using Generalized Circumscription.
In Gerhard Brewka, J√©r√īme Lang, editors, Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 560–570. AAAI Press. ISBN: 978-1-57735-384-3.
[80] Dov M. Gabbay, Renate A. Schmidt and Andrzej Szalas. 2008.
Second-Order Quantifier Elimination. Foundations, Computational Aspects and Applications.
Book. In series: Studies in Logics #12. College Publications. 308 pages. ISBN: 978-1-904987-56-7, 1-904-98-756-7.
link: http://www.amazon.com/Second-Order-Quant...
[79] Full text  Aida Vitoria, Andrzej Szalas and Jan Maluszynski. 2008.
Four-valued Extension of Rough Sets.
In Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), pages 106–114. In series: Lecture Notes in Computer Science #5009. Springer. ISBN: 978-3-540-79720-3.
DOI: 10.1007/978-3-540-79721-0_19.
[78] Jan Maluszynski, Aida Vitoria and Andrzej Szalas. 2008.
Paraconsistent Logic Programs with Four-valued Rough Sets.
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pages 41–51. In series: Lecture Notes in Computer Science #5306. Springer. ISBN: 978-3-540-88423-1 (print), 978-3-540-88425-5 (online).
DOI: 10.1007/978-3-540-88425-5_5.
2007
[77] Barbara Dunin-Keplicz and Andrzej Szalas. 2007.
Towards Approximate BGI Systems.
In Proceedings of the 5th International Central and Eastern European Conference on Multi-Agent Systems (CEEMAS), pages 277–287. In series: Lecture Notes in Artificial Intelligence #4696. Springer Berlin/Heidelberg. ISBN: 9783540752530.
DOI: 10.1007/978-3-540-75254-7_28.
[76] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2007.
Communication between agents with heterogeneous perceptual capabilities.
Information Fusion, 8(1):56–69. Elsevier.
DOI: 10.1016/j.inffus.2005.05.006.
[75] Full text  D.M. Gabbay and Andrzej Szalas. 2007.
Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals.
Studia Logica: An International Journal for Symbolic Logic, 87(1):37–50. Springer.
DOI: 10.1007/s11225-007-9075-4.
[74] Full text  Patrick Doherty and Andrzej Szalas. 2007.
A correspondence framework between three-valued logics and similarity-based approximate reasoning.
Fundamenta Informaticae, 75(1-4):179–193. IOS Press.
[73] Patrick Doherty, Barbara Dunin-Keplicz and Andrzej Szalas. 2007.
Dynamics of approximate information fusion.
In Proceedings of the International Conference on Rough Sets and Emerging Intelligent Systems Paradigms (RSEISP), pages 668–677. In series: Lecture Notes in Artificial Intelligence #4585. Springer Berlin/Heidelberg. ISBN: 978-3-540-73450-5.
DOI: 10.1007/978-3-540-73451-2_70.
[72] Jan Maluszynski, Andrzej Szalas and Aida Vitoria. 2007.
A Four-Valued Logic for Rough Set-Like Approximate Reasoning.
In James F. Peters, Andrzej Skowron, Ivo D√ľntsch, Jerzy Grzymala-Busse, Ewa Orlowska and Lech Polkowski, editors, Transactions on Rough Sets VI, pages 176–190. In series: Lecture Notes in Computer Science #4374/2007. Springer. ISBN: 3-540-71198-8, 978-3-540-71198-8.
DOI: 10.1007/978-3-540-71200-8_11.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/11381912
2006
[71] Ewa Orlowska, Alberto Policriti and Andrzej Szalas. 2006.
Algebraic and Relational Deductive Tools.
Conference Proceedings. In series: Journal of Applied Non-Classical Logics #??. √Čditions Herm√®s-Lavoisier.
Note: Special Issue
[70] Full text  Andrzej Szalas and Jerzy Tyszkiewicz. 2006.
On the fixpoint theory of equality and its applications.
In Proceedings of the 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra (RelMiCS/AKA), pages 388–401. In series: Lecture Notes in Computer Science #4136. Springer.
DOI: 10.1007/11828563_26.
[69] Andrzej Szalas. 2006.
Second-order Reasoning in Description Logics.
Journal of applied non-classical logics, 16(3 - 4):517–530. √Čditions Herm√®s-Lavoisier.
DOI: 10.3166/jancl.16.517-530.
[68] Ewa Orlowska and Andrzej Szalas. 2006.
Quantifier Elimination in Elementary Set Theory.
In W. MacCaull, I. Duentsch, M. Winter, editors, Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS), pages 237–248. In series: Lecture Notes in Computer Science #3929. Springer Berlin/Heidelberg.
DOI: 10.1007/11734673_19.
[67] Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron and Andrzej Szalas. 2006.
Knowledge Representation Techniques.: a rough set approach.
Book. In series: Studies in Fuzziness and Soft Computing #202. Springer. 342 pages. ISBN: 978-3-540-33518-4, 3-540-33518-8.
DOI: 10.1007/3-540-33519-6.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q=9...
[66] Full text  Patrick Doherty, Martin Magnusson and Andrzej Szalas. 2006.
Approximate Databases: A support tool for approximate reasoning.
Journal of applied non-classical logics, 16(1-2):87–118. √Čditions Herm√®s-Lavoisier.
DOI: 10.3166/jancl.16.87-117.
Note: Special issue on implementation of logics
2005
[65] Full text  Patrick Doherty, Andrzej Szalas and Witold Lukaszewicz. 2005.
Similarity, approximations and vagueness.
In Dominik Slezak, Guoyin Wang, Marcin S. Szczuka, Ivo D√ľntsch, Yiyu Yao, editors, Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC), pages 541–550. In series: Lecture Notes in Artificial Intelligence #3641. Springer. ISBN: 3-540-28653-5.
DOI: 10.1007/11548669_56.
[64] Michali Grabowski and Andrzej Szalas. 2005.
A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies.
In Proceedings of the 3rd Atlantic Web Intelligence Conference (AWIC), pages 991–995. In series: Lecture Notes in Computer Science #3528. Springer.
DOI: 10.1007/11495772_29.
[63] Full text  Martin Magnusson, Patrick Doherty and Andrzej Szalas. 2005.
An Experimental Platform for Approximate Databases.
In 3rd joint SAIS-SSL event on Artificial Intelligence and Learning Systems,2005.
2004
[62] Full text  Patrick Doherty, Steven Kertes, Martin Magnusson and Andrzej Szalas. 2004.
Towards a logical analysis of biochemical pathways.
In Jos√© J√ļlio Alferes and Jo√£o Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA), pages 667–679. In series: Lecture Notes in Computer Science #3229. Springer. ISBN: 978-3-540-23242-1.
DOI: 10.1007/978-3-540-30227-8_55.
[61] Full text  Patrick Doherty, Steven Kertes, Martin Magnusson and Andrzej Szalas. 2004.
Towards a Logical Analysis of Biochemical Reactions (Extended abstract).
In Ramon L√≥pez de M√°ntaras, Lorenza Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 997–998. IOS Press. ISBN: 1-58603-452-9.
[60] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2004.
Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities.
In Proceedings of the 7th International Conference on Information Fusion, pages 175–182. ISIF. ISBN: 91-7056-115-X.
[59] Full text  Patrick Doherty and Andrzej Szalas. 2004.
On the Correspondence between Approximations and Similarity.
In Shusaku Tsumoto, Roman Slowinski, Jan Komorowski and Jerzy W. Grzymala-Busse, editors, Proceedings of the International Conference on Rough Sets and Current Trends in Computing (RSCTC), pages 143–152. In series: Lecture Notes in Computer Science #3066. Springer.
DOI: 10.1007/978-3-540-25929-9_16.
[58] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2004.
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities.
In Didier Dubois, Christopher A. Welty, Mary-Anne Williams, editors, Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning, pages 459–468. AAAI Press. ISBN: 978-1-57735-199-3.
[57] Patrick Doherty, Jaroslaw Kachniarz and Andrzej Szalas. 2004.
Using Contextually Closed Queries for Local Closed-World Reasoning in Rough Knowledge Databases.
In Andrzej Skowron,Lech Polkowski ,Sankar K Pal, editors, Rough-Neural Computing: Techniques for Computing with Words, pages 219–250. In series: Cognitive Technologies #??. Springer. ISBN: 978-3-540-43059-9, 35-4043-059-8.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/14144444
find book in another country/hitta boken i ett annat land: http://www.worldcat.org/title/rough-neur...
[56] Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron and Andrzej Szalas. 2004.
Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge.
In Andrzej Skowron,Lech Polkowski ,Sankar K Pal, editors, Rough-Neural Computing: Techniques for Computing with Words, pages 189–218. In series: Cognitive Technologies #??. Springer. ISBN: 978-3-540-43059-9, 35-4043-059-8.
find book at a swedish library/hitta boken i ett svenskt bibliotek: http://libris.kb.se/bib/14144444
find book in another country/hitta boken i ett annat land: http://www.worldcat.org/search?qt=worldc...
2003
[55] Patrick Doherty, W. Lukaszewicz, Skowron Andrzej and Andrzej Szalas. 2003.
Knowledge Representation and Approximate Reasoning.
Conference Proceedings. In series: Fundamenta Informaticae #2003(57):2-4. IOS Press.
Note: Special Issue
[54] Andrzej Szalas. 2003.
On a logical approach to estimating computational complexity of potentially intractable problems.
In G. Goos, J. Hartmanis, and J. van Leeuwen, editors, Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT), pages 423–431. In series: Lecture Notes in Computer Science #2751. Springer.
DOI: 10.1007/978-3-540-45077-1_39.
[53] Patrick Doherty, A Skowron, Witold Lukaszewicz and Andrzej Szalas. 2003.
1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR).

[52] Full text  Patrick Doherty, M Grabowski, Witold Lukaszewicz and Andrzej Szalas. 2003.
Towards a framework for approximate ontologies.
Fundamenta Informaticae, 57(2-4):147–165. IOS Press.
[51] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2003.
On mutual understanding among communicating agents.
In B. Dunin-Keplicz and R. Verbrugge, editors, Proceedings of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS), pages 83–97.
[50] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2003.
Tolerance Spaces and Approximative Representational Structures.
In Proceedings of the 26th German Conference on Artificial Intelligence (KI), pages 475–489. In series: Lecture Notes in Computer Science #2821. Springer.
DOI: 10.1007/978-3-540-39451-8_35.
[49] Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2003.
Information Granules for Intelligent Knowledge Structures.
In Guoyin Wang, Qing Liu, Yiyu Yao, Andrzej Skowron, editors, Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC), pages 405–412. In series: Lecture Notes in Computer Science #2639. Springer. ISBN: 978-3-540-14040-5.
DOI: 10.1007/3-540-39205-X_68.
2002
[48] Andrzej Szalas. 2002.
Second-order quantifier elimination in modal contexts.
In Sergio Flesca, Sergio Greco, Nicola Leone, Giovambattista Ianni, editors, Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), pages 223–232. In series: Lecture Notes in Computer Science #2424. Springer. ISBN: 978-354044190-8.
DOI: 10.1007/3-540-45757-7_19.
[47] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2002.
CAKE: A computer aided knowledge engineering technique.
In Frank van Harmelen, editor, Proceedings of the 15th European Conference on Artificial Intelligence,2002, pages 220–224. IOS Press.
2001
[46] Jaroslaw Kachniarz and Andrzej Szalas. 2001.
On a Static Approach to Verification of Integrity Constraints in Relational Databases.
In Eva Orlowska, Andrzej Szalas, editors, Relational Methods for Computer Science Applications, pages 97–109. In series: Studies in Fuzziness and Soft Computing #65. Springer Physica-Verlag. ISBN: 3-7908-1365-6.
Find book at a Swedish library/Hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q=3...
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=3-7908-...
[45] Ewa Orlowska and Andrzej Szalas. 2001.
Relational Methods for Computer Science Applications.
In series: Studies in Fuziness and Soft Computing #??. Springer Physica Verlag. 297 pages. ISBN: 37-9081-365-6, 978-37-9081-365-4.
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=37-9081...
[44] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2001.
Computing strongest necessary and weakest sufficient conditions of first-order formulas.
In 17th International Joint Conference on Artificial Intelligence,2001. Morgan Kaufmann.
2000
[43] Jaroslaw Kachniarz and Andrzej Szalas. 2000.
Algorithms based on Symbolic Transformations of Logical Formulas in the RDL Language.
In Proceedings of the 2nd Conference on Applications of Computer Science in Mathematics and Economy, pages 101–115. WSIiE, Olsztyn, Poland.
[42] Jaroslaw Kachniarz and Andrzej Szalas. 2000.
On Rule-Based Approach to the Construction of Logical Transformers.
In Proceedings of the 1st International Workshop on Rule-Based Programming (RULE), pages 57–71. Springer Physica-Verlag.
[41] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 2000.
Efficient reasoning using the local closed-world assumption.
In Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA), pages 49–58. In series: Lecture Notes in Computer Science #1904. Springer. ISBN: 3-540-41044-9.
DOI: 10.1007/3-540-45331-8_5.
1999
[40] Andreas Nonnengart, Hans-J√ľrgen Ohlbach and Andrzej Szalas. 1999.
Elimination of Predicate Quantifiers.
In Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pages 159–181. Kluwer Academic Publishers.
[39] Full text  Patrick Doherty, Jaroslaw Kachniarz and Andrzej Szalas. 1999.
Meta-queries on deductive databases.
Fundamenta Informaticae, 40(1):17–30. IOS Press.
DOI: 10.3233/FI-1999-40102.
[38] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1999.
Declarative PTIME queries for relational databases using quantifier elimination.
Journal of logic and computation (Print), 9(5):737–758. Oxford University Press.
DOI: 10.1093/logcom/9.5.737.
1998
[37] Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szalas. 1998.
Wnioskowanie w logikach nieklasycznych: Automatyzacja wnioskowania.
Book. Academic Pub. PLJ (Akademicka Oficyna Wydawnicza PLJ). 159 pages. ISBN: 83-7101-403-1, 978-83-7101-403-1.
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=83-7101...
[36] Andreas Nonnengart and Andrzej Szalas. 1998.
A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory.
In Ewa Orlowska, editor, Logic at work: essays dedicated to the memory of Helena Rasiowa, pages 307–328. In series: Studies in Fuzziness and Soft Computing #24. Physica Verlag. ISBN: 3-7908-1164-5.
Find book at a Swedish library/Hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q=3...
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=3-7908-...
[35] Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1998.
General domain circumscription and its effective reductions.
Fundamenta Informaticae, 36(1):23–55. IOS Press.
DOI: 10.3233/FI-1998-3612.
1997
[34] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1997.
Computing circumscription revisited: A reduction algorithm.
Journal of automated reasoning, 18(3):297–336. Kluwer Academic Publishers.
DOI: 10.1023/A:1005722130532.
1996
[33] Andrzej Szalas. 1996.
On Natural Deduction in First-Order Fixpoint Logics.
Fundamenta Informaticae, 26(1):81–94. IOS Press.
DOI: 10.3233/FI-1996-2616.
[32] Wojciech Penczek and Andrzej Szalas. 1996.
Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science (MFCS).
Conference Proceedings. In series: Lecture Notes in Computer Science #1113. Springer Verlag. ISBN: 978-3-540-61550-7.
Link: http://www.springer.com/computer/foundat...
[31] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1996.
Declarative ptime queries to relational databases.
Technical Report. In series: LITH-IDA-R #34. Department of Computer and Information Science, Link√∂ping University.
[30] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1996.
General domain circumscription and its first-order reduction.
Technical Report. In series: LITH-IDA-R #1. Department of Computer and Information Science, Link√∂ping University.
[29] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1996.
A reduction result for circumscribed semi-horn formulas.
Fundamenta Informaticae, 28(3,4):261–272. IOS Press.
DOI: 10.3233/FI-1996-283404.
[28] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1996.
Explaining explanation closure.
In Zbigniew W. Ras, Maciek Michalewicz, editors, Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems,1996, pages 521–530. In series: Lecture Notes in Computer Science #1079. Springer Berlin/Heidelberg. ISBN: 3-540-61286-6.
DOI: 10.1007/3-540-61286-6_176.
[27] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1996.
General domain circumscription and its first-order reduction.
In Dov Gabbay, Hans Olbach, editors, Proceedings of the 1st International Conference on Formal and Applied Practical Reasoning (FAPR), pages 93–109. In series: Lecture Notes in Computer Science #1085. Springer Berlin/Heidelberg. ISBN: 978-3-540-61313-8.
DOI: 10.1007/3-540-61313-7_65.
1995
[26] Leonard Bolc and Andrzej Szalas. 1995.
Time and Logic: A Computational Approach.
CRC Press. 325 pages. ISBN: 1-85728-233-7, 978-18-5728-233-7.
Find book at a Swedish library/Hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q= ...
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q= 978-18...
[25] Andrzej Szalas. 1995.
Temporal Logic: A Standard Approach.
In Leonard Bolc, Andrzej Szalas, editors, Time And Logic: A Computational Approach, pages 1–50. UCL Press Ltd.. ISBN: 1-85728-233-7, 978-1857282337.
Find book at a Swedish library/Hitta boken i ett svenskt bibliotek: http://libris.kb.se/hitlist?d=libris&q=1...
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=978-185...
[24] Leonard Bolc, Krzysztof Dziewicki, Piotr Rychlik and Andrzej Szalas. 1995.
Wnioskowanie w logikach nieklasycznych: Podstawy teoretyczne.
Book. Academic Pub. PLJ (Akademicka Oficyna Wydawnicza PLJ). 247 pages. ISBN: 9788371012884.
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=9788371...
[23] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1995.
A characterization result for circumscribed normal logic programs. Revised version accepted for publication: Special issue of honor of H. Rasiowa, Fundamenta Informaticae.
Technical Report. In series: LITH-IDA-R #20. Department of Computer and Information Science, Link√∂ping University.
[22] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1995.
Computing circumscription revisited.
In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pages 1502–1508. ISBN: 978-1558603639.
Note: Volume 2. Preliminary report
1994
[21] Andrzej Szalas. 1994.
On an Automated Translation of Modal Proof Rules into Formulas of the Classical Logic.
Journal of Applied Non-Classical Logics, 4(2):119–127. √Čditions Herm√®s-Lavoisier.
[20] Andrzej Szalas. 1994.
Genetic Algorithms for Decision Problems.
In Proceedings of the 6th International Conference on Artificial Intelligence and Information-Control Systems of Robots (AIICSR), pages 383–390. World Scientific. ISBN: 981-02-1877-X.
[19] Full text  Patrick Doherty, Witold Lukaszewicz and Andrzej Szalas. 1994.
Computing circumscription revisited: A reduction algorithm.
Technical Report. In series: LITH-IDA-R #94-42. Department of Computer and Information Science, Link√∂ping University.
1993
[18] Andrzej Szalas. 1993.
On the Correspondence between Modal and Classical Logic: An Automated Approach.
Journal of logic and computation (Print), 3(6):605–620. Oxford University Press.
DOI: 10.1093/logcom/3.6.605.
1992
[17] Andrzej Szalas. 1992.
Axiomatizing Fixpoint Logics.
Information Processing Letters, 41(4):175–180. Elsevier.
DOI: 10.1016/0020-0190(92)90175-U.
[16] Andrzej Szalas. 1992.
Zarys dedukcyjnych metod automatycznego wnioskowania.
Book. Academic Pub. RM (Akademicka Oficyna Wydawnicza RM). 120 pages. ISBN: 83-9004-517-6, 978-83-9004-517-7.
1991
[15] Andrzej Szalas. 1991.
On Strictly Arithmetical Completeness in Logics of Programs.
Theoretical Computer Science, 79(2):341–355. Elsevier.
DOI: 10.1016/0304-3975(91)90336-Z.
[14] Andrzej Szalas and Jolanta Warpechowska. 1991.
Loglan.
Book. Wydawnictwa Naukowo-Techniczne WNT. 172 pages. ISBN: 83-2041-295-1, 978-83-2041-295-6.
Note: In Polish; Volume 78, Biblioteka InŇľynierii Oprogramowania
Find book in another country/Hitta boken i ett annat land: http://www.worldcat.org/search?q=83-2041...
1989
[13] Uwe Petermann and Andrzej Szalas. 1989.
On Temporal Logic for Distributed Systems and its Application to Processes Communicating by Interrupts.
Fundamenta Informaticae, 12(2):191–204. IOS Press.
1988
[12] Andrzej Szalas. 1988.
Towards the Temporal Approach to Abstract Data Types.
Fundamenta Informaticae, 11(1):49–64. IOS Press.
[11] Andrzej Szalas. 1988.
An Incompleteness Result in Process Algebra.
Information Processing Letters, 29(2):67–70. Elsevier.
DOI: 10.1016/0020-0190(88)90030-0.
[10] Leszek Holenderski and Andrzej Szalas. 1988.
Propositional Description of Finite Cause-Effect Structures.
Information Processing Letters, 27(3):111–117. Elsevier.
DOI: 10.1016/0020-0190(88)90064-6.
[9] Andrzej Szalas and Leszek Holenderski. 1988.
Incompleteness of First-Order Temporal Logic with Until.
Theoretical Computer Science, 57(2-3):317–325. Elsevier.
DOI: 10.1016/0304-3975(88)90045-X.
1987
[8] Andrzej Szalas. 1987.
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time.
Theoretical Computer Science, 54(2-3):199–214. Elsevier.
DOI: 10.1016/0304-3975(87)90129-0.
[7] Andrzej Szalas. 1987.
Arithmetical Axiomatization of First-Order Temporal Logic.
Information Processing Letters, 26(3):111–116. Elsevier.
DOI: 10.1016/0020-0190(87)90047-0.
[6] R. J. Cunningham, Andreas Nonnengart and Andrzej Szalas. 1987.
A Compositional Method for the Design and Proof of Asynchronous Processes.
In Proceedings of the 4th Annual ESPRIT Conference (ESPRIT), pages 566–580. North-Holland. ISBN: 0-444-70333-0.
1986
[5] Andrzej Szalas. 1986.
Concerning the Semantic Consequence Relation in First-Order Temporal Logic.
Theoretical Computer Science, 47(3):329–334. Elsevier.
DOI: 10.1016/0304-3975(86)90157-X.
1985
[4] Uwe Petermann and Andrzej Szalas. 1985.
A Note on PCI: Distributed Processes Communicating by Interrupts.
SIGPLAN notices, 20(3):37–46. ACM Press.
DOI: 10.1145/382284.382390.
[3] Andrzej Szalas and Danuta Szczepaska. 1985.
Exception Handling in Parallel Computations.
SIGPLAN notices, 20(10):95–104. ACM Press.
DOI: 10.1145/382286.382385.
1984
[2] Andrzej Szalas. 1984.
On an Application of Algorithmic Theory of Stacks.
Fundamenta Informaticae, 7(3):378–388. IOS Press.
1981
[1] Andrzej Szalas. 1981.
Algorithmic Logic with Recursive Functions.
Fundamenta Informaticae, 4(4):975–995. IOS Press.