By Associate Professor Michael Maher

Book Chapters

Antoniou G; Maher MJ, 2002, 'Embedding Defeasible Logic into Logic Programs', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 393 - 404, http://dx.doi.org/10.1007/3-540-45619-8_27

Maher MJ, 2002, 'Propagation Completeness of Reactive Constraints', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 148 - 163, http://dx.doi.org/10.1007/3-540-45619-8_11

Wang J; Maher M; Topor R, 2002, 'Rewriting Unions of General Conjunctive Queries Using Views', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 52 - 69, http://dx.doi.org/10.1007/3-540-45876-x_6

Wang J; Topor R; Maher M, 2001, 'Reasoning with Disjunctive Constrained Tuple-Generating Dependencies', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 963 - 973, http://dx.doi.org/10.1007/3-540-44759-8_93

Beaumont M; Sattar A; Maher M; Thornton J, 2001, 'Solving Overconstrained Temporal Reasoning Problems', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 37 - 49, http://dx.doi.org/10.1007/3-540-45656-2_4

Maher MJ, 2000, 'A Denotational Semantics of Defeasible Logic', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 209 - 222, http://dx.doi.org/10.1007/3-540-44957-4_14

Governatori G; Maher MJ; Antoniou G; Billington D, 2000, 'Argumentation Semantics for Defeasible Logics', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 27 - 37, http://dx.doi.org/10.1007/3-540-44533-1_7

Maher M; Wang J, 2000, 'Optimizing Queries in Extended Relational Databases', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 386 - 396, http://dx.doi.org/10.1007/3-540-44469-6_36

Antoniou G; Maher MJ; Billington B; Governatori G, 1999, 'A Comparison of Sceptical NAF-Free Logic Programming Approaches', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 347 - 356, http://dx.doi.org/10.1007/3-540-46767-x_25

Maher MJ, 1999, 'Adding Constraints to Logic-based Formalisms', in Artificial Intelligence, Springer Berlin Heidelberg, pp. 313 - 331, http://dx.doi.org/10.1007/978-3-642-60085-2_13

Billington D; Antoniou G; Governatori G; Maher M, 1999, 'Revising Nonmonotonic Theories: The Case of Defeasible Logic', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 101 - 112, http://dx.doi.org/10.1007/3-540-48238-5_8

Jaffar J; Maher MJ, 1998, 'Constraint Logic Programming: A Survey', in Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 5: Logic Programming, Oxford University Press, http://dx.doi.org/10.1093/oso/9780198537922.003.0012

Maher MJ; Antoniou G; Billington D, 1998, 'A study of provability in defeasible logic', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 215 - 226, http://dx.doi.org/10.1007/bfb0095054

Brodsky A; Jaffar J; Maher MJ, 1997, 'Toward Practical Query Evaluation for Constraint Databases', in Constraints and Databases, Springer US, pp. 41 - 66, http://dx.doi.org/10.1007/978-1-4615-5515-5_3

Maher MJ, 1995, 'Constrained dependencies', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 170 - 185, http://dx.doi.org/10.1007/3-540-60299-2_11

Jaffar J; Maher MJ; Stuckey PJ; Yap RHC, 1994, 'Beyond finite domains', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 86 - 94, http://dx.doi.org/10.1007/3-540-58601-6_92

Lassez J-L; Maher M; Marriott K, 1991, 'Elimination of negation in term algebras', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 1 - 16, http://dx.doi.org/10.1007/3-540-54345-7_44

Maher MJ, 1989, 'A transformation system for deductive database modules with perfect model semantics', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 89 - 98, http://dx.doi.org/10.1007/3-540-52048-1_35

Maher MJ, 1988, 'Equivalences of Logic Programs', in Foundations of Deductive Databases and Logic Programming, Elsevier, pp. 627 - 658, http://dx.doi.org/10.1016/b978-0-934613-40-8.50020-8

Lassez J-L; Maher MJ; Marriott K, 1988, 'Unification revisited', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 67 - 113, http://dx.doi.org/10.1007/3-540-19129-1_4

Lassez J-L; Maher MJ; Marriott K, 1988, 'Unification Revisited', in Foundations of Deductive Databases and Logic Programming, Elsevier, pp. 587 - 625, http://dx.doi.org/10.1016/b978-0-934613-40-8.50019-1

Jaffar J; Lassez J-L; Maher MJ, 1986, 'Some issues and trends in the semantics of logic programming', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 223 - 241, http://dx.doi.org/10.1007/3-540-16492-8_78

Maher MJ, 'A CLP view of logic programming', in Lecture Notes in Computer Science, Springer-Verlag, pp. 364 - 383, http://dx.doi.org/10.1007/bfb0013838

Barbuti R; Codish M; Giacobazzi R; Maher M, 'Oracle semantics for Prologa', in Lecture Notes in Computer Science, Springer-Verlag, pp. 100 - 114, http://dx.doi.org/10.1007/bfb0013822

Back to profile page