4281 search results - page 657 / 857 » How to Disembed a Program |
101
Voted
SIGSOFT
2002
ACM
16 years 3 months ago
2002
ACM
This paper explores the idea that redundant operations, like type errors, commonly flag correctness errors. We experimentally test this idea by writing and applying four redundanc...
191
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
This paper presents automatic generation of the Web Ontology Language (OWL) from an UML model. The solution is based on an MDA-defined architecture for ontology development and th...
208
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
198
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
131
Voted
EACL
2009
ACL Anthology
16 years 3 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...