2911 search results - page 524 / 583 » A Theory of Expressiveness in Mechanisms |
168
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
188
click to vote
COOPIS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
175
click to vote
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
210
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
167
click to vote
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...