Sciweavers

4224 search results - page 523 / 845
» Reasoning about Choice
Sort
View
SCP
2008
115views more  SCP 2008»
15 years 6 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
IJAOSE
2007
93views more  IJAOSE 2007»
15 years 6 months ago
A formal semantics for Gaia liveness rules and expressions
The Gaia methodology is a development methodology for multi-agent systems that uses the concept of roles to define behaviour. Gaia uses liveness expressions, which are expression...
Tim Miller, Peter McBurney
IJCSA
2007
88views more  IJCSA 2007»
15 years 6 months ago
A New Quantitative Trust Model for Negotiating Agents using Argumentation
In this paper, we propose a new quantitative trust model for argumentation-based negotiating agents. The purpose of such a model is to provide a secure environment for agent negot...
Jamal Bentahar, John-Jules Ch. Meyer
SYNTHESE
2008
110views more  SYNTHESE 2008»
15 years 6 months ago
Methodological naturalism and epistemic internalism
Epistemic naturalism holds that the results or methodologies from the cognitive sciences are relevant to epistemology, and some have maintained that scientific methods are more com...
Gregory R. Wheeler, Luís Moniz Pereira
AML
2005
104views more  AML 2005»
15 years 6 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys