Sciweavers

1187 search results - page 22 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
SEMWEB
2009
Springer
14 years 3 months ago
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
Ken Kaneiwa, Philip H. P. Nguyen
AINA
2007
IEEE
14 years 13 days ago
Using Argumentative Agents to Manage Communities of Web Services
This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general ...
Jamal Bentahar, Zakaria Maamar, Djamal Benslimane,...
AISC
2008
Springer
13 years 10 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
GI
2001
Springer
14 years 28 days ago
Extending Sunit to Test Components
To ensure the deployment of reusable and reliable components, it is important to verify their functionality. In this paper, we present a framework for component testing, an extens...
Ludger Martin, Elke Siemon
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 8 months ago
Separable and Low-Rank Continuous Games
— Separable games are a structured subclass of continuous games whose payoffs take a sum-of-products form; the zero-sum case has been studied in earlier work. Included in this su...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...