Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Theoretical Computer Science. To appear 1995; a preliminary version is available as DFKI Research Report RR-92-30, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany. @ NUS Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Definition of Kernel Oz - Smolka (1994) (24 citations) Self-citation (Smolka) (Correct)
....other predicate but the subtree predicate is undecidable [16] Kernel Oz restricts the use of constraints such that satisfiability and entailment of the occurring constraints is efficiently decidable. More about the logic and algorithmic properties of record and tuple constraints can be found in [15, 3, 1, 2]. 3 The Actor Model The actor model is the informal computation model underlying Oz. It can be seen as a computational metaphor for the Oz calculus, the formal computation model underlying Oz. The two models formulate complementary views of computation in Oz supporting different intuitions. The ....
Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Theoretical Computer Science. To appear 1995; a preliminary version is available as DFKI Research Report RR-92-30, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany.
The Definition of Kernel Oz - Smolka (1994) (24 citations) Self-citation (Smolka) (Correct)
....other predicate but the subtree predicate is undecidable [16] Kernel Oz restricts the use of constraints such that satisfiability and entailment of the occurring constraints is efficiently decidable. More about the logic and algorithmic properties of record and tuple constraints can be found in [15, 3, 1, 2]. 9 3 The Actor Model The actor model is the informal computation model underlying Oz. It can be seen as a computational metaphor for the Oz calculus, the formal computation model underlying Oz. The two models formulate complementary views of computation in Oz supporting different intuitions. ....
Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Theoretical Computer Science. To appear 1995; a preliminary version is available as DFKI Research Report RR-92-30, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany.
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.