19 search results - page 4 / 4 » Scannerless Boolean Parsing |
UAI
2004
13 years 6 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
CSMR
2004
IEEE
13 years 8 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
CSCLP
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
FMSP
2000
ACM
13 years 9 months ago
2000
ACM
XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the appli...