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