Sciweavers

383 search results - page 57 / 77
» On bipolarity in argumentation frameworks
Sort
View
TCS
2008
14 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
LOGCOM
1998
132views more  LOGCOM 1998»
14 years 9 months ago
Agents That Reason and Negotiate by Arguing
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
Simon Parsons, Carles Sierra, Nicholas R. Jennings
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 4 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
TPHOL
2008
IEEE
15 years 4 months ago
Nominal Inversion Principles
When reasoning about inductively defined predicates, such as typing judgements or reduction relations, proofs are often done by inversion, that is by a case analysis on the last r...
Stefan Berghofer, Christian Urban
FSTTCS
2008
Springer
14 years 10 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
Takahito Aoto