| Computing circumscription revisited: A reduction algorithm P Doherty, W Łukaszewicz, A Szałas Journal of Automated Reasoning 18, 297-336, 1997 | 175 | 1997 |
| Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications DM Gabbay, R Schmidt, A Szalas College Publications, 2008 | 120 | 2008 |
| Knowledge representation techniques: a rough set approach P Doherty, W Lukaszewicz, A Szalas Springer, 2007 | 119* | 2007 |
| Incompleteness of first-order temporal logic with until A Szalas, L Holenderski Theoretical Computer Science 57 (2-3), 317-325, 1988 | 78 | 1988 |
| A fixpoint approach to second-order quantifier elimination with applications to correspondence theory A Nonnengart, A Szalas Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa 24, 1999 | 76* | 1999 |
| On the correspondence between modal and classical logic: an automated approach A Szalas Journal of Logic And Computation 6 (3), 605-620, 1993 | 74 | 1993 |
| Concerning the semantic consequence relation in first-order temporal logic A Szalas Theoretical Computer Science 47, 329-334, 1986 | 70 | 1986 |
| Living with inconsistency and taming nonmonotonicity J Małuszyński, A Szałas Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK …, 2011 | 59 | 2011 |
| Computing strongest necessary and weakest sufficient conditions of first-order formulas P Doherty, W Lukaszewicz, A Szalas IJCAI 1, 145-154, 2001 | 57 | 2001 |
| Modeling and reasoning with paraconsistent rough sets A Vitória, J Małuszyński, A Szałas Fundamenta Informaticae 97 (4), 405-438, 2009 | 54 | 2009 |
| Efficient reasoning using the local closed-world assumption P Doherty, W Lukaszewicz, A Szalas AIMSA, 49-58, 2000 | 52 | 2000 |
| A complete axiomatic characterization of first-order temporal logic of linear time A Szalas Theoretical Computer Science 54 (2-3), 199-214, 1987 | 50 | 1987 |
| Partiality and inconsistency in agents’ belief bases J Małuszynski, A Szałas KES-AMSTA, Frontiers of Artificial Intelligence and Applications 252, 3-17, 2013 | 46 | 2013 |
| Time & Logic: a computational approach L Bolc, A Szałas Routledge, 2019 | 45 | 2019 |
| Logical foundations and complexity of 4QL, a query language with unrestricted negation J Maluszyński, A Szalas Journal of Applied Non-Classical Logics 21 (2), 211-232, 2011 | 40 | 2011 |
| Tolerance spaces and approximative representational structures P Doherty, W Łukaszewicz, A Szałas KI 2003: Advances in Artificial Intelligence: 26th Annual German Conference …, 2003 | 40 | 2003 |
| Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic B Dunin-Kęplicz, LA Nguyen, A Szałas International journal of approximate reasoning 51 (3), 346-362, 2010 | 35 | 2010 |
| Using contextually closed queries for local closed-world reasoning in rough knowledge databases P Doherty, J Kachniarz, A Szalas Rough-Neural Computing: Techniques for Computing with Words, 219-250, 2004 | 35 | 2004 |
| Elimination of predicate quantifiers A Nonnengart, HJ Ohlbach, A Szałas Logic, Language and Reasoning: Essays in honour of Dov Gabbay, 149-171, 1999 | 33 | 1999 |
| How an agent might think A Szałas Logic Journal of IGPL 21 (3), 515-535, 2013 | 31 | 2013 |
Patrick DohertyProfessor of Computer Science, Linköping University, SwedenVerified email at liu.se
