Flow-Based Propagators for the SEQUENCE and Related Global Constraints (2009)
Maher, Michael J., Narodytska, Nina, Quimper, Claude-Guy, Walsh, Toby
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE constraint in...
J. LOGIC PROGRAMMING: to appear 1 Constraint Logic Programming: A Survey (2008)
Joxan Jaffar, Michael J. Maher
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Though a relatively new eld, CLP has progressed in several quite di erent...
Finding Fair Allocations for the Coalition Problem with Constraints (2008)
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s value is perhaps the...
J. LOGIC PROGRAMMING: to appear 1 Constraint Logic Programming: A Survey (2007)
Joxan Jaffar, Michael J. Maher
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Though a relatively new field, CLP has progressed in several quite different...
f c World Scientific Publishing Company EFFICIENT DEFEASIBLE REASONING SYSTEMS (2007)
Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller
For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the...
D'ej`a Vu in Fixpoints of Logic Programs 1 (2007)
Michael J. Maher, Raghu Ramakrishnan
We investigate properties of logic programs that permit refinements in their fixpoint evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom-up computation is...
Adding Constraints to Logic-based Formalisms (2007)
Constraints are predefined relations with a special implementation mechanism. Logic formalisms provide specific reasoning facilities. We look at the effect of adding constraints to existing...
A Synthesis of Constraint Satisfaction and Constraint Solving (2007)
This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, andhas inspired some constraint programming...
Embedding Defeasible Logic in Logic Progamming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding Defeasible Logic in Logic Progamming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding defeasible logic into logic programming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding defeasible logic into logic programming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Yes
Examines roles and responsibilities of AP/DP's as described within the literature and the title: Teachers Performance Management (Ministry of Education, 1998). Also seeks to identify factors that...
Embedding defeasible logic into logic programming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding Defeasible Logic in Logic Progamming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding Defeasible Logic in Logic Progamming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding defeasible logic into logic programming (2006)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Embedding Defeasible Logic into Logic Programming (2005)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
On the Modeling and Analysis of Regulations (2005)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
On the Modeling and Analysis of Regulations (2005)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
On the Modeling and Analysis of Regulations (2005)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
On the Modeling and Analysis of Regulations (2005)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
Abduction of Linear Arithmetic Constraints (2005)
There are two errors in the published version of [1].
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its...
Abduction of Linear Arithmetic Constraints (2005)
Abstract. Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic constraints over...
"Graduate Program in Psychology."
Argumentation Semantics for Defeasible Logics (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logics (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Propositional Defeasible Logic has Linear Complexity (2004)
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be...
Argumentation Semantics for Defeasible Logic (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David, D M Gabbay
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logic (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logic (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logics (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logics (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logic (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
Argumentation Semantics for Defeasible Logic (2004)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the...
A Model-Theoretic Semantics for Defeasible Logic (2002)
Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for...
"Graduate Program in Psychology."
Propagation Completeness of Reactive Constraints (2002)
We develop a framework for addressing correctness and timeliness-of-propagation issues for reactive constraints - global constraints or user-defined constraints that are implemented through...
Representation results for Defeasible Logic (2001)
Governatori, Guido, Antoniou, Grigoris, Billington, David, Maher, Michael J.
The results of the paper allow for simpler inference algorithms for defeasible logic and describe important computational properties for it. The above combination has made possible efficient...
Representation Results for Defeasible Logic (2001)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Representation Results for Defeasible Logic (2001)
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
A Family of Defeasible Reasoning Logics and its Implementation (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J., Rock, Andrew
Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
An Argumentation-Theoretic Characterization of Defeasible Logic (2000)
Governatori, Guido, Maher, Michael J.
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for...
Argumentation Semantics for Defeasible Logics (2000)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of...
A Family of Defeasible Reasoning Logics and its Implementation (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J., Rock, Andrew
Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
An Argumentation-Theoretic Characterization of Defeasible Logic (2000)
Governatori, Guido, Maher, Michael J.
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for...
Argumentation Semantics for Defeasible Logics (2000)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of...
A Family of Defeasible Reasoning Logics and its Implementation (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J., Rock, Andrew
Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Flexible Framework For Defeasible Logics (2000)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
An Argumentation-Theoretic Characterization of Defeasible Logic (2000)
Governatori, Guido, Maher, Michael J.
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for...
Argumentation Semantics for Defeasible Logics (2000)
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of...
On the Modeling and Analysis of Regulations (1999)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
A Semantic Decomposition Of Defeasible Logic (1999)
Maher, Michael J., Governatori, Guido
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
Revising Nonmonotonic Belief Sets: The Case of Defeasible Logic (1999)
Billington, David, Antoniou, Grigoris, Governatori, Guido, Maher, Michael J.
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent...
Comparison of Sceptical NAF-Free Logic Programming Approaches (1999)
Antoniou, Grigoris, Maher, Michael J., Billington, David, Governatori, Guido
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is...
On the Modeling and Analysis of Regulations (1999)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
A Semantic Decomposition of Defeasible Logic (1999)
Maher, Michael J., Governatori, Guido
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
Revising Nonmonotonic Belief Sets: The Case of Defeasible Logic (1999)
Billington, David, Antoniou, Grigoris, Governatori, Guido, Maher, Michael J.
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent...
Comparison of Sceptical NAF-Free Logic Programming Approaches (1999)
Antoniou, Grigoris, Maher, Michael J., Billington, David, Governatori, Guido
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is...
On the Modeling and Analysis of Regulations (1999)
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
A Semantic Decomposition of Defeasible Logic (1999)
Maher, Michael J., Governatori, Guido
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
Comparison of Sceptical NAF-Free Logic Programming Approaches (1999)
Antoniou, Grigoris, Maher, Michael J., Billington, David, Governatori, Guido
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is...
Revising Nonmonotonic Belief Sets: The Case of Defeasible Logic (1999)
Billington, David, Antoniou, Grigoris, Governatori, Guido, Maher, Michael J.
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent...
Joxan Jaffar, Michael J. Maher, Gustaf Neumann
This paper is a report from a project that tried to design and implement a highly flexible workflow management system in the area of patient care delivery. Within eight weeks the authors developed a...
Joxan Jaffar, Michael J. Maher, Gustaf Neumann
This paper is a report from a project that tried to design and implement a highly flexible workflow management system in the area of patient care delivery. Within eight weeks the authors developed a...
Michael J. Maher, Gustaf Neumann
This paper is a report from a project that tried to design and implement a highly �exible work�ow management system in the area of patient care delivery. Within eight weeks the authors developed...
Toward practical query evaluation for constraint databases (1997)
Alexander Brodsky, Michael J. Maher
Linear constraint databases (LCDBs) extend relational databases to include linear arithmetic constraints in both relations and queries. A LCDB can also be viewed as a powerful extension of linear...
Constrained dependencies (1997)
We extend the notions of functional and finiteness dependencies to apply to subsets of a relation that are specified by constraints. These dependencies have many applications. We are able to...
Chasing Constrained Tuple-Generating Dependencies (1996)
Michael J. Maher, Divesh Srivastava
We investigate the implication problem for constrained tuple-generating dependencies (CTGDs), the extension of tuple- and equality-generating dependencies that permits expression of semantic...
Chasing Constrained Tuple-Generating Dependencies (1996)
Michael J. Maher, Divesh Srivastava
We investigate the implication problem for constrained tuple-generating dependencies (CTGDs), the extension of tuple- and equality-generating dependencies that permits expression of semantic...
Chasing Constrained Tuple-Generating Dependencies (1996)
Michael J. Maher, Divesh Srivastava
We investigate the implication problem for constrained tuple-generating dependencies (CTGDs), the extension of tuple- and equality-generating dependencies that permits expression of semantic...
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data (1995)
Alexander Brodsky, Catherine Lassez, Jean-louis Lassez, Michael J. Maher
The filtering method considered in this paper is based on approximation of a spatial object in d-dimensional space by the minimal convex polyhedron that encloses the object and whose facets are...
Constraint Logic Programming: A Survey (1994)
Joxan Jaffar, Michael J. Maher
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different...
Joxan Jaffar, Michael J. Maher, Peter J. Stuckey
Introduction A finite domain constraint system can be viewed as an linear integer constraint system in which each variable has an upper and lower bound. Finite domains have been used successfully in...
Joxan Jaffar, Michael J. Maher, Peter J. Stuckey
Introduction A finite domain constraint system can be viewed as an linear integer constraint system in which each variable has an upper and lower bound. Finite domains have been used successfully in...
A logic programming view of CLP (1993)
We address the problem of lifting definitions, results, and even proofs for the theory of logic programming, so that they apply to constraint logic programming (CLP). We attempt to systematize this...
Projecting CLP(R ) constraints (1993)
Joxan Jaffar, Michael J. Maher, Peter J. Stuckey
The presentation of constraints in a usable form is an essential aspect of Constraint Logic Programming (CLP) systems. It is needed both in the output of constraints, as well as in the production of...
A CLP View of Logic Programming (1992)
Abstract. We address the problem of determining those constraint domains A for which the traditional logic programming semantics and the constraint logic programming semantics CLP (A) coincide. This...
Oracle Semantics for Prolog (1992)
Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
This paper proposes to specify semantic definitions for logic programming languages such as Prolog in terms of an oracle which specifies the control strategy and identifies which clauses are to be...
On Fourier's Algorithm for Linear Arithmetic (1992)
Jean-louis Lassez, Michael J. Maher
In the 1820's Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set associated with the...
Representing Sets of Rational Trees Using Techniques of Non-Monotonic Reasoning (1991)
We address the problem of representing sets of rational trees, using methods from the field of Non-Monotonic Reasoning. The representation of sets of rational trees is relevant to type systems for...
Replay, recovery, replication and snapshot of nondeterministic concurrent programs (1990)
Haim Gaifman, Michael J. Maher
The problem of replaying computations of nondeterministic concurrent programs arises in contexts such as debugging and recovery. We investigate the problem for an abstract model of concurrency, which...
Reasoning about Stable Models (and Other Unstable Semantics) (1990)
The well-founded semantics and stable model semantics have proven popular semantics for logic programs. However, these semantics (and others) are not directly amenable to logical reasoning since...
On inductive inference of cyclic structures (1990)
Michael J. Maher, Peter J. Stuckey
We examine the problem of inductive inference in the domain of pointer-based data structures. We show how these data structures can be formalized as rational trees. Our main technical results concern...
Reasoning about Stable Models (and Other Unstable Semantics) , draft manuscript (1990)
The well-founded semantics and stable model semantics have proven popular semantics for logic programs. However, these semantics (and others) are not directly amenable to logical reasoning since...
Policy adrift : China and the Truman administration, 1949-1953 / (1989)
Thesis (M.S.)--University of Wisconsin--Stevens Point, 1989.
D'ej`a vu in fixpoints of logic programs (1989)
Michael J. Maher, Raghu Ramakrishnan
We investigate properties of logic programs that permit refinements in their fixpoint evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom-up computation is...
Targum Pseudo-Jonathan of Exodus 1-4 :--a commentary. (1988)
Thesis (Ph. D.)--University College Dublin, 1988.
Single Rules form Canonical Logic Programs (1988)
Michael Maher Ibm, Michael J. Maher
It has been conjectured [Blair] that every definite clause logic program containing exactly one rule is canonical. This note presents a simple proof of this conjecture.
Single Rules form Canonical Logic Programs (1988)
It has been conjectured [Blair] that every definite clause logic program containing exactly one rule is canonical. This note presents a simple proof of this conjecture. 1
Semantics of logic programs (1985)
Maher, Michael J. (Michael Joseph)
Typescript (photocopy) Bibliography: leaves [161-165]
Semantics of logic programs. (1985)
Thesis (Ph. D.)--University of Melbourne, 1985.
Representation Results for Defeasible Logic
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context...
Comparison of Sceptical NAF-Free Logic Programming Approaches
Antoniou, Grigoris, Maher, Michael J., Billington, David, Governatori, Guido, Gelfond, M., Leone, N., ...
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is...
Revising Nonmonotonic Belief Sets: The Case of Defeasible Logic
Billington, David, Antoniou, Grigoris, Governatori, Guido, Maher, Michael J., Burgard, Wolfram, Christaller, Thomas, ...
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent...
Argumentation Semantics for Defeasible Logics
Governatori, Guido, Maher, Michael J., Antoniou, Grigoris, Billington, David, Mizoguchi, Riichiro, Slaney, John
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of...
An Argumentation-Theoretic Characterization of Defeasible Logic
Governatori, Guido, Maher, Michael J., Horn, Werner
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for...
A Semantic Decomposition Of Defeasible Logic
Maher, Michael J., Governatori, Guido
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Flexible Framework For Defeasible Logics
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Flexible Framework For Defeasible Logics
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution...
A Family of Defeasible Reasoning Logics and its Implementation
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J., Rock, Andrew, Horn, Werner
Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other...
On the Modeling and Analysis of Regulations
Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J.
Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand...
Maher, Michael J., Zhang, Xiaoyan, Vliet, Dirck Van
This paper deals with two mathematically similar problems in transport network analysis: trip matrix estimation and traffic signal optimisation on congested road networks. These two problems are...
Watling, David P., Maher, Michael J.
This paper addresses the problem of matching partial registration plate data collected at a number of origins and destinations in a traffic system, the aim being to reconstruct the pattern of vehicle...