Automated reasoning with a constraint-based metainterpreter

Journal of Logic Programming

Volumn 37, Issue 1-3, 1998, Pages 213-254

  Christiansen, Henning ^a  

^a ROSKILDE UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; EXPERT SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS;

BINARY DEMO PREDICATE; CONSTRAINT-BASED METAINTERPRETERS; DEFAULT REASONING; LINEAR LOGIC;

LOGIC PROGRAMMING;

EID: 0032188159     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10009-2     Document Type: Article

References (61)

1. H. Bachya, Meta-level programming: A compiled approach, in: J.-L. Lassez (Ed.), Logic programming, Proceedings of the Fourth International Conference, MIT Press, Cambridge, MA, 1987, pp. 394-410.
2. H. Bacha, MetaProlog design and implementation, in: R.A. Kowalski, K.A. Bowen (Eds.), Logic Programming, Proceedings of the Fifth International Conference, MIT Press, Cambridge, MA, 1988, pp. 1371-1387.
3. K.A. Bowen, Meta-level programming and knowledge representation, New Generation Computing 3 (1985) 359-383.
4. K.A. Bowen, R.A. Kowalski, Amalgamating language and meta-language in logic programming, in: K.L. Clark, S.Å. Tärnlund (Eds.), Logic Programming, Academic Press, New York, 1982, pp. 153-172.
5. A.F. Bowers, C.A. Gurr, Towards fast and declarative meta-programming, in: K.A. Apt, F. Turini (Eds.), Meta-Logics and Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 137-166.
6. A. Brogi, P. Mancarella, D. Pedreschi, F. Turini, Composition operators for logic theories, in: J. Lloyd (Ed.), Computational Logic, Springer, Berlin, 1990, pp. 117-134.
7. I. Cervesato, Lollipops taste of Vanilla too, in: A. Momigliani, M. Ornaghi (Eds.), Proceedings of an ICLP-94 Post-Conference Workshop on Proof-theoretical extensions of logic programming, CMU, Pittsburgh, Philadelphia, 1994.
8. H. Christiansen, Declarative semantics of a meta-programming language, in: M. Bruynooghe (Ed.), Proceedings of the Second Workshop on Meta-programming in Logic, Leuven, Belgium, 1990, pp. 159-168.
9. H. Christiansen, Even non-recursive calls of binary demo may loop, Logic Programming, The newsletter of the association for Logic Programming 5 (4) (1992) 16-17.
10. H. Christiansen, A complete resolution method for logical meta-programming languages, in: Lecture Notes in Computer Science, vol. 649, 1992, pp. 205-219.
11. H. Christiansen, A complete demo predicate with co-routine control for automatic program synthesis, Extended abstract, in: Proceedings of the Second Compulog Area Meeting on Programming Languages joint with Workshop on Logic Languages, Progretto Finalizzato Sistemi Informatici e Calcolo Parallelo, Pisa, Italy, 6 & 7 May 1993.
12. H. Christiansen, Why should grammars not adapt themselves to context and discourse?, in: Fourth International Pragmatics Conference (Abstract collection), International Pragmatics Association, Kobe, Japan, 23-30 July, 1993, p. 23.
13. H. Christiansen, Efficient and complete demo predicates for definite clause languages, Datalogiske skrifter 51, Roskilde University (1994).
14. H. Christiansen, On proof predicates in logic programming, in: A. Momigliani, M. Ornaghi (Eds.), Proceedings of an ICLP-94 Post-Conference Workshop on Proof-Theoretical Extensions of Logic Programming, CMU, Pittsburgh, Philadelphia, 1994.
15. H. Christiansen, Alternative reasoning in a metaprogramming system, in: Proceedings of the ICLP'95 Joint Workshop on Deductive Databases and Logic Programming, Abduction in Deductive Databases and knowledge-based Systems, vol. 266, GMD-Studien, Gesellshaft für Mathematik und Datenverarbeitung MBH, Shonan Village Center, Japan, 1995, pp. 175-186.
16. H. Christiansen, Implicit program synthesis by a reversible metainterpreter, in: N.E. Fuchs (Ed.), Proceedings of LOPSTR'97 (to appear in Springer Lecture Notes in Artificial Intelligence).
17. R.L. Constable et al., Implementing Mathematics with the Nuprl Development System, Prentice-Hall, Englewood Cliffs, NJ, 1986.
18. Y. Deville, K.-K. Lau, Logic program synthesis, Journal of Logic Programming 19/20 (1994) 321-350.
19. A. Dovier, E.G. Omodeo, E. Pontelli, G. Rossi, {log}: A logic programming language with finite sets, in: K. Furukawa (Ed.), Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 111-124.
20. P. Flach, Abduction and induction: Syllogistic and inferential perspectives, in: Proceedings of the ECAI'96 Workshop on Abductive and Inductive Reasoning, Budapest, 12 August 1996, pp. 31-35.
21. J.P. Gallagher, A system for specialising logic programs, Technical Report TR-91-32, Department of Computer Science, University of Bristol (1991).
22. J.P. Gallagher, Tutorial on specialisation of logic programs, in: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'93), Copenhagen, 1993, pp. 88-98.
23. J.Y. Girard, Linear logic, Theoretical Computer Science 50 (1987) 1-101.
24. K. Gödel, Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, vol. 38, 1931, pp. 173-198 (English translation in [25]), pp. 596-616).
25. K. Gödel, Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, vol. 38, 1931, pp. 173-198 (English translation in [25]), pp. 596-616).
26. J. van Heijenoort, From Frege to Gödel, A Source on Mathematical Logic, 1879-1931, Harvard Univ. Press, Cambridge, MA, 1967.
27. D. Hilbert, Matematiche Probleme, Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris 1900, in: Archiv der Mathematik und Physik, 3rd series, vol. 1, 1901, pp. 44-62 & 213-237 (English translation of excerpts in [52], pp. 74-83).
28. D. Hilbert, Matematiche Probleme, Vortrag, gehalten auf dem internationalen Mathematiker- Kongress zu Paris 1900, in: Archiv der Mathematik und Physik, 3rd series, vol. 1, 1901, pp. 44-62 & 213-237 (English translation of excerpts in [52], pp. 74-83).
29. D. Hilbert, Über die Grundlagen der Logik und der Arithmetik, in: Verhandelungen des Dritten Internationalen Mathematiker-kongress in Heidelberg vom 8 bis 13 August 1904, Teubner, Stuttgart, 1905, pp. 174-185 (English translation in [25], pp. 129-138).
30. D. Hilbert, Über die Grundlagen der Logik und der Arithmetik, in: Verhandelungen des Dritten Internationalen Mathematiker-kongress in Heidelberg vom 8 bis 13 August 1904, Teubner, Stuttgart, 1905, pp. 174-185 (English translation in [25], pp. 129-138).
31. P.M. Hill, J.P. Gallagher, Meta-programming in logic programming, in: Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford Univ. Press, Oxford, 1994 (Currently available as Research Report Series 94.22, University of Leeds, School of Computer Studies, to be published).
32. P.M. Hill, J.W. Lloyd, Analysis of meta-programs, in: H. Abramson, M.H. Rogers (Eds.), Metaprogramming in Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 23-51.
33. P.M. Hill, J.W. Lloyd, The Gödel Programming Language, MIT press, Cambridge, MA, 1994.
34. P.M. Hill, R.W. Topor, A semantics for typed logic languages, in: F. Pfenning (Ed.), In Types in Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 1-62.
35. J.R. Hobbs, M.E. Stickel, D.E. Appelt, P. Martin, Interpretation as abduction, Artificial Intelligence 63 (1993) 69-142.
36. J.S. Hodas, D. Miller, Logic programming in a fragment of intuitionistic logic, Journal of Information and Control, 110 (1994) 327-365.
37. C. Holzbaur, Specification of constraint based inference mechanisms through extended unification, Dissertation, Department of Medical Cybernetics and Artificial Intelligence, University of Vienna (1990).
38. C. Holzbaur, Metastructures vs. attributed variables in the context of extensible unification, in: Lecture Notes in Computer Science, vol. 631, Springer, Berlin, 1992, pp. 260-268.
39. W.A. Howard, The formulae-as-type notion of construction, in: J.P. Seldin, R. Hindley (Eds.), To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 479-490.
40. J. Jaffar, M.J. Maher, Constraint logic programming: A survey, Journal of Logic Programming 19/20 (1994) 503-581.
41. A.A. Kakas, R.A. Kowalski, F. Toni, Abductive logic programming, Journal of Logic and Computation 2 (1993) 719-770.
42. A.J. Kfoury, J. Tiuryn, P. Urcyczyn, The undecidability of the semi-unification problem, in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 468-476.
43. A.J. Kfoury, J. Tiuryn, P. Urcyczyn, ML typability is Dexptime-complete, in: Lecture Notes in Computer Science, vol. 431, Springer, Berlin, 1990, pp. 206-220.
44. R. Kowalski, Logic for Problem Solving, North-Holland, Amsterdam, 1979.
45. J.-L. Lassez, J.-L. Maher, K. Marriott, Unification revisited, in: Lecture Notes in Computer Science, vol. 306, 1986, pp. 67-113.
46. P. Lim, P.J. Stuckey, Meta-programming as constraint programming, in: Proceedings of the 1990 North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 406-420.
47. J.W. Lloyd, Foundations of Logic Programming, 2nd extended edition, Springer, Berlin, 1987.
48. M. Lowry, A. Philpot, T. Pressburger, I. Underwood, Amphion: Automatic programming for scientific subroutine libraries, in: Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems, Charlotte, North Carolina, 1994, pp. 326-335.
49. P. Maes, D. Nardi (Eds.), Meta-level Architectures and Reflection, North-Holland, Amsterdam, 1988.
50. J. McCarthy, Recursive functions of symbolic expressions and their computation by machine, Communications of the ACM 3 (1960) 184-195.
51. S. Muggleton, L. De Raedt, Inductive logic programming: Theory and methods, Journal of Logic Programming 19/20 (1994) 629-679.
52. A. Burks, H.H. Goldstine, J. von Neumann, Preliminary discussion of the logical design of an electronic computing instrument, US Army Ordnance Department Report, 1946 (Reprinted in: C.G. Bell, A. Newell (Eds.), Computer Structures: Readings and Examples, McGraw-Hill, New York, 1971, pp. 92-119).
53. A. Burks, H.H. Goldstine, J. von Neumann, Preliminary discussion of the logical design of an electronic computing instrument, US Army Ordnance Department Report, 1946 (Reprinted in: C.G. Bell, A. Newell (Eds.), Computer Structures: Readings and Examples, McGraw-Hill, New York, 1971, pp. 92-119).
54. M. Numao, M. Shimura, Inductive program synthesis by using a reversible meta-interpreter, in: M. Bruynooghe (Ed.), Proceedings of the Second Workshop on Meta-programming in Logic, Leuven, Belgium, 4-6 April 1990, pp. 123-136.
55. C.S. Peirce, in: C. Hartshorne, P. Weiss, A.W. Burks (Eds.), Collected Papers of Charles Sanders Peirce, 8 vols., Harvard Univ. Press, Cambridge, MA, 1931-1958.
56. C. Reid, Hilbert, Springer, Berlin, 1970.
57. R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence 32 (1987) 57-95.
58. A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM 12 (1965) 23-41.
59. T. Sato, Meta-programming through a truth predicate, in: K. Apt (Ed.), Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1992, pp. 526-540.
60. SICStus Prolog User's Manual, version 3.0, SICS, Swedish Institute of Computer Science (1995).
61. D.H.D. Warren, Implementing Prolog - Compiling predicate logic programs, D.A.I. Research Report Nos. 39 & 40, Edinbourgh University (1977)