110 citations · 160 across the 10 of their papers we have counts for
8 papers · 1 filter
Defeasible Reasoning via Datalog
Michael J. Maher
We address the problem of compiling defeasible theories to Datalog programs. We prove the correctness of this compilation, for the defeasible logic , but…
On Signings and the Well-Founded Semantics
Michael J. Maher
In this note, we use Kunen's notion of a signing to establish two theorems about the well-founded semantics of logic programs, in the case where we are interested in only (say) the…
A lemma on closures and its application to modularity in logic programming semantics
Michael J. Maher
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpo…
Rethinking Defeasible Reasoning: A Scalable Approach
Michael J. Maher, Ilias Tachmazidis, Grigoris Antoniou +2
Recent technological advances have led to unprecedented amounts of generated data that originate from the Web, sensor networks and social media. Analytics in terms of defeasible re…
Annotated Defeasible Logic
Guido Governatori, Michael J. Maher
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuition…
Contractibility for Open Global Constraints
Michael J. Maher
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro…