| Publication | Date of Publication | Type |
|---|
| Minimal strong admissibility: a complexity analysis | 2021-01-21 | Paper |
| Computation counts. An introduction to analytic concepts in computer science | 2019-08-02 | Paper |
On checking skeptical and ideal admissibility in abstract argumentation frameworks
Information Processing Letters | 2019-06-04 | Paper |
| Investigating the relationship between argumentation semantics via signatures | 2017-09-14 | Paper |
Looking-ahead in backtracking algorithms for abstract argumentation
International Journal of Approximate Reasoning | 2016-10-17 | Paper |
An improved upper bound on the non-3-colourability threshold
Information Processing Letters | 2016-06-09 | Paper |
Characteristics of multiple viewpoints in abstract argumentation
Artificial Intelligence | 2015-12-09 | Paper |
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence | 2015-08-27 | Paper |
Parametric properties of ideal semantics
Artificial Intelligence | 2015-06-26 | Paper |
Automata for infinite argumentation structures
Artificial Intelligence | 2015-06-26 | Paper |
Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
Journal of Artificial Intelligence Research | 2014-05-16 | Paper |
Computing preferred extensions in abstract argumentation: a SAT-based approach
Theory and Applications of Formal Argumentation | 2014-03-31 | Paper |
On the instantiation of knowledge bases in abstract argumentation frameworks
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Semi-stable semantics
Journal Of Logic And Computation | 2012-10-19 | Paper |
Irrationality in persuasive argumentation
Logic Programs, Norms and Action | 2012-07-23 | Paper |
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence | 2011-06-17 | Paper |
Weighted argument systems: basic definitions, algorithms, and complexity results
Artificial Intelligence | 2011-06-17 | Paper |
| Computation in extended argumentation frameworks | 2011-05-11 | Paper |
Solving coalitional resource games
Artificial Intelligence | 2010-03-16 | Paper |
The computational complexity of ideal semantics
Artificial Intelligence | 2009-12-21 | Paper |
A logical characterisation of qualitative coalitional games
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
Argumentation in artificial intelligence
Artificial Intelligence | 2009-07-09 | Paper |
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence | 2009-07-09 | Paper |
Audiences in argumentation frameworks
Artificial Intelligence | 2009-07-09 | Paper |
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
Logics in Artificial Intelligence | 2008-10-27 | Paper |
The complexity of deciding reachability properties of distributed negotiation schemes
Theoretical Computer Science | 2008-05-28 | Paper |
The complexity of contract negotiation
Artificial Intelligence | 2007-10-23 | Paper |
On the computational complexity of coalitional resource games
Artificial Intelligence | 2007-10-23 | Paper |
Logics in Artificial Intelligence
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Logics in Artificial Intelligence
Lecture Notes in Computer Science | 2006-10-25 | Paper |
The complexity of agent design problems: Determinism and history dependence
Annals of Mathematics and Artificial Intelligence | 2006-09-12 | Paper |
AI*IA 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-06-27 | Paper |
| scientific article; zbMATH DE number 5017566 (Why is no real title available?) | 2006-04-06 | Paper |
On the computational complexity of qualitative coalitional games
Artificial Intelligence | 2006-02-07 | Paper |
Two party immediate response disputes: Properties and efficiency
Artificial Intelligence | 2006-02-07 | Paper |
scientific article; zbMATH DE number 2243379 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
| scientific article; zbMATH DE number 2088153 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080340 (Why is no real title available?) | 2004-08-04 | Paper |
On the complexity of Boolean functions computed by lazy oracles
IEEE Transactions on Computers | 2003-10-15 | Paper |
The maximum length of prime implicates for instances of 3-SAT
Artificial Intelligence | 2003-08-28 | Paper |
Coherence in finite argument systems.
Artificial Intelligence | 2003-01-21 | Paper |
Leafy spanning trees in hypercubes
Applied Mathematics Letters | 2002-01-02 | Paper |
A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses
The Journal of Logic and Algebraic Programming | 2001-10-10 | Paper |
| scientific article; zbMATH DE number 1543307 (Why is no real title available?) | 2001-02-27 | Paper |
Complexity-theoretic models of phase transitions in search problems
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1418485 (Why is no real title available?) | 2000-03-19 | Paper |
Multiprocessor simulation strategies with optimal speed-up
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 225477 (Why is no real title available?) | 1993-07-01 | Paper |
An Algorithm to Generate Random Large Combinational Circuits
The Computer Journal | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176866 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 42045 (Why is no real title available?) | 1992-09-17 | Paper |
Comment on Kochol's paper ``Efficient monotone circuits for threshold functions
Information Processing Letters | 1990-01-01 | Paper |
On monotone simulations on nonmonotone networks
Theoretical Computer Science | 1989-01-01 | Paper |
A result on k-valent graphs and its application to a graph embedding problem
Acta Informatica | 1987-01-01 | Paper |
The complexity of central slice functions
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3919835 (Why is no real title available?) | 1985-01-01 | Paper |
A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
Acta Informatica | 1985-01-01 | Paper |
