Sciweavers

1941 search results - page 313 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
CIE
2005
Springer
15 years 9 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
146
Voted
EACL
1993
ACL Anthology
15 years 4 months ago
A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
Geoffrey Simmons
BIRTHDAY
2005
Springer
15 years 9 months ago
Natural Language Proof Explanation
Abstract. State-of-the-art proof presentation systems suffer from several deficiencies. First, they simply present the proofs without motivating why the proof is done as it is do...
Armin Fiedler
145
Voted
IJWIS
2007
153views more  IJWIS 2007»
15 years 3 months ago
A security framework for agent-based systems
Purpose – This paper aims to address some security issues in open systems such as service-oriented applications and grid computing. It proposes a security framework for these sy...
Jamal Bentahar, Francesca Toni, John-Jules Ch. Mey...
DLOG
2003
15 years 4 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt