메뉴 건너뛰기




Volumn 2, Issue 2, 2002, Pages 203-232

Chain programs for writing deterministic metainterpreters

Author keywords

Bounded resource reasoning; Chain programs; Committed choice processors; Deterministic metainterpretation; Exhaustive search

Indexed keywords


EID: 0346041982     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840100134X     Document Type: Article
Times cited : (2)

References (39)
  • 4
    • 0347184558 scopus 로고
    • Compiling generate-and-test programs to committed-choice AND-parallelism
    • Case Western Reserve University, Cleveland, OH
    • Bansal, A. K. & Sterling, L. (1987) Compiling generate-and-test programs to committed-choice AND-parallelism. Technical Report CES-87-13, Case Western Reserve University, Cleveland, OH.
    • (1987) Technical Report CES-87-13
    • Bansal, A.K.1    Sterling, L.2
  • 6
    • 0002830387 scopus 로고
    • Amalgamating language and metalanguage in logic programming
    • K. Clark and S.-A. Tärnlund (eds.). Academic Press
    • Bowen, K. A. & Kowalski, R. A. (1982) Amalgamating language and metalanguage in logic programming. In: K. Clark and S.-A. Tärnlund (eds.), Logic Programming, pp. 153-172. Academic Press.
    • (1982) Logic Programming , pp. 153-172
    • Bowen, K.A.1    Kowalski, R.A.2
  • 7
    • 0022046195 scopus 로고
    • Notes on the implementation of Parlog
    • Clark, K. & Gregory, S. (1985) Notes on the implementation of Parlog. J. Logic Programming 1, 17-42.
    • (1985) J. Logic Programming , vol.1 , pp. 17-42
    • Clark, K.1    Gregory, S.2
  • 8
    • 0019436790 scopus 로고
    • Consequence verification of flowcharts
    • Clark, K. L. & van Emden, M. (1981) Consequence verification of flowcharts. IEEE Trans. Softw. Eng. SE-7(1), 52-60.
    • (1981) IEEE Trans. Softw. Eng. , vol.SE-7 , Issue.1 , pp. 52-60
    • Clark, K.L.1    Van Emden, M.2
  • 9
    • 0346554526 scopus 로고
    • Compiling or-parallelism into and-parallelism
    • E. Shapiro (ed.). MIT Press
    • Codish, M. & Shapiro, E. (1987) Compiling or-parallelism into and-parallelism. In: E. Shapiro (ed.), Concurrent Prolog. Collected Papers, Vol. 2, pp. 351-382. MIT Press.
    • (1987) Concurrent Prolog. Collected Papers , vol.2 , pp. 351-382
    • Codish, M.1    Shapiro, E.2
  • 10
    • 0016777060 scopus 로고
    • On the completeness of the inductive assertion method
    • de Bakker, J. & Meertens, L. (1975) On the completeness of the inductive assertion method. J. Computer & System Sciences 11, 323-357.
    • (1975) J. Computer & System Sciences , vol.11 , pp. 323-357
    • De Bakker, J.1    Meertens, L.2
  • 13
    • 0009830169 scopus 로고
    • Unfold/fold transformations of logic programs
    • J.-L. Lassez and G. Plotkin (eds.). MIT Press
    • Gardner, P. & Shepherdson, J. (1992) Unfold/fold transformations of logic programs. In: J.-L. Lassez and G. Plotkin (eds.), Computational Logic. Essays in Honor of Alan Robinson, pp. 565-583. MIT Press.
    • (1992) Computational Logic. Essays in Honor of Alan Robinson , pp. 565-583
    • Gardner, P.1    Shepherdson, J.2
  • 15
    • 0345923356 scopus 로고
    • Ambivalent logic as the semantic basis of metalogic programming: I
    • P. V. Hentenryck (ed.)
    • Jiang, Y. (1994) Ambivalent logic as the semantic basis of metalogic programming: I. In: P. V. Hentenryck (ed.), Proc. 11th International Conference on Logic Programming, pp. 387-401.
    • (1994) Proc. 11th International Conference on Logic Programming , pp. 387-401
    • Jiang, Y.1
  • 16
    • 0008149390 scopus 로고
    • Problems and promises of computational logic
    • J. Lloyd (ed.). Springer-Verlag
    • Kowalski, R. A. (1990) Problems and promises of computational logic. In: J. Lloyd (ed.), Computational Logic. Symposium Proceedings, pp. 1-36. Springer-Verlag.
    • (1990) Computational Logic. Symposium Proceedings , pp. 1-36
    • Kowalski, R.A.1
  • 17
    • 0347184556 scopus 로고
    • A springboard for information processing in the 21st century
    • Panel Discussion at the Fifth Generation Computer Systems Conference 1992
    • Kowalski, R. A. (1993) A springboard for information processing in the 21st century. ICOT J. 38, 17-41. (Panel Discussion at the Fifth Generation Computer Systems Conference 1992.)
    • (1993) ICOT J. , vol.38 , pp. 17-41
    • Kowalski, R.A.1
  • 18
    • 0043050058 scopus 로고
    • Using meta-logic to reconcile reactive with rational agents
    • K. Apt and F. Turini (eds.). MIT Press
    • Kowalski, R. A. (1995) Using meta-logic to reconcile reactive with rational agents. In: K. Apt and F. Turini (eds.), Meta-Logics and Logic Programming, pp. 227-242. MIT Press.
    • (1995) Meta-Logics and Logic Programming , pp. 227-242
    • Kowalski, R.A.1
  • 20
    • 0347814667 scopus 로고
    • Representation and enumeration of Flat Concurrent Prolog computations
    • E. Shapiro (ed.). MIT Press
    • Lichtenstein, Y., Codish, M. & Shapiro, E. (1987) Representation and enumeration of Flat Concurrent Prolog computations. In: E. Shapiro (ed.), Concurrent Prolog. Collected Papers, Vol. 2, pp. 197-210. MIT Press.
    • (1987) Concurrent Prolog. Collected Papers , vol.2 , pp. 197-210
    • Lichtenstein, Y.1    Codish, M.2    Shapiro, E.3
  • 23
    • 0028428124 scopus 로고
    • Transformation of logic programs: Foundations and techniques
    • Pettorossi, A. & Proietti, M. (1994) Transformation of logic programs: Foundations and techniques. J. Logic Programming, 19, 20, 261-320.
    • (1994) J. Logic Programming , vol.19-20 , pp. 261-320
    • Pettorossi, A.1    Proietti, M.2
  • 25
    • 0030410145 scopus 로고    scopus 로고
    • Chart parsers as inference systems for fixed-mode logic programs
    • Rosenblueth, D. A. (1996) Chart parsers as inference systems for fixed-mode logic programs. New Generation Computing, 14(4), 429-458.
    • (1996) New Generation Computing , vol.14 , Issue.4 , pp. 429-458
    • Rosenblueth, D.A.1
  • 26
    • 0345923357 scopus 로고    scopus 로고
    • An exhaustive-search method using layered streams obtained through a meta-interpreter for chain programs
    • Manchester, UK. Technical Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-98-6-1
    • Rosenblueth, D. A. (1998) An exhaustive-search method using layered streams obtained through a meta-interpreter for chain programs. Extended Abstracts of LOPSTR'98, Eighth International Workshop on Logic-based Program Synthesis and Transformation, Manchester, UK. (Technical Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-98-6-1. http://www.cs.man.ac.uk/cstechrep/titles98.html.)
    • (1998) Extended Abstracts of LOPSTR'98, Eighth International Workshop on Logic-based Program Synthesis and Transformation
    • Rosenblueth, D.A.1
  • 27
    • 0040532030 scopus 로고    scopus 로고
    • SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
    • Rosenblueth, D. A. & Peralta, J. C. (1998) SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing. J. Logic Programming, 34(3), 227-260.
    • (1998) J. Logic Programming , vol.34 , Issue.3 , pp. 227-260
    • Rosenblueth, D.A.1    Peralta, J.C.2
  • 28
    • 0347717925 scopus 로고
    • Meta interpreters for real
    • H. Kugler (ed.). Elsevier
    • Safra, S. & Shapiro, E. (1986) Meta interpreters for real. In: H. Kugler (ed.), Information Processing 86 IFIP, pp. 532-557. Elsevier.
    • (1986) Information Processing 86 IFIP , pp. 532-557
    • Safra, S.1    Shapiro, E.2
  • 29
    • 0027706084 scopus 로고
    • Mixtus: An automatic partial evaluator for full Prolog
    • Sahlin, D. (1993) Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12, 7-51.
    • (1993) New Generation Computing , vol.12 , pp. 7-51
    • Sahlin, D.1
  • 30
    • 0347184557 scopus 로고
    • Existential continuation
    • Sato, T. & Tamaki, H. (1989a) Existential continuation. New Generation Computing, 6(4), 421-438.
    • (1989) New Generation Computing , vol.6 , Issue.4 , pp. 421-438
    • Sato, T.1    Tamaki, H.2
  • 31
    • 84990936229 scopus 로고
    • First order compiler: A deterministic logic program synthesis algorithm
    • Sato, T. & Tamaki, H. (1989b) First order compiler: A deterministic logic program synthesis algorithm. Symbolic Computation, 8, 605-627.
    • (1989) Symbolic Computation , vol.8 , pp. 605-627
    • Sato, T.1    Tamaki, H.2
  • 32
    • 0020953102 scopus 로고
    • A query-the-user facility for logic programming
    • P. Degano and E. Sandewall (eds.). North Holland
    • Sergot, M. (1982) A query-the-user facility for logic programming. In: P. Degano and E. Sandewall (eds.), Proc. European Conference on Integrated Interactive Computing Systems, pp. 27-44. North Holland.
    • (1982) Proc. European Conference on Integrated Interactive Computing Systems , pp. 27-44
    • Sergot, M.1
  • 34
    • 0347814675 scopus 로고
    • Or-parallel Prolog in Flat Concurrent Prolog
    • E. Shapiro (ed.). MIT Press
    • Shapiro, E. (1987) Or-parallel Prolog in Flat Concurrent Prolog. In: E. Shapiro (ed.), Concurrent Prolog. Collected Papers, Vol. 2, pp. 415-441. MIT Press.
    • (1987) Concurrent Prolog. Collected Papers , vol.2 , pp. 415-441
    • Shapiro, E.1
  • 35
    • 0013113672 scopus 로고
    • Stream-based compilation of ground I/O Prolog into committed-choice languages
    • Melbourne, Australia
    • Tamaki, H. (1987) Stream-based compilation of ground I/O Prolog into committed-choice languages. Proc. 4th International Conference on Logic Programming, pp. 376-393. Melbourne, Australia.
    • (1987) Proc. 4th International Conference on Logic Programming , pp. 376-393
    • Tamaki, H.1
  • 39
    • 0003053140 scopus 로고
    • Making exhaustive search programs deterministic
    • Ueda, K. (1987) Making exhaustive search programs deterministic. New Generation Computing, 5, 29-44.
    • (1987) New Generation Computing , vol.5 , pp. 29-44
    • Ueda, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.