For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
Tom Kwiatkowksi, Luke S. Zettlemoyer, Sharon Goldw...
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
The C-subfunction relations on the set of functions on a finite base set A defined by function classes C are examined. For certain clones C on A, it is determined whether the part...