In this paper we extend an argumentation scheme for practical reasoning with values based on Action-based Alternating Transition Systems. While the original scheme considers only arguments arising from the immediately next state, our proposals will enable long term considerations to be taken into account. We consider the various reasons for and against performing an action that arise from these...

Justifications for actions can typically be critiqued on a number of grounds. Critiques of such justifications can be structured using an argumentation scheme for practical reasoning and associated critical questions. The form that the critiques can take in a computational system, however, depends crucially on the semantic underpinnings of the scheme. We describe a semantic model which, we argu...

Ontology, an explicit specification of shared conceptualization, has been increasingly used to define formal data semantics and improve data reusability and interoperability in enterprise information systems. In this paper, we present and demonstrate SOR (Scalable Ontology Repository), a practical system for ontology storage, reasoning, and search. SOR uses Relational DBMS to store ontologies, ...

This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current state of the art in the research area, show that there are many similiarities and connections between the various implementations and also highlight the differences regarding evaluation goals and strategies. An important g...

Hypothetical reasoning is an important framework for knowledge-based systems because it is theoretically founded and useful for many practical problems. Since the inference time of hypothetical reasoning grows exponentially with respect to problem size, its ineÆciency becomes the most crucial problem when applied to

In this paper we will present criteria for critical evaluation of plausible reasoning systems. We have taken the rational reasoning as our point of comparision: an ideal reasoning system should be able to represent all human knowledge and perform all reasoning tasks, which can be rationally performed. The four main criteria are exible ways of representing uncertainty, the ability for both deduc...

We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion (or homomorphism) properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We present practical applications in verification and cryptography.

Rewriting is widely used to optimise owl:sameAs reasoning in materialisation based OWL 2 RL systems. We investigate issues related to both the correctness and efficiency of rewriting, and present an algorithm that guarantees correctness, improves efficiency, and can be effectively parallelised. Our evaluation shows that our approach can reduce reasoning times on practical data sets by orders of...

Argumentation systems are intimately related to nonmonotonic reasoning, of which defeasible reasoning is one widely-known approach. For example, the literature points out defeasible logic (a particular formalisation of defeasible reasoning) as a practical platform upon which to develop an argumentation system. In this paper, we develop an approach to endow AgentSpeak agents with argumentative c...

Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically supported by adding additional non-constructive axioms. However, there is another perspective that views constructive logic as an extension of classical log...