In this paper we discuss the design of an Inductive Logic Programming system in Answer Set Programming and more in general the problem of integrating the two. We show how to formalise the learning problem as an ASP program and provide details on how the optimisation features of modern solvers can be adapted to derive preferred hypotheses.

This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptable or not. If the proposal is unacceptable as it is, the agent seeks conditions to accept it. This attitude is captured as a process of making hypotheses by induction. If an agent fails to find a hypothesis, it would c...

The intent of this paper is to study generalized inductive definitions on the basis of Constructive Zermelo-Fraenkel Set Theory, CZF. In theories such as classical ZermeloFraenkel Set Theory, it can be shown that every inductive definition over a set gives rise to a least and a greatest fixed point, which are sets. This principle, notated GID, can also be deduced from CZF plus the full impredic...

Article history: Received 17 April 2015 Received in revised form 18 June 2015 Accepted 6 July 2015 Available online 22 July 2015

Knowledge Discovery in Databases (KDD) has evolved into an important and active area of research because of theoretical challenges and practical applications associated with the problem of discovering (or extracting) interesting and previously unknown knowledge from very large real-world databases. Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be consi...

The Rough Set (RS) theory can be considered as a tool to reduce the input dimensionality and to deal with vagueness and uncertainty in datasets. Over the years, there has been a rapid growth in interest in rough set theory and its applications in artificial intelligence and cognitive sciences, especially in research areas such as machine learning, intelligent systems, inductive reasoning, patte...

We consider collective choice with agents possessing strictly monotone, strictly convex and continuous preferences over a compact and convex constraint set contained in Rþ. If it is non-empty the core will lie on the efficient boundary of the constraint set and any policy not in the core is beaten by some policy on the efficient boundary. It is possible to translate the collective choice proble...

For a mapping, fuzzy sets obtained by Zadeh's extension principle are images of other fuzzy sets on the domain of the mapping under the mapping. Some relationships between images of level sets of one or two fuzzy sets under a mapping and another fuzzy set obtained from the one or two fuzzy sets by Zadeh's extension principle are known. In the present paper, the known results are extended to mor...

In this article, a probabilistic fusion concept for road extraction from multi-aspect SAR images, which incorporates sensor geometry and context information, is proposed. Before fusion, the uncertainty of each extracted line segment is assessed by means of Bayesian probability theory. This assessment is performed on attribute-level and is based on predefined probability density functions learne...