Symbolic constraints for meta-logic programming

Applied Artificial Intelligence

Volumn 14, Issue 4, 2000, Pages 345-367

  Christiansen, Henning ^a   Martinenghi, Davide ^a  

^a ROSKILDE UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CONSTRAINT THEORY; LINGUISTICS; METADATA; PROGRAM INTERPRETERS;

META-PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0034175345     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/088395100117034     Document Type: Article

References (31)

1. Adé, H., and M. Denecker. 1995. AILP: Abductive inductive logic programming. In Proceedings 14th International Joint Conference on Artificial Intelligence, Montreal, Quebec, Canada, 1201-1207. San Diego: Morgan Kaufmann.
2. Barklund, J. 1989. What is a meta-variable in Prolog? Meta-Programming in Logic Programming, eds. H. Abramson and M. H. Rogers, 383-398. Cambridge: MIT Press.
3. Bowen, K. A. 1985. Meta-level programming and knowledge representation. New Generation Computing 3:359-383.
4. Bowen, K. A., and R. A. Kowalski. 1982. Amalgamating language and meta-language in logic programming. In Logic Programming, eds. K. L. Clark and S. A Tarnlund, 153-172. New York: Academic Press.
5. Carlsson, M. 1987. Freeze, indexing, and other implementation issues in the WAM. In Proceedings ICLP’87, International Conference on Logic Programming, ed. J-L. Lassez, 40-58. Cambridge: MIT Press.
6. Christiansen, H. 1992a. A complete resolution method for logical meta-programming languages. Lecture Notes in Computer Science 649, 205-219.
7. Christiansen, H. 1992b. Even non-recursive calls of binary demo may loop. Logic Programming, The Newsletter of the Association for Logic Programming 5/4, 16-17.
8. Christiansen, H. 1998. Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming (Special Issue on Constraint Logic Programming) 37(1-3): 213-254.
9. Christiansen, H. 1999a. Abduction and induction combined in a metalogic framework. In Abductive and Inductive Reasoning: Essays on their Relation and Integration, eds. P. Flach and A. Kakas. Kluwer, Deventer, The Netherlands.
10. Christiansen, H. 1999b. Integrity constraints & constraint logic programming. In Proceedings of 12th International Conference on Applications of Prolog (INAP’99), Science Univerity of Tokyo, Japan. 5-12.
11. Decker, H. 1996. An extension of SLD by abduction and integrity maintenance for view updating in deductive databases. In Proc. of Joint International Conference and Synposium on Logic Programming (JICSLP)’96, Bonn, Germany. Ed. M. J. Maher, 157-169. Cambridge: MIT Press.
12. Denecker, M., and D. de Schreye. 1992. SLDNFA: An abductive procedure for normal abductive programs. In Proceedings of JICSLP’92, ed. K. R. Apt, 686-700. Washington D.C.
13. Denecker, M., and D. de Schreye. 1998. SLDNFA: An abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2): 111-167.
14. Flach, P., and A. Kakas (eds.). 1999. Abductive and Inductive Reasoning: Essays on their Relation and Integration. Kluwer, Deventer, The Netherlands.
15. Fruhwirth, T. 1993. CHR constraint handling, abstract and poster. International Conference on Logic Programming, (ICLP’93). Cambridge: MIT Press, 837-838.
16. Fruhwirth, T. W. 1995. Constraint handling rules. Lecture Notes in Computer Science 910, 90-107.
17. Fruhwirth, T. W. 1998. Theory and practice of constraint handling rules. Journal of Logic Programming 37(1-3): 95-138.
18. Hill, P. M., and J. Gallagher. 1998. Meta-pogramming in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming, eds. D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Volume 5, 421-498. London: Oxford University Press.
19. Hill, P. M., and J. W. Lloyd. 1989. Analysis of meta-programs. Meta-programming in Logic Programming, eds. H. Abramson and M. H. Rogers, 23-51. Cambridge: MIT Press.
20. Hill, P. M., and J. W. Lloyd, 1994. The Gödel Programming Language. Cambridge: MIT Press.
21. Holzbaur, C. 1990. Specification of constraint based inference mechanism through extended unification, dissertation, Department of Medical Cybernetics & AI, University of Vienna.
22. Holzbaur, C. 1992. Metastructures vs. attributed variables in the context of extensible unification, programming language implementation and logic programming, eds. M. Bruynooghe and M. Wirsing. Lecture Notes in Computer Science 631, 260-268.
23. Holzbaur, C., and T. Fruhwirth. 1998. Compiling constraint handling rules (CHR). In Third ERCIM/Compulog Network Workshop on Constraints, CWI Amsterdam, The Netherlands.
24. Jaffar, J., and M. J. Maher. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19(20): 503-581.
25. Kakas, A. C., and P. Mancarella. 1990. Database updates through abduction. In Proceedings 16th International Conference on Very Large Databases, Brisbane, Queensland, Australia, eds. D. McLeod, R. Sacks-Davis, and H. J. Schek. San Diego: Morgan Kaufmann. pp. 650-661.
26. Kowalski, R. A. 1979. Logic for Problem Solving. Amsterdam: Elsevier.
27. Kowalski, R. A., F. Toni, and G. Wetzel. 1998. Execution suspended logic programs. Fundamenta: Infor-maticae XX 1-18.
28. Lim, P., and P. J. Stuckey. 1990. Meta-programming as constraint programming, In Logic Programming: Proceedings of the 1990 North American Conference, 406-420. Cambridge: MIT Press.
29. Martinenghi, D. 1999. Implementing the event calculus in the DEMOII system. Datalogiske skrifter’85 Technical/Report, Roskilde University, Computer Science Dept., 1999.
30. Pfenning, F. (ed.). 1992. Types in Logic Programming. Cambridge: MIT Press.
31. Sato, T. 1992. Meta-programming through a truth predicate. In Logic Programming, Proceedings of the Joint International Conference and Symposium on Logic Programming, ed. K. Apt, 526-540. Cambridge: MIT Press.