HYPROLOG: A New Logic Programming Language with Assumptions and Abduction

1. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: The CHR-based Implementation of a System for Generation and Confirmation of Hypotheses. In: Wolf, A., Frühwirth, T., Meister, M. (eds.) 19th Workshop on (Constraint) Logic Programming, Ulmer Informatik-Berichte 2005-01, University of Ulm, pp. 111–122, http://www.informatik.uni-ulm.de/epin-data/user/11541.218,UIB_2005-01.pdf

2. Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 252–266. Springer, Heidelberg (1997)

   Chapter  Google Scholar 

3. Abdennadher, S., Christiansen, H.: An Experimental CLP Platform for Integrity Constraints and Abduction. In: Proc. of FQAS 2000, Flexible Query Answering Systems. Advances in Soft Computing series, pp. 141–152. Physica/Springer, Heidelberg (2000)

   Google Scholar 

4. Abdennadher, S., Schütz, H.: CHR\(^{\lor}\): A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1–14. Springer, Heidelberg (1998)

   Chapter  Google Scholar 

5. Betz, H., Frühwirth, T.: A linear logic semantics for Constraint Handling Rules. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 137–151. Springer, Heidelberg (2005) (to appear)

   Chapter  Google Scholar 

6. Badea, L., Tilivea, D.: Abductive Partial Order Planning with Dependent Fluents. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 63–77. Springer, Heidelberg (2001)

   Chapter  Google Scholar 

7. Chan, D.: Constructive negation based on the database completion. In: Kowalski, B. (ed.) Proc. of Fifth International Conference and Symposium on Logic Programming, pp. 111–125. MIT Press, Cambridge (1988)

   Google Scholar 

8. Christiansen, H.: Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming 37(1–3), 213–253 (1998)

   Article  MATH  MathSciNet  Google Scholar 

9. Christiansen, H.: Abductive Language Interpretation as Bottom-up Deduction. In: Wintner, S. (ed.) Natural Language Understanding and Logic Programming, Proceedings of the 2002 workshop, Roskilde University, Comp. Sci. Dept. Datalogiske Skrifter, vol. 92, pp. 33–47 (2002)

   Google Scholar 

10. Christiansen, H.: CHR grammars. International Journal on Theory and Practice of Logic Programming, special issue on Constraint Handling Rules (2005) (to appear)

    Google Scholar 

11. Christiansen, H., Dahl, V.: Logic Grammars for Diagnosis and Repair. International Journal on Artificial Intelligence Tools 2(3), 227–248 (2003)

    Article  Google Scholar 

12. Christiansen, H., Dahl, V.: Assumptions and abduction in Prolog. In: Muñoz-Hernández, S., Gómez-Perez, J.M., Hofstedt, P. (eds.) Proceedings of WLPE 2004: 14th Workshop on Logic Programming Environments and MultiCPL 2004: Third Workshop on Multiparadigm Constraint Programming Languages Workshop Proceedings, pp. 87–101 (2004)

    Google Scholar 

13. Christiansen, H., Dahl, V.: Meaning in Context. In: Dey, A.K., Kokinov, B., Leake, D.B., Turner, R. (eds.) CONTEXT 2005. LNCS (LNAI), vol. 3554, pp. 97–111. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

14. Dahl, V., Tarau, P.: Assumptive Logic Programming. In: Argentine Symposium on Artificial Intelligence (ASAI) 2004, Cordoba, Argentina, September 20-21 (2004)

    Google Scholar 

15. Dahl, V., Tarau, P., Li, R.: Assumption grammars for processing natural language. In: Naish, L. (ed.) Proc. Fourteenth International Conference on Logic Programming, pp. 256–270. MIT Press, Cambridge (1997)

    Google Scholar 

16. Duck, G.J., Stuckey, P.J., de la Banda, M.J.G., Holzbaur, C.: Compiling ask constraints. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

17. Frühwirth, T.W.: Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37(1–3), 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

18. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. The Journal of Logic Programming 44, 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

19. Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

20. Kakas, A.C., Van Nuffelen, B., Denecker, M.: A-System: Problem Solving through Abduction. In: Nebel, B. (ed.) IJCAI 2001: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pp. 591–596. Morgan-Kaufmann, San Francisco (2001)

    Google Scholar 

21. Pereira, F.C.N., 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(3-4), 165–176 (1980)

    MathSciNet  Google Scholar 

22. Poole, D., Mackworth, A., Goebel, R.: Computational Intelligence. Oxford University Press, Oxford (1988)

    Google Scholar 

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. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 233–253. Kluwer Academic, Dordrecht (1999)

    Google Scholar 

25. Tarau, P., Dahl, V., Fall, A.: Backtrackable State with Linear Affine Implication and Assumption Grammars. In: Jaffar, J., Yap, R. (eds.) ASIAN 1996. LNCS, vol. 1179, pp. 53–64. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references