Results 1 - 10 of 32

Argumentation frameworks as constraint satisfaction problems

by Leila Amgoud, Caroline Devred - In Proc. SUM, volume 6929 of LNCS , 2011
"... Abstract. This paper studies how to encode the problem of computing the extensions of an argumentation framework (under a given semantics) as a constraint satisfaction problem (CSP). Such encoding is of great importance since it makes it possible to use the very efficient solvers (developed by the C ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
Abstract. This paper studies how to encode the problem of computing the extensions of an argumentation framework (under a given semantics) as a constraint satisfaction problem (CSP). Such encoding is of great importance since it makes it possible to use the very efficient solvers (developed

Complexity-Sensitive Decision Procedures for Abstract Argumentation

by Wolfgang Dvorak, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran , 2012
"... Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems in the areas of Knowledge Representation and Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an important research challenge. So far, implemented systems for evaluating AFs have ..."
Abstract - Cited by 12 (6 self) - Add to MetaCart
Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems in the areas of Knowledge Representation and Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an important research challenge. So far, implemented systems for evaluating AFs have

Reasoning in argumentation frameworks using quantified boolean formulas

by Uwe Egly, Stefan Woltran, Technische Universität Wien - Proc. COMMA, volume 144 of FAIA, 133–144. IOS , 2006
"... Abstract. This paper describes a generic approach to implement propositional argumentation frameworks by means of quantified Boolean formulas (QBFs). The motivation to this work is based on the following observations: Firstly, depending on the underlying deductive system and the chosen semantics (i. ..."
Abstract - Cited by 7 (4 self) - Add to MetaCart
Abstract. This paper describes a generic approach to implement propositional argumentation frameworks by means of quantified Boolean formulas (QBFs). The motivation to this work is based on the following observations: Firstly, depending on the underlying deductive system and the chosen semantics (i

ConArg: Argumentation with Constraints

by Stefano Bistarelli, Francesco Santini
"... ConArg [3,4] 4 is a tool based on Constraint Programming that is able to model and solve different problems related to (Abstract) Argumentation Frameworks (AFs) [6]. For the implementation we adopted JaCoP, which is a Java library that provides the user with a Finite Domain Constraint Programming pa ..."
Abstract - Add to MetaCart
ConArg [3,4] 4 is a tool based on Constraint Programming that is able to model and solve different problems related to (Abstract) Argumentation Frameworks (AFs) [6]. For the implementation we adopted JaCoP, which is a Java library that provides the user with a Finite Domain Constraint Programming

SAT Solvers for Queries over Tree Automata with Constraints

by Pierre-Cyrille Héam , Vincent Hugot , Olga Kouchnarenko - In Third International Conference on Software Testing, Verification, and Validation Workshops , 2010
"... Abstract-Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification and valid ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract-Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification

Introducing the Second International Competition on Computational Models of Argumentation

by Sarah Alice Gaggl , Thomas Linsbichler , Marco Maratea , Stefan Woltran
"... Abstract. Argumentation is a major topic in the study of artificial intelligence. In particular, the problem of solving certain reasoning tasks of Dung's abstract argumentation frameworks is central to many advanced argumentation systems. The fact that problems to be solved are mostly intracta ..."
Abstract - Add to MetaCart
Abstract. Argumentation is a major topic in the study of artificial intelligence. In particular, the problem of solving certain reasoning tasks of Dung's abstract argumentation frameworks is central to many advanced argumentation systems. The fact that problems to be solved are mostly

Efficiently Generating Structurally Complex Inputs with Thousands of Objects

by Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
"... Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired structural integrity constraints, Shekoosh systematically explores the input space of the predicate and generates inputs ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired structural integrity constraints, Shekoosh systematically explores the input space of the predicate and generates inputs

INSTITUT DE ROB `OTICA I INFORM `ATICA INDUSTRIAL- PREPRINT 1 A Branch-and-Prune Solver for Distance Constraints

by Josep M. Porta, Federico Thomas, Carme Torras
"... Abstract — Given some geometric elements such as points and lines in , subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in Robotics (such as the position ..."
Abstract - Add to MetaCart
Abstract — Given some geometric elements such as points and lines in , subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in Robotics (such

POOC- a Platform for Object-Oriented Constraint Programming

by unknown authors
"... Abstract. In this paper, we describe an implementation-independent object-oriented interface for commercial and academic Constraint Solvers. This serves as a basis for evaluating different Constraint Solvers and for developing solver-independent applications. We show, how applications can use the in ..."
Abstract - Add to MetaCart
the interface, which solvers are already integrated into the framework and how additional solvers can be added. Furtermore, we provide to the community the described system as real Java packages via Internet, that even includes a basic but powerful Constraint Solver. 1 Motivation Constraint Programming (CP, [9

1 MOSES: a Framework for QoS Driven Runtime Adaptation of Service-oriented Systems

by Valeria Cardellini, Emiliano Casalicchio, Vincenzo Grassi, Stefano Iannucci, Francesco Lo Presti, Raffaela Mir
"... Abstract—Architecting software systems according to the serviceoriented paradigm, and designing runtime self-adaptable systems are two relevant research areas in today’s software engineering. In this paper we address issues that lie at the intersection of these two important fields. First, we presen ..."
Abstract - Add to MetaCart
Abstract—Architecting software systems according to the serviceoriented paradigm, and designing runtime self-adaptable systems are two relevant research areas in today’s software engineering. In this paper we address issues that lie at the intersection of these two important fields. First, we
Results 1 - 10 of 32