Computing argumentation in polynomial number of BDD operations: a preliminary report

Authors:
Yuqing Tang;Timothy J. Norman;Simon Parsons
Affiliations:
Dept. of Computer Science, Graduate Center, City University of New York, New York, NY;Dept of Computing Science, The University of Aberdeen, Aberdeen, UK;Dept. of Computer Science, Graduate Center, City University of New York, New York, NY
Venue:
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Year:
2010

Citing 31
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Symmetry detection and dynamic variable ordering of decision diagrams

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The implicit set paradigm: a new approach to finite state system verification

Formal Methods in System Design - Special issue on symbolic model checking
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Improving the Variable Ordering of OBDDs Is NP-Complete

IEEE Transactions on Computers
The Zeno argumentation framework

Proceedings of the 6th international conference on Artificial intelligence and law
Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits

DAC '97 Proceedings of the 34th annual Design Automation Conference
Fast exact minimization of BDDs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Sampling schemes for computing OBDD variable orderings

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
To split or to conjoin: the question in image computation

Proceedings of the 37th Annual Design Automation Conference
Computer supported argumentation and collaborative decision making: the HERMES system

Information Systems
Algorithms and Data Structures in VLSI Design

Algorithms and Data Structures in VLSI Design
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Non-linear quantification scheduling in image computation

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
On the computational complexity of assumption-based argumentation for default reasoning

Artificial Intelligence
Inferring from Inconsistency in Preference-Based Argumentation Frameworks

Journal of Automated Reasoning
Early Quantification and Partitioned Transition Relations

ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
Verification of Synchronous Sequential Machines Based on Symbolic Execution

Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
SetA*: an efficient BDD-based heuristic search algorithm

Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Two party immediate response disputes: properties and efficiency

Artificial Intelligence
Argumentation-based negotiation

The Knowledge Engineering Review
Argumentation-based dialogues for deliberation

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Exact computation of minimum feedback vertex sets with relational algebra

Fundamenta Informaticae
Coherence and Flexibility in Dialogue Games for Argumentation

Journal of Logic and Computation
State-set branching: Leveraging BDDs for heuristic search

Artificial Intelligence
A dialogue mechanism for public argumentation using conversation policies

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
A model for integrating dialogue and the execution of joint plans

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Software model checking

ACM Computing Surveys (CSUR)
Learning to order BDD variables in verification

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many advances in argumentation theory have been made, but the exponential complexity of argumentation-based reasoning has made it impractical to apply argumentation theory. In this paper, we propose a binary decision diagram (BDD) approach to argumentation-based reasoning. In the approach, sets of arguments and defeats are encoded into BDDs so that an argumentation process can work on a set of arguments and defeats simultaneously in one BDD operation. As a result, the argumentation can be computed in polynomial number of BDD operations on the number of input sentences.