1722 search results - page 246 / 345 » Ontology Formalism Transformation |
APLAS
2003
ACM
14 years 3 months ago
2003
ACM
We present a method for automatic program inversion in a first-order functional programming language. We formalize the transformation and illustrate it with several examples inclu...
CL
2000
Springer
14 years 1 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
ASM
2010
ASM
14 years 19 days ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
LREC
2010
13 years 11 months ago
2010
The goal of DARPA's Machine Reading (MR) program is nothing less than making the world's natural language corpora available for formal processing. Most text processing r...
DAGSTUHL
2003
13 years 11 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...