By Honorary Associate Professor Michael Maher

Journal articles

Maher MJ, 2025, 'Which are the true defeasible logics?', Journal of Applied Non Classical Logics, 35, pp. 215 - 243, http://dx.doi.org/10.1080/11663081.2024.2386918

Maher MJ, 2023, 'Defeasible Reasoning via Datalog', Theory and Practice of Logic Programming, 23, pp. 986 - 1028, http://dx.doi.org/10.1017/S1471068421000387

EITER T; MAHER M; PONTELLI E; DE RAEDT LUC; TRUSZCZYNSKI M, 2023, 'The Collection of Papers Celebrating the 20th Anniversary of TPLP, Part II', Theory and Practice of Logic Programming, 23, pp. 1 - 1, http://dx.doi.org/10.1017/s1471068422000394

Eiter T; Maher M; Pontelli E; De Raedt L; Truszczynski M, 2022, 'Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP', Theory and Practice of Logic Programming, 22, pp. 770 - 775, http://dx.doi.org/10.1017/S1471068422000345

Maher MJ, 2022, 'On Signings and the Well-Founded Semantics', Theory and Practice of Logic Programming, 22, pp. 115 - 127, http://dx.doi.org/10.1017/S1471068421000077

Governatori G; Maher MJ; Olivieri F, 2021, 'Strategic argumentation', Journal of Applied Logics, 8, pp. 1679 - 1748

Maher MJ; Tachmazidis I; Antoniou G; Wade S; Cheng L, 2020, 'Rethinking Defeasible Reasoning: A Scalable Approach', Theory and Practice of Logic Programming, 20, pp. 552 - 586, http://dx.doi.org/10.1017/S1471068420000010

Governatori G; Maher MJ, 2017, 'Annotated defeasible logic', Theory and Practice of Logic Programming, 17, pp. 819 - 836, http://dx.doi.org/10.1017/S1471068417000266

Maher MJ, 2017, 'Contractibility for open global constraints', Theory and Practice of Logic Programming, 17, pp. 365 - 407, http://dx.doi.org/10.1017/S1471068417000126

Maher MJ, 2017, 'Relating concrete defeasible reasoning formalisms and abstract argumentation', Fundamenta Informaticae, 155, pp. 233 - 260, http://dx.doi.org/10.3233/FI-2017-1584

Ahmed M; Anwar A; MAHMOOD A; Shah Z; Maher MJ, 2015, 'An Investigation of Performance Analysis of Anomaly Detection Techniques for Big Data in SCADA Systems', ICST Transactions on Industrial Networks and Intelligent Systems, 2, pp. e5, http://dx.doi.org/10.4108/inis.2.3.e5

Ahmed M; Mahmood AN; Maher MJ, 2015, 'An Efficient Technique For Network Traffic Summarization Using Multiview Clustering And Statistical Sampling', Eai Endorsed Transactions on Scalable Information Systems, 2, pp. 1 - 9, http://dx.doi.org/10.4108/sis.2.5.e4

Maher MJ, 2013, 'Relative Expressiveness of Defeasible Logics II', Theory and Practice of Logic Programming, 13, pp. 579 - 592, http://dx.doi.org/10.1017/S1471068413000367

Maher M, 2012, 'Relative Expressiveness of Defeasible Logics', Theory and Practice of Logic Programming, 12, pp. 793 - 810, http://dx.doi.org/10.1017/S1471068412000294

Billington D; Antoniou G; Governatori G; Maher M, 2010, 'An inclusion theorem for defeasible logics', ACM Transactions on Computational Logic, 12, http://dx.doi.org/10.1145/1838552.1838558

Maher M, 2009, 'Local consistency for extended CSPs', Theoretical Computer Science, 410, pp. 4769 - 4783

Falaschi M; Maher M, 2007, 'Introduction Special Issue on Multiparadigm Languages and Constraint Programming', Theory and Practice of Logic Programming, 7, pp. 1 - 2

Maher M; Antoniou G; Billington D; Governatori G, 2006, 'Embedding defeasible logic in logic programming', Theory and Practice of Logic Programming, 6, pp. 703 - 735

Wang J; Topor RW; Maher M, 2005, 'Rewriting Union Queries Using Views', Constraints, 10, pp. 219 - 251

Governatori G; Maher MJ; Antoniou G; Billington D, 2004, 'Argumentation semantics for defeasible logic', Journal of Logic and Computation, 14, pp. 675 - 702, http://dx.doi.org/10.1093/logcom/14.5.675

Jaffar J; Maher MJ, 2002, 'Guest Editorial', Constraints, 7, pp. 227 - 228, http://dx.doi.org/10.1023/a:1020564731987

