HYPROLOG: A new logic programming language with assumptions and abduction

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 159-173

  Christiansen, Henning ^a   Dahl, Veronica ^b  

^a ROSKILDE UNIVERSITY   (Denmark)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA HANDLING; LOGIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS; SYNTACTICS;

CONSTRAINT HANDLING RULES (CHR); GRAMMAR NOTATION; INTEGRITY CONSTRAINTS; OPERATIONAL SEMANTICS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 27144485193     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_14     Document Type: Conference Paper

References (25)

1. M.Alberti, F.Chesani, M.Gavanelli, E.Lamma, P.Mello, and P.Torroni. The CHR-based Implementation of a System for Generation and Confirmation of Hypotheses. In 19th Workshop on (Constraint) Logic Programming Wolf, A., Frühwirth, Th., and Meister, M., (eds.). Ulmer Informatik-Berichte 2005-01, University of Ulm. pp. 111-122. Available at http://www.informatik.uni-ulm.de/ epindata/user/11541.218,UIB_2005-01.pdf
2. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In G. Smolka, editor, Principles and Practice of Constraint Programming -CP97, volume 1330 of Lecture Notes in Computer Science, pages 252-266. Springer, 1997.
3. Abdennadher, S. and Christiansen, H., An Experimental CLP Platform for Integrity Constraints and Abduction. In: Proc. of FQAS2000, Flexible Query Answering Systems, Larsen, H.L., Kacprzyk, J., Zadrozny, S., Andreasen, T., and Christiansen, H. (Eds.) pp. 141-152, Advances in Soft Computing series, Physica-Verlag (Springer), 2000.
4. V: A flexible query language. In: Proc. FQAS'98, Flexible Query Answering Systems, Andreasen, T., Christiansen, H., and Larsen, H.L. (Eds.) Lecture Notes in Artificial Intelligence 1495, pp. 1-14, Springer, 1998.
5. Betz, H. and Frühwirth, T. A linear logic semantics for Constraint Handling Rules. In: Proc. CP 2005, Eleventh International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. To appear, 2005.
6. Badea, L. and Tilivea D. Abductive Partial Order Planning with Dependent Fluents. In: KI 2001: Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, Baader, F., Brewka, G., Eiter, T., (eds.) Lecture Notes in Artificial Intelligence 2174 p. 63-77, Springer, 2001.
7. Chan, D., Constructive negation based on the database completion, Proc. of Fifth International Conference and Symposium on Logic Programming, (eds. Kowalski, Bowen), pp. 111-125, MIT Press, 1988.
8. Christiansen, H. Automated reasoning with a constraint-based metainterpreter, Journal of Logic Programming, Vol 37(1-3) Oct-Dec, pp. 213-253, 1998.
9. Christiansen, H., Abductive Language Interpretation as Bottom-up Deduction. In: Natural Language Understanding and Logic Programming, Proceedings of the 2002 workshop, ed. Wintner, S., Datalogiske Skrifter vol. 92, Roskilde University, Comp. Sci. Dept., pp. 33-47, 2002.
10. Christiansen, H., CHR grammars. To appear in International Journal on Theory and Practice of Logic Programming, special issue on Constraint Handling Rules, 2005.
11. Christiansen, H., and Dahl, V., Logic Grammars for Diagnosis and Repair. International Journal on Artificial Intelligence Tools, Vol. 2, no. 3 (2003), pp. 227-248.
12. H. Christiansen and V. Dahl. Assumptions and abduction in Prolog. In S. Muñoz-Hernández, J. M. Gómez-Perez, and P. Hofstedt, editors, Proceedings of WLPE 2004: 14th Workshop on Logic Programming Environments and MultiCPL 2004: Third Workshop on Multiparadigm Constraint Programming Languages Workshop Proceedings, pages 87-101, 2004.
13. Christiansen, H., Dahl, V., Meaning in Context, In: Proc. Fifth International and Interdisciplinary Conference on Modeling and Using Context (CONTEXT-05). Dey, A.K., Kokinov, B.N., Leake, D.B., and Turner R.M. (Eds.) Lecture Notes in Artificial Inteligence vol. 3554, pp. 97-111, 2005.
14. Dahl, V., and Tarau, P. Assumptive Logic Programming. Argentine Symposium on Artificial Intelligence (ASAI) 2004, September 20-21, Cordoba, Argentina, 2004.
15. Dahl, V., Tarau, P., and Li, R., Assumption grammars for processing natural language. Proc. Fourteenth International Conference on Logic Programming, Naish, L. (ed.), pp. 256-270, MIT Press, 1997.
16. G. J. Duck, P. J. Stuckey, M. J. G. de la Banda, and C. Holzbaur. Compiling ask constraints. In B. Demoen and V. Lifschitz, editors, ICLP, volume 3132 of Lecture Notes in Computer Science, pages 90-104. Springer, 2004.
17. Frühwirth, T.W., Theory and Practice of Constraint Handling Rules, Journal of Logic Programming, Vol. 37(1-3), pp. 95-138, 1998.
18. Kakas, A.C., Michael, A., and Mourlas, C. ACLP: Abductive Constraint Logic Programming, The Journal of Logic Programming, vol 44, pp. 129-177, 2000.
19. Kakas, A.C., Kowalski, R.A., and Toni, F. The role of abduction in logic programming, Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, Gabbay, D.M, Hogger, C.J., Robinson, J.A., (eds.), Oxford University Press, pp. 235-324, 1998.
20. Kakas, A.C., Van Nuffelen, B., and Denecker, M. A-System: Problem Solving through Abduction. IJCAI 2001: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Nebel, B. (ed.), Morgan-Kaufmann, pp. 591-596, 2001.
21. Pereira, F.C.N., and Warren, D.H.D., Definite clause grammars for language analysis. A survey of the formalism and a comparison with augmented transition grammars. Artificial Intelligence 10, no. 3-4, pp. 165-176, 1980.
22. Poole, D., Mackworth, A., and Goebel, R. Computational Intelligence, Oxford University Press, 1998.
23. SICStus Prolog user's manual. Version 3.12, SICS, Swedish Institute of Computer Science, 2005. Most recent version available at http://www.sics.se/isl.
24. Shanahan, M., Reinventing Shakey. Logic-Based Artificial Intelligence, M inker, J. (ed). Kluwer Academic, pp. 233-253, 1999.
25. Tarau, P., Dahl, V., and Fall, A. Backtrackable State with Linear Affine Implication and Assumption Grammars. In: Concurrency and parallelism, Programming, Networking, and Security, Jaffar, J. and Yap, R. (eds.). Lecture Notes in Computer Science 1179, Springer Verlag, pp. 53-64, 1996.