144 search results - page 6 / 29 » Solving Regular Tree Grammar Based Constraints |
AAAI
1990
14 years 10 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
94
Voted
JMLR
2012
12 years 12 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
AML
2010
14 years 9 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
74
Voted
KDID
2003
14 years 11 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...