Michael J. Maher

From MaRDI portal
Person:688574

Available identifiers

zbMath Open maher.michael-jMaRDI QIDQ688574

List of research outcomes





PublicationDate of PublicationType
On Signings and the Well-Founded Semantics2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q50391452022-10-12Paper
Rethinking Defeasible Reasoning: A Scalable Approach2021-09-03Paper
https://portal.mardi4nfdi.de/entity/Q46311882019-04-24Paper
Relating Concrete Defeasible Reasoning Formalisms and Abstract Argumentation2018-01-05Paper
Contractibility for open global constraints2017-11-09Paper
Annotated defeasible logic2017-11-08Paper
https://portal.mardi4nfdi.de/entity/Q52830262017-07-18Paper
An inclusion theorem for defeasible logics2015-09-17Paper
Replay, recovery, replication, and snapshots of nondeterministic concurrent programs2015-06-19Paper
Relative expressiveness of defeasible logics II2014-02-27Paper
Relative expressiveness of defeasible logics2013-03-13Paper
Contractibility and contractible approximations of soft global constraints2012-05-11Paper
Human and Unhuman Commonsense Reasoning2010-10-12Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
Local consistency for extended CSPs2009-11-04Paper
Representation results for defeasible logic2009-10-21Paper
Open Constraints in a Boundable World2009-06-03Paper
On Computing Constraint Abduction Answers2009-01-27Paper
Embedding defeasible logic into logic programming2007-02-13Paper
Oracle semantics for Prolog2006-10-10Paper
Logic Programming2006-06-27Paper
Logic Programming2006-06-27Paper
Rewriting union queries using views2006-02-23Paper
Argumentation Semantics for Defeasible Logic2005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q48091622004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48129742004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30443682004-08-11Paper
Propositional defeasible logic has linear complexity2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q45355472002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q27670552002-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47025732002-02-21Paper
Defeasible logic versus Logic Programming without Negation as Failure2001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q44943252001-03-22Paper
https://portal.mardi4nfdi.de/entity/Q49448732000-12-05Paper
https://portal.mardi4nfdi.de/entity/Q49553462000-10-25Paper
https://portal.mardi4nfdi.de/entity/Q42472092000-01-12Paper
The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.11999-05-31Paper
Constrained dependencies1998-07-23Paper
https://portal.mardi4nfdi.de/entity/Q43914521998-06-03Paper
Toward practical query evaluation for constraint databases1998-02-11Paper
On inductive inference of cyclic structures1996-10-20Paper
On Fourier's algorithm for linear arithmetic constraints1994-02-17Paper
https://portal.mardi4nfdi.de/entity/Q40352221993-05-18Paper
A transformation system for deductive database modules with perfect model semantics1993-05-16Paper
Projecting CLP(\({\mathcal R}\)) constraints1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552251989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37890641988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37255211986-01-01Paper
Comments on “general failure of logic programs”1986-01-01Paper
Optimal fixedpoints of logic programs1985-01-01Paper
A theory of complete logic programs with equality1984-01-01Paper
Closures and fairness in the semantics of programming logic1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33180961983-01-01Paper
The Transient Behaviour of a Cyclic Queue1973-01-01Paper
A generalised incomplete beta function and its application to multi-line stock control1973-01-01Paper

Research outcomes over time

This page was built for person: Michael J. Maher