68 search results - page 7 / 14 » Extension of First-Order Theories into Trees |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
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...
PC
2006
13 years 7 months ago
2006
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
25
Voted
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
ACL
2004
13 years 9 months ago
2004
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
CLIMA
2004
13 years 9 months ago
2004
Abstract. This paper deals with the issue of learning in multi-agent systems (MAS). Particularly, we are interested in BDI (Belief, Desire, Intention) agents. Despite the relevance...