Semantics of distributed definite clause programs
نویسندگان
چکیده
منابع مشابه
Tabulation of Functions in Definite Clause Programs
An extended version of the applicative caching technique from functional programming is adapted to OLD resolution as an alternative to OLDT resolution for predicates that are actually functions. An inference system, OLDTF resolution, is given with a proof procedure. It is argued why this special case is interesting in its own right also outside the area of deductive databases. It is outlined ho...
متن کاملUnfold/Fold Transformations For Definite Clause Programs
An unfold/fold program transformation system which extends the unfold/fold transformations of H. Tamaki and T. Sato is presented in this paper. The system consists of unfolding, simultaneous folding , and generalization + equality introduction rules. The simultaneous folding rule permits the folding of a set of folded clauses into a single clause, using a set of folding clauses, while the gener...
متن کاملCompiling HPSG Type Constraints into Definite Clause Programs
We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their implementation. The compiler performs off-line constraint inheritance and code optimization. As a result, we are able to efficiently process with HPSG grammars with...
متن کاملStochastic Definite Clause Grammars
This paper introduces Stochastic Definite Clause Grammars, a stochastic variant of the wellknown Definite Clause Grammars. The grammar formalism supports parameter learning from annotated or unannotated corpora and provides a mechanism for parse selection by means of statistical inference. Unlike probabilistic contextfree grammars, it is a context-sensitive grammar formalism and it has the abil...
متن کاملMontagovian Definite Clause Grammar
This paper reports a completed stage of ongoing research at the University oF York. Landsbergen's advocacy of analytical inverses ~or compositional suntax rules encourages the application of Definite Clause Grammar techniques to the cons-t~uction of a parser returning Montague analysis trees. A parser MDCg is presented which implements an augmented Friedman-Warren algorithm permitting post refe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90129-1