233 search results - page 6 / 47 » Intelligent compilers |
ISMIS
1993
Springer
15 years 1 months ago
1993
Springer
An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program...
JELIA
2000
Springer
15 years 1 months ago
2000
Springer
In previous work, we developed a framework for expressing general preference information in default logic and logic programming. Here we show that the approach of Brewka and Eiter ...
90
Voted
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
15 years 1 months ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
AAAI
2010
14 years 11 months ago
2010
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
73
Voted
AAAI
2007
14 years 12 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...