A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Artificial Intelligence
Intersection and union of regular languages and state complexity
Information Processing Letters
Artificial Intelligence
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
Abstract argumentation systems
Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Extending abstract argumentation systems theory
Artificial Intelligence
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Representing Epistemic Uncertainty by Means of Dialectical Argumentation
Annals of Mathematics and Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
Coherence in finite argument systems
Artificial Intelligence
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Credulous and Sceptical Argument Games for Preferred Semantics
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Reasoning with infinite stable models
Artificial Intelligence
Prevarication in dispute protocols
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Guest Editorial: Argumentation in Multi-Agent Systems
Autonomous Agents and Multi-Agent Systems
Argumentation Semantics for Defeasible Logic
Journal of Logic and Computation
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Coherence and Flexibility in Dialogue Games for Argumentation
Journal of Logic and Computation
Argumentation in artificial intelligence
Artificial Intelligence
Elements of Argumentation
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
One More Decidable Class of Finitely Ground Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
An ASP System with Functions, Lists, and Sets
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Introduction to Mathematical Logic
Introduction to Mathematical Logic
The computational complexity of ideal semantics
Artificial Intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
A bibliographical study of grammatical inference
Pattern Recognition
On finitely recursive programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Dialectical Proofs for Constrained Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
AFRA: Argumentation framework with recursive attacks
International Journal of Approximate Reasoning
Defeasible Contextual Reasoning with Arguments in Ambient Intelligence
IEEE Transactions on Knowledge and Data Engineering
Weighted argument systems: Basic definitions, algorithms, and complexity results
Artificial Intelligence
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
Review: an introduction to argumentation semantics
The Knowledge Engineering Review
Computing with infinite argumentation frameworks: the case of AFRAs
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Relating the semantics of abstract dialectical frameworks and standard AFs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Parametric properties of ideal semantics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hi-index | 0.00 |
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this limitation, in this paper we propose a novel approach for describing infinite afs using tools from formal language theory. In particular, the possibly infinite set of arguments is specified through the language recognized by a deterministic finite automaton while a suitable formalism, called attack expression, is introduced to describe the relation of attack between arguments. The proposed approach is shown to satisfy some desirable properties which cannot be achieved through other ''naive'' uses of formal languages. In particular, the approach is shown to be expressive enough to capture (besides any arbitrary finite structure) a large variety of infinite afs including two major examples from previous literature and two sample cases from the domains of multi-agent negotiation and ambient intelligence. On the computational side, we show that several decision and construction problems which are known to be polynomial time solvable in finite afs are decidable in the context of the proposed formalism and we provide the relevant algorithms. Moreover we obtain additional results concerning the case of finitaryafs.