MAHER MJ; ROCK A; ANTONIOU G; BILLINGTON D; MILLER T, 2001, 'EFFICIENT DEFEASIBLE REASONING SYSTEMS', International Journal of Artificial Intelligence Tools, 10, pp. 483 - 501, http://dx.doi.org/10.1142/s0218213001000623

MAHER MJ, 2001, 'Propositional defeasible logic has linear complexity', Theory and Practice of Logic Programming, 1, pp. 691 - 711, http://dx.doi.org/10.1017/s1471068401001168

Antoniou G; Billington D; Governatori G; Maher MJ, 2001, 'Representation results for defeasible logic', ACM Transactions on Computational Logic, 2, pp. 255 - 287, http://dx.doi.org/10.1145/371316.371517

Antoniou G; Maher MJ; Billington D, 2000, 'Defeasible logic versus Logic Programming without Negation as Failure', The Journal of Logic and Algebraic Programming, 42, pp. 47 - 57, http://dx.doi.org/10.1016/s0743-1066(99)00060-6

Brodsky A; Lassez C; Lassez J-L; Maher MJ, 1999, 'Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data', Journal of Automated Reasoning, 23, pp. 83 - 104, http://dx.doi.org/10.1023/a:1006171919920

Jaffar J; Maher M; Marriott K; Stuckey P, 1998, 'The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1', The Journal of Logic and Algebraic Programming, 37, pp. 1 - 46, http://dx.doi.org/10.1016/s0743-1066(98)10002-x

Maher MJ, 1997, 'Constrained dependencies', Theoretical Computer Science, 173, pp. 113 - 149, http://dx.doi.org/10.1016/s0304-3975(96)00193-4

Brodsky A; Jaffar J; Maher MJ, 1997, 'Toward Practical Query Evaluation for Constraint Databases', Constraints, 2, pp. 279 - 304, http://dx.doi.org/10.1023/a:1009795512753

Maher MJ; Stuckey PJ, 1995, 'On inductive inference of cyclic structures', Annals of Mathematics and Artificial Intelligence, 15, pp. 167 - 208, http://dx.doi.org/10.1007/bf01534454

Barbuti R; Codish M; Giacobazzi R; Maher MJ, 1995, 'Oracle Semantics for Prolog', Information and Computation, 122, pp. 178 - 200, http://dx.doi.org/10.1006/inco.1995.1146

Jaffar J; Maher MJ, 1994, 'Constraint logic programming: a survey', The Journal of Logic and Algebraic Programming, 19, pp. 503 - 581, http://dx.doi.org/10.1016/0743-1066(94)90033-7

Bruynooghe M; Debray S; Hermenegildo M; Maher M, 1994, 'Guest editors' introduction', The Journal of Logic and Algebraic Programming, 19, pp. 1 - 3, http://dx.doi.org/10.1016/0743-1066(94)90022-1

Maher MJ, 1993, 'A transformation system for deductive database modules with perfect model semantics', Theoretical Computer Science, 110, pp. 377 - 403, http://dx.doi.org/10.1016/0304-3975(93)90013-j

Jaffar J; Maher MJ; Stuckey PJ; Yap RHC, 1993, 'Projecting CLPR constraints', New Generation Computing, 11, pp. 449 - 469, http://dx.doi.org/10.1007/bf03037187

Lassez J-L; Maher MJ, 1992, 'On Fourier's algorithm for linear arithmetic constraints', Journal of Automated Reasoning, 9, pp. 373 - 379, http://dx.doi.org/10.1007/bf00245296

Jaffar J; Lassez J-L; Maher MJ, 1986, 'Comments on “general failure of logic programs”', The Journal of Logic and Algebraic Programming, 3, pp. 115 - 118, http://dx.doi.org/10.1016/0743-1066(86)90018-x

Lassez J-L; Maher MJ, 1985, 'Optimal fixedpoints of logic programs', Theoretical Computer Science, 39, pp. 15 - 25, http://dx.doi.org/10.1016/0304-3975(85)90128-8

Jaffar J; Lassez J-L; Maher MJ, 1984, 'A theory of complete logic programs with equality', The Journal of Logic and Algebraic Programming, 1, pp. 211 - 223, http://dx.doi.org/10.1016/0743-1066(84)90010-4

Lassez J-L; Maher MJ, 1984, 'Closures and fairness in the semantics of programming logic', Theoretical Computer Science, 29, pp. 167 - 184, http://dx.doi.org/10.1016/0304-3975(84)90017-3

Back to profile page