Sciweavers

5326 search results - page 125 / 1066
» On what we can ensure
Sort
View
CIE
2005
Springer
15 years 12 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
MST
2007
168views more  MST 2007»
15 years 5 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
ARGMAS
2008
Springer
15 years 8 months ago
Co-ordination and Co-operation in Agent Systems: Social Laws and Argumentation
The social laws paradigm represents an important approach to the co-ordination of behaviour in multi-agent systems. In this paper we examine the relationship between social laws an...
Katie Atkinson, Trevor J. M. Bench-Capon
AAAI
2007
15 years 8 months ago
Forgetting Actions in Domain Descriptions
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
Esra Erdem, Paolo Ferraris
ECOOPW
1997
Springer
15 years 10 months ago
Towards a Precise Semantics for Object-Oriented Modeling Techniques
In this paper, we demonstrate how a precise semantics of object-oriented modeling techniques can be achieved, and what the possible bene ts are. We outline the main modeling techni...
Ruth Breu, Radu Grosu, Franz Huber, Bernhard Rumpe...