Sciweavers

42 search results - page 2 / 9
» Computational properties of argument systems satisfying grap...
Sort
View
EXACT
2007
13 years 7 months ago
A Discourse Approach to Explanation Aware Knowledge Representation
This study describes a discourse approach to explanation aware knowledge representation. It presents a reasoning model that adheres to argumentation as found in written discourse,...
Andrew Potter
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 7 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
ATAL
2007
Springer
13 years 9 months ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
JUCS
2006
97views more  JUCS 2006»
13 years 5 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
LFCS
1994
Springer
13 years 9 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote