Sciweavers

8 search results - page 1 / 2
» Implementing Natural Rewriting and Narrowing Efficiently
Sort
View
FLOPS
2004
Springer
13 years 8 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
ASE
2005
137views more  ASE 2005»
13 years 4 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
COLING
2010
12 years 12 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
AISC
2008
Springer
13 years 7 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
DAGM
2006
Springer
13 years 8 months ago
A Probabilistic Multi-phase Model for Variational Image Segmentation
Abstract. Recently, the Phase Field Method has shown to be a powerful tool for variational image segmentation. In this paper, we present a novel multi-phase model for probability b...
Thomas Pock, Horst Bischof