In this paper we discuss how a computational version of argumentation involving practical reasoning can be applied to the domain of e-democracy. We discuss our previous work which proposed an argument scheme and associated critical questions to make use of presumptive reasoning in order to justify a proposal for action. We explain how this proposal can be made computational for use by BDI agent...

Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reaching the important conclusion that it is at least as powerful as inductive reasoning (specifically, they showed that each inductive proof can be translated into a cyclic proof). We add to their investigation by proving the converse of this result, namely that each inductive proof can be translated into an ...

The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attention is also paid to ways of handling background knowledge, introducing mere conjectures, and the research guiding capabilities of the logics.

Everyday inductive reasoning draws on many kinds of knowledge, including knowledge about relationships between properties and knowledge about relationships between objects. Previous accounts of inductive reasoning generally focus on just one kind of knowledge: models of causal reasoning often focus on relationships between properties, and models of similarity-based reasoning often focus on simi...

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification ...

Inductive reasoning is critical for ensuring reliability of computational descriptions, especially of algorithms defined on recursive data structures. Despite advances made in automating inductive reasoning, proof attempts by theorem provers frequently fail while performing inductive reasoning. A user of such a system must scrutinize a failed proof attempt and do intensive debugging to understa...

An \evaluation" approach devised for an inductive reasoning system called Logic-based Discrete-event Inductive Reasoner is the focus of this paper. The underlying inductive reasoning methodology utilizes abstractions as its primary means to deal with lack of knowledge. Based on abstractions and their treatments as assumptions, the Logic-based Discrete-event Inductive Reasoning system allows non...