[Edit]

Michael J. Maher
(ALIAS: M. J. Maher, Michael Maher) [FOAF]  [Follow]

Position: Senior Principal Researcher Associate Professor
Affiliation: National ICT Australia University of New South Wales
Address: National ICT Australia Ltd Locked Bag 6016 University of New South Wales Sydney NSW 1466 Australia
Phone: +61 2 8306 0462
Fax: +61 2 8306 0405
Email:
Homepage: http://www.cse.unsw.edu.au/~mmaher/
[Edit]
Statistics: H-index: 32 (See all experts' h-index.)
total citation number: 4291
highest-cited paper: Unification Revisited (1988) at Foundations of Deductive Databases and Logic Programming. (Cited By 499)

bio:

I am a Senior Principal Researcher (or is that Principal Senior Researcher?) for National ICT Austr ... More

Research Interest:

Logic Programs, defeasible logic, Complete Logic Programs, Embedding Defeasible Logic, Propositional Defeasible Logic

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

2009(5)
[96]Michael J. Maher. SOGgy Constraints: Soft Open Global Constraints.  CP'2009. pp.584~591    Cited By 2[Bibtex]
[95]Michael J. Maher. Open Constraints in a Boundable World.  CPAIOR'2009. pp.163~177    Cited By 4[Bibtex]
[94]Michael J. Maher. Open Contractible Global Constraints.  IJCAI'2009. pp.578~583    Cited By 4[Bibtex]
[93]Michael J. Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh. Flow-Based Propagators for the SEQUENCE and Related Global Constraints. CoRR, 2009.     Cited By 11[Bibtex]
[92]Michael J. Maher. Local consistency for extended CSPs. Theor. Comput. Sci., 2009: 4769~4783    Cited By 1[Bibtex]
2008(2)
[91]Michael J. Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh. Flow-Based Propagators for the SEQUENCE and Related Global Constraints.  CP'2008. pp.159~174    Cited By 11[Bibtex]
[90]Michael J. Maher, Ge Huang. On Computing Constraint Abduction Answers.  LPAR'2008. pp.421~435    Cited By 1[Bibtex]
2007(1)
[89]Moreno Falaschi, Michael J. Maher. Introduction Special Issue on Multiparadigm Languages and Constraint Programming. TPLP, 2007: 1~2   [Bibtex]
2006(2)
[88]Michael J. Maher. Heyting Domains for Constraint Abduction.  Australian Conference on Artificial Intelligence'2006. pp.9~18    Cited By 1[Bibtex] [PDF]
[87]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. Embedding defeasible logic into logic programming. TPLP, 2006: 703~735    Cited By 52[Bibtex] [PDF]
2005(6)
[86]Peter J. Stuckey, Maria J. Garcia de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh. The G12 Project: Mapping Solver Independent Models to Efficient Solutions.  CP'2005. pp.13~16    Cited By 18[Bibtex] [PDF]
[85]Peter J. Stuckey, Maria J. Garcia de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh. The G12 Project: Mapping Solver Independent Models to Efficient Solutions.  ICLP'2005. pp.9~13    Cited By 18[Bibtex] [PDF]
[84]Michael J. Maher. Abduction of Linear Arithmetic Constraints.  ICLP'2005. pp.174~188    Cited By 2[Bibtex] [PDF]
[83]Michael J. Maher. Herbrand Constraint Abduction.  LICS'2005. pp.397~406    Cited By 13[Bibtex] [PDF]
[82]Junhu Wang, Rodney W. Topor, Michael J. Maher. Rewriting Union Queries Using Views. Constraints, 2005: 219~251    Cited By 3[Bibtex]
[81]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. Embedding Defeasible Logic into Logic Programming. CoRR, 2005.     Cited By 52[Bibtex] [PDF]
2004(4)
[80]Matthew Beaumont, John Thornton, Abdul Sattar, Michael J. Maher. Solving Over-Constrained Temporal Reasoning Problems Using Local Search.  PRICAI'2004. pp.134~143    Cited By 5[Bibtex] [PDF]
[79]Michael J. Maher. Propositional Defeasible Logic has Linear Complexity. CoRR, 2004.     Cited By 85[Bibtex] [PDF]
[78]John Thornton, Matthew Beaumont, Abdul Sattar, Michael J. Maher. A Local Search Approach to Modelling and Solving Interval Algebra Problems. J. Log. Comput., 2004: 93~112    Cited By 24[Bibtex] [PDF]
[77]Guido Governatori, Michael J. Maher, Grigoris Antoniou, David Billington. Argumentation Semantics for Defeasible Logic. J. Log. Comput., 2004: 675~702    Cited By 119[Bibtex]
2003(1)
[76]Michael J. Maher. A Synthesis of Constraint Satisfaction and Constraint Solving.  CP'2003. pp.525~539    Cited By 4[Bibtex]
2002(7)
[75]Junhu Wang, Michael J. Maher, Rodney W. Topor. Rewriting General Conjunctive Queries Using Views.  Australasian Database Conference'2002.     Cited By 15[Bibtex] [PDF]
[74]Junhu Wang, Michael J. Maher, Rodney W. Topor. Rewriting Unions of General Conjunctive Queries Using Views.  EDBT'2002. pp.52~69    Cited By 10[Bibtex]
[73]Grigoris Antoniou, Michael J. Maher. Embedding Defeasible Logic into Logic Programs.  ICLP'2002. pp.393~404    Cited By 9[Bibtex] [PDF]
[72]Michael J. Maher. Propagation Completeness of Reactive Constraints.  ICLP'2002. pp.148~162    Cited By 17[Bibtex] [PDF]
[71]Michael J. Maher. A Model-Theoretic Semantics for Defeasible Logic.  Paraconsistent Computational Logic'2002. pp.67~80    Cited By 26[Bibtex] [PDF]
[70]John Thornton, Matthew Beaumont, Abdul Sattar, Michael J. Maher. Applying Local Search to Temporal Reasoning.  TIME'2002. pp.94~99    Cited By 9[Bibtex] [PDF]
[69]Joxan Jaffar, Michael J. Maher. Guest Editorial. Constraints, 2002: 227~228   [Bibtex]
2001(5)
[68]Matthew Beaumont, Abdul Sattar, Michael J. Maher, John Thornton. Solving Overconstrained Temporal Reasoning Problems.  Australian Joint Conference on Artificial Intelligence'2001. pp.37~49    Cited By 9[Bibtex] [PDF]
[67]Junhu Wang, Rodney W. Topor, Michael J. Maher. Reasoning with Disjunctive Constrained Tuple-Generating Dependencies.  DEXA'2001. pp.963~973    Cited By 6[Bibtex]
[66]Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller. Efficient Defeasible Reasoning Systems. International Journal on Artificial Intelligence Tools, 2001: 483~501    Cited By 103[Bibtex] [PDF]
[65]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. Representation results for defeasible logic. ACM Trans. Comput. Log., 2001: 255~287    Cited By 189[Bibtex] [PDF]
[64]Michael J. Maher. Propositional Defeasible Logic has Linear Complexity. TPLP, 2001: 691~711    Cited By 85[Bibtex] [PDF]
2000(10)
[63]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. A Flexible Framework for Defeasible Logics.  AAAI/IAAI'2000. pp.405~410    Cited By 78[Bibtex] [PDF]
[62]Michael J. Maher. A Denotational Semantics of Defeasible Logic.  Computational Logic'2000. pp.209~222    Cited By 12[Bibtex]
[61]Michael J. Maher, Junhu Wang. Optimizing Queries in Extended Relational Databases.  DEXA'2000. pp.386~396    Cited By 9[Bibtex]
[60]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock. A Family of Defeasible Reasoning Logics and its Implementation.  ECAI'2000. pp.459~463    Cited By 44[Bibtex] [PDF]
[59]Guido Governatori, Michael J. Maher. An Argumentation-Theoretic Characterization of Defeasible Logic.  ECAI'2000. pp.469~473    Cited By 36[Bibtex] [PDF]
[58]Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller. Efficient defeasible reasoning systems.  ICTAI'2000. pp.384~392    Cited By 103[Bibtex] [PDF]
[57]Guido Governatori, Michael J. Maher, Grigoris Antoniou, David Billington. Argumentation Semantics for Defeasible Logics.  PRICAI'2000. pp.27~37    Cited By 119[Bibtex] [PDF]
[56]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. Representation results for defeasible logic. CoRR, 2000.     Cited By 189[Bibtex] [PDF]
[55]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher. A flexible framework for defeasible logics. CoRR, 2000.     Cited By 78[Bibtex] [PDF]
[54]Grigoris Antoniou, Michael J. Maher, David Billington. Defeasible Logic versus Logic Programming without Negation as Failure. J. Log. Program., 2000: 47~57    Cited By 66[Bibtex]
1999(7)
[53]Michael J. Maher, Guido Governatori. A Semantic Decomposition of Defeasible Logics.  AAAI/IAAI'1999. pp.299~305    Cited By 40[Bibtex]
[52]Grigoris Antoniou, David Billington, Michael J. Maher. On the Analysis of Regulations using Defeasible Rules.  HICSS'1999.     Cited By 55[Bibtex] [PDF]
[51]Joxan Jaffar, Michael J. Maher, Gustaf Neumann. An Architecture and Prototype Implementation of a System for Individualized Workflows in Medical Information Systems.  HICSS'1999.    [Bibtex] [PDF]
[50]Evan Tick, Roland H. C. Yap, Michael J. Maher. Finding Fair Allocations for the Coalition Problem with Constraints.  ICLP'1999. pp.530~544   [Bibtex] [PDF]
[49]David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher. Revising Nonmonotonic Theories: The Case of Defeasible Logic.  KI'1999. pp.101~112    Cited By 7[Bibtex]
[48]Grigoris Antoniou, Michael J. Maher, David Billington, Guido Governatori. A Comparison of Sceptical NAF-Free Logic Programming Approaches.  LPNMR'1999. pp.347~356    Cited By 6[Bibtex]
[47]Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. J. Autom. Reasoning, 1999: 83~104    Cited By 33[Bibtex] [PDF]
1998(3)
[46]Michael J. Maher, Grigoris Antoniou, David Billington. A Study of Provability in Defeasible Logic.  Australian Joint Conference on Artificial Intelligence'1998. pp.215~226    Cited By 20[Bibtex] [PDF]
[45]Grigoris Antoniou, David Billington, Michael J. Maher. Normal Forms for Defeasible Logic.  IJCSLP'1998. pp.160~174    Cited By 28[Bibtex] [PDF]
[44]Joxan Jaffar, Michael J. Maher, Kim Marriott, Peter J. Stuckey. The Semantics of Constraint Logic Programs. J. Log. Program., 1998: 1~46    Cited By 166[Bibtex] [PDF]
1997(2)
[43]Alexander Brodsky, Joxan Jaffar, Michael J. Maher. Toward Practical Query Evaluation for Constraint Databases. Constraints, 1997: 279~304    Cited By 81[Bibtex]
[42]Michael J. Maher. Constrained Dependencies. Theor. Comput. Sci., 1997: 113~149   [Bibtex]
1996(1)
[41]Michael J. Maher, Divesh Srivastava. Chasing Constrained Tuple-Generating Dependencies.  PODS'1996. pp.128~138    Cited By 34[Bibtex] [PDF]
1995(6)
[40]Michael J. Maher. Constrained Dependencies.  CP'1995. pp.170~185    Cited By 33[Bibtex]
[39]Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data.  PODS'1995. pp.54~65    Cited By 33[Bibtex] [PDF]
[38]Joxan Jaffar, Michael J. Maher, Gustaf Neumann. Logic Programming and Object Modelling: A Case Study (Abstract).  ILPS'1995. pp.48~48   [Bibtex]
[37]Michael J. Maher, Peter J. Stuckey. On Inductive Inference of Cyclic Structures. Ann. Math. Artif. Intell., 1995: 167~208    Cited By 14[Bibtex]
[36]Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher. Oracle Semantics for Prolog. Inf. Comput., 1995: 178~200   [Bibtex] [PDF]
[35]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher. Guest Editors' Introduction: Special Section: Ten Years of Logic Programming. J. Log. Program., 1995: 87~88   [Bibtex]
1994(3)
[34]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap. Beyond Finite Domains.  PPCP'1994. pp.86~94    Cited By 12[Bibtex] [PDF]
[33]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher. Guest Editor's Introduction. J. Log. Program., 1994: 1~3   [Bibtex]
[32]Joxan Jaffar, Michael J. Maher. Constraint Logic Programming: A Survey. J. Log. Program., 1994: 503~581    Cited By 2327[Bibtex]
1993(4)
[31]Michael J. Maher. A Logic Programming View of CLP.  ICLP'1993. pp.737~753    Cited By 81[Bibtex] [PDF]
[30]Alexander Brodsky, Joxan Jaffar, Michael J. Maher. Toward Practical Constraint Databases.  VLDB'1993. pp.567~580   [Bibtex]
[29]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap. Projecting CLP (R) Constraints. New Generation Comput., 1993: 449~469    Cited By 18[Bibtex]
[28]Michael J. Maher. A Tranformation System for Deductive Databases Modules with Perfect Model Semantics. Theor. Comput. Sci., 1993: 377~403   [Bibtex]
1992(4)
[27]Michael J. Maher. A CLP View of Logic Programming.  ALP'1992. pp.364~383    Cited By 16[Bibtex]
[26]Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher. Oracle Semantics for Prolog.  ALP'1992. pp.100~114   [Bibtex] [PDF]
[25]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap. Output in CLP.  FGCS'1992. pp.987~995   [Bibtex]
[24]Jean-Louis Lassez, Michael J. Maher. On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reasoning, 1992: 373~379    Cited By 79[Bibtex]
1991(3)
[23]Michael J. Maher. Representing Sets of Rational Trees Using Techniques of Non-Monotonic Reasoning.  LPNMR'1991. pp.181~195    Cited By 1[Bibtex] [PDF]
[22]Jean-Louis Lassez, Michael J. Maher, Kim Marriott. Elimination of Negation in Term Algebras.  MFCS'1991. pp.1~16    Cited By 23[Bibtex]
[21]Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro. Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs.  PODC'1991. pp.241~255    Cited By 14[Bibtex]
1989(5)
[20]Michael J. Maher. A Transformation System for Deductive Database Modules with Perfect Model Semantics.  FSTTCS'1989. pp.89~98    Cited By 80[Bibtex] [PDF]
[19]Alan Borning, Michael J. Maher, Amy Martindale, Molly Wilson. Constraint Hierarchies and Logic Programming.  ICLP'1989. pp.149~164    Cited By 168[Bibtex] [PDF]
[18]Michael J. Maher, Raghu Ramakrishnan. Deja Vu in Fixpoints of Logic Programs.  NACLP'1989. pp.963~980    Cited By 54[Bibtex]
[17]Michael J. Maher, Peter J. Stuckey. Expanding Query Power in Constraint Logic Programming Languages.  NACLP'1989. pp.20~36    Cited By 50[Bibtex]
[16]Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro. Reactive Behaviour Semantics for Concurrent Constraint Logic Programs.  NACLP'1989. pp.553~569    Cited By 25[Bibtex]
1988(3)
[15]Jean-Louis Lassez, Michael J. Maher, Kim Marriott. Unification Revisited.  Foundations of Deductive Databases and Logic Programming., 1988: 587~625    Cited By 499[Bibtex]
[14]Michael J. Maher. Equivalences of Logic Programs.  Foundations of Deductive Databases and Logic Programming., 1988: 627~658    Cited By 2[Bibtex]
[13]Michael J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees.  LICS'1988. pp.348~357    Cited By 319[Bibtex] [PDF]
1987(1)
[12]Michael J. Maher. Logic Semantics for a Class of Committed-Choice Programs.  ICLP'1987. pp.858~876    Cited By 268[Bibtex]
1986(5)
[11]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher. Logic Programming Language Scheme.  Logic Programming: Functions, Relations, and Equations, 1986: 441~467   [Bibtex]
[10]Jean-Louis Lassez, Michael J. Maher, Kim Marriott. Unification Revisited.  Foundations of Logic and Functional Programming'1986. pp.67~113    Cited By 499[Bibtex]
[9]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher. Invited Talk: Some Issues and Trends in the Semantics of Logic Programming.  ICLP'1986. pp.223~241   [Bibtex] [PDF]
[8]Michael J. Maher. Eqivalences of Logic Programs.  ICLP'1986. pp.410~424   [Bibtex] [PDF]
[7]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher. Comments on 'General Failure of Logic Programs. J. Log. Program., 1986: 115~118    Cited By 2[Bibtex]
1985(1)
[6]Jean-Louis Lassez, Michael J. Maher. Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci., 1985: 15~25    Cited By 40[Bibtex]
1984(4)
[5]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher. A Theory of Complete Logic Programs with Equality.  FGCS'1984. pp.175~184   [Bibtex]
[4]David A. Wolfram, Michael J. Maher, Jean-Louis Lassez. A Unified Treatment of Resolution Strategies for Logic Programs.  ICLP'1984. pp.263~276   [Bibtex] [PDF]
[3]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher. A Theory of Complete Logic Programs with Equality. J. Log. Program., 1984: 211~223   [Bibtex]
[2]Jean-Louis Lassez, Michael J. Maher. Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci., 1984: 167~184   [Bibtex]
1983(1)
[1]Jean-Louis Lassez, Michael J. Maher. The Denotational Semantics of Horn Clauses as a Production System.  AAAI'1983. pp.229~231    Cited By 14[Bibtex]