Sciweavers

479 search results - page 27 / 96
» The theory and calculus of aliasing
Sort
View
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
ARGMAS
2006
Springer
13 years 11 months ago
Argumentation and Persuasion in the Cognitive Coherence Theory: Preliminary Report
Abstract. This paper presents a coherentist approach to argumentation that extends previous proposals on cognitive coherence based agent communication pragmatics (inspired from soc...
Philippe Pasquier, Iyad Rahwan, Frank Dignum, Liz ...
COMMA
2006
13 years 9 months ago
Argumentation and Persuasion in the Cognitive Coherence Theory
Abstract. This paper presents a coherentist approach to argumentation that extends previous proposals on cognitive coherence based agent communication pragmatics (inspired from soc...
Philippe Pasquier, Iyad Rahwan, Frank Dignum, Liz ...
KRDB
2003
139views Database» more  KRDB 2003»
13 years 9 months ago
Expressing Transactions with Savepoints as Non-Markovian Theories of Actions
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transacti...
Iluju Kiringa, Alfredo Gabaldon