Sciweavers

2303 search results - page 33 / 461
» On the logic of argumentation theory
Sort
View
AIML
2008
15 years 3 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
AMAI
2006
Springer
15 years 2 months ago
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
Miroslaw Truszczynski
ATAL
2003
Springer
15 years 7 months ago
A Dialectic Architecture for Computational Autonomy
This paper takes the view that to be considered autonomous, a software agent must possess the means by which to manage its own motivations and so define new goals. Using the motiva...
Mark Witkowski, Kostas Stathis
143
Voted
ENTCS
2002
157views more  ENTCS 2002»
15 years 1 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
IBERAMIA
2010
Springer
14 years 12 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...