M
Michael J. Maher
Researcher at University of New South Wales
Publications - 157
Citations - 7302
Michael J. Maher is an academic researcher from University of New South Wales. The author has contributed to research in topics: Defeasible logic & Logic programming. The author has an hindex of 39, co-authored 154 publications receiving 7180 citations. Previous affiliations of Michael J. Maher include Australian Defence Force Academy & University of Texas at Austin.
Papers
More filters
Posted Content
Representation results for defeasible logic
TL;DR: The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.
Book ChapterDOI
Solving over-constrained temporal reasoning problems using local search
TL;DR: Inspired by the recent success in efficiently handling reasonably large satisfiable temporal reasoning problems using local search, two new local search algorithms using a random restart strategy and a TABU search are developed and the previous constraint weighting algorithm is extended to handle over-constrained problems.
Journal ArticleDOI
Annotated defeasible logic
TL;DR: The authors introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism, such as the ability to express different intuitions about different aspects of a problem.
Proceedings Article
An Efficient Technique for Network Traffic Summarization using Multiview Clustering and Statistical Sampling
TL;DR: This paper investigates the use of multiview clustering to create a meaningful summary using original data instances from network traffic data in an efficient manner and develops a mathematically sound approach to select the summary size using a sampling technique.
Book ChapterDOI
A Novel Approach for Network Traffic Summarization
TL;DR: This paper proposes a new definition of summary for network traffic which outperforms the existing state-of-the-art summarization techniques and is based on clustering algorithm which reduces the information loss incurred by the existing techniques.