- [9] D. Nute. Defeasible Reasoning. In Proc. 20th Hawaii International Conference on Systems Science, IEEE Press 1987, 470--477.
- Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data
- Applying Local Search to Temporal Reasoning J. Thornton, M. Beaumont and A. Sattar
- [1] Falaschi, M., Gabbrielli, M., Levi, G., and Murakami, M., Nested guarded Horn clauses: a language provided with a complete set of un
- [29] K.G. Marriott & P.J. Stuckey, The 3 R's of optimizing constraint logic pro grams: Refinement, removal and reordering, Proc. 20th ACM Symp. Principles
- [34] J. Reynolds, Transformational Systems and the Algebraic Structure of Atomic Formulas, Machine Intelligence 5, B. Meltzer and D. Michie (Eds.), 1970, 135--152.
- Herbrand Constraint Abduction Michael Maher
- 3. G. Antoniou, D. Billington, G. Governatori and M.J. Maher. A flexible framework for defeasible logics. In Proc. 17th American National Conference on Artificial
- Optimizing Queries in Extended Relational Michael Maher and Junhu Wang
- 16] H. Schmidt, W. Kiessling, U. Guntzer and R. Bayer, \Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iterations", Proceedings of
- SOGgy Constraints: Soft Open Global Constraints
- [Saraswat 90] V. A. Saraswat. Concurrent constraint programming. In Proceedings of the Seven teenth Annual ACM Symposium on Principles of Programming Languages, pages 232--245,
- Open Constraints in a Boundable World Michael J. Maher
- 30. A. Van Gelder, K. Ross and J.S. Schlipf, Unfounded Sets and Wellfounded Se mantics for General Logic Programs, Journal of the ACM 38, 620--650, 1991.
- (eds.), ``Coordination Technology for Collab orative Applications'', Springer Verlag, Hei
- 2. Bledsoe, W.W.: A new method for proving certain Presburger formulas. Proc. of the 4 th Joint Conf. on Artificial Intelligence. (1975) 15--21.
- Single Rules form Canonical Logic Programs Michael J. Maher
- A Flexible Framework for Defeasible Logics G. Antoniou and D. Billington and G. Governatori and M.J. Maher
- Pecherer, R.M. (1975). Efficient Evaluation of Expressions in a Relational Algebra. Proc. ACM Pacific Conf., 44--49, 1975.
- A Semantic Decomposition of Defeasible Logics M.J. Maher and G. Governatori
- 13. R. Debruyne, C. Bessiere, From Restricted Path Consistency to MaxRestricted Path Con sistency, Proc. Principles and Practice of Constraint Programming, 312--326, 1997.
- [8] B. Nebel and H. Burckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1):43--
- Finding Fair Allocations for the Coalition Problem with Constraints
- [12] H.P. Williams, Fourier's Method of Linear Programming and its Dual, American Mathematical Monthly, November 1986, 681--695.
- Chasing Constrained TupleGenerating Dependencies Michael J. Maher \Lambda
- 253. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, 1993. 254. A. V'eron, K. Schuerman, M. Reeve & L.L. Li, Why and How in the ElipSys
- Reasoning with Disjunctive Constrained Tuple-Generating Dependencies ?
- On Computing Constraint Abduction Answers Michael Maher and Ge Huang
- Dej`a Vu in Fixpoints of Logic Programs Michael J. Maher
- Argumentation Semantics for Defeasible Logics G. Governatori1, M.J. Maher2, G. Antoniou2, and D. Billington2
- An Argumentation-Theoretic Characterization of Defeasible Logic
- [29] M.J. Maher, Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees, Proc. 3rd. Symp. Logic in Computer Science, Edinburgh, 348--357, 1988. Full version
- Local Consistency for Extended CSPs Michael J. Maher
- 21. D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declara tive Language for Negotiating Executable Contracts, Proc. AAAI99 Workshop on
- [16] H. Schmidt, W. Kiessling, U. Guntzer and R. Bayer, ``Compiling Exploratory and GoalDirected Deduction into Sloppy DeltaIterations'', Proceedings of
- Rewriting Union Queries Using Views J. Wang (j.wang@griffith.edu.au)
- Open Contractible Global Constraints Michael J. Maher
- Correctness of a Logic Program Transformation IBM Thomas J. Watson Research Center,
- Rewriting General Conjunctive Queries Using Views # Junhu Wang 1,2 Michael Maher 1,3 Rodney Topor 1
- Submitted to the Technical Communications of the International Conference on Logic Programming (ICLP'10) http://www.floc-conference.org/ICLP-home.html
- A CLP View of Logic Programming Michael J. Maher
- and Symposium on Logic Programming . MIT Press 1998, 160--174.
- Representing Sets of Rational Trees Using Techniques of
- [14] Kleinman, A., Moses, Y., and Shapiro, E., A Distributed Variable Server for Atomic Unification, to appear in the Proc. of the 9 th ACM SIGACTSIGOPS Symposium on Principles of Distributed
- Efficient Defeasible Reasoning Systems [22] G. Governatori and M. Maher, An ArgumentationTheoretic Characterization of De
- [31] J. Stillman. The Complexity of Propositional Default Logics. Proc. American National Conference on Artificial Intelligence (AAAI92),
- Analysis of a Global Contiguity Constraint Michael J. Maher
- Human and Unhuman Commonsense Reasoning
- Noname manuscript No. (will be inserted by the editor)
- Flow-Based Propagators for the SEQUENCE and Related Global Constraints
- Heyting Domains for Constraint Abduction Michael Maher
- Abduction of Linear Arithmetic Constraints Michael J. Maher
- Abduction of Linear Arithmetic Constraints Michael J. Maher
- Solving Over-constrained Temporal Reasoning Problems using Local Search
- Adding Constraints to Logic-based Formalisms
- J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 THE SEMANTICS OF CONSTRAINT LOGIC
- An Inclusion Theorem for Defeasible Logics David Billington
- Under consideration for publication in Theory and Practice of Logic Programming 1 Embedding Defeasible Logic into Logic
- Representation Results for Defeasible Logic GRIGORIS ANTONIOU
- A Family of Defeasible Reasoning Logics and its Implementation
- Revising Nonmonotonic Theories: The Case of Defeasible Logic
- Some Issues and Trends in the Semantics of Logic Programming
- On Parameterized Substitutions Michael J. Maher
- code(t 1 ffl t 2 ) = code(t 1 ) ffl code(t 2 ) code(g(t 1 ; : : : ; t n )) = b
- [37] M. Vardi, Fundamentals of Dependency Theory, IBM Research Report RJ4858, 1985. [38] X.S. Wang, C. Bettini, A. Brodsky & S. Jajodia, Logical Design for Temporal Databases with
- Abduction of Linear Arithmetic Constraints Michael J. Maher
- Rewriting Unions of General Conjunctive Queries Using Views
- User-and Application-Centric Multihomed Flow Olivier Mehani, Roksana Boreli, Michael Maher and Thierry Ernst
- Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation