On the implementation of Global Abduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4371 LNAI, Issue , 2007, Pages 226-245

  Christiansen, Henning ^a  

^a ROSKILDE UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA ACQUISITION; FORMAL LOGIC; METADATA; MOBILE AGENTS; SEMANTICS;

AGENT ORIENTED PROGRAMMING; CONSTRAINT HANDLING RULES (CHR); GLOBAL ABDUCTION (GA); META-PROGRAMMING LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

EID: 38149094112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69619-3_13     Document Type: Conference Paper

References (28)

1. Slim Abdennadher and Henning Christiansen. An experimental CLP platform for integrity constraints and abduction. In Proceedings of FQAS2000, Flexible Query Answering Systems: Advances in Soft Computing series, pages 141-152. PhysicaVerlag (Springer), 2000.
2. Slim Abdennadher and Heribert Schütz. Chr̂: A flexible query language. In Troeis Andreasen, Henning Christiansen, and Henrik Legind Larsen, editors, FQAS, volume 1495 of Lecture Notes in Computer Science, pages 1-14. Springer, 1998.
3. Marco Alberti, Federico Chesani, Marco Gavanelli, and Evelina Lamma. The CHR-based implementation of a system for generation and confirmation of hypotheses. In Armin Wolf, Thom W. Frühwirth, and Marc Meister, editors, W(C)LP, volume 2005-01 of Ulmer Informatik-Berichte, pages 111-122. Universität Ulm, Germany, 2005.
4. Hariolf Betz and Thom W. Frühwirth. A linear-logic semantics for constraint handling rules. In Peter van Beek, editor, CP, volume 3709 of Lecture Notes in Computer Science, pages 137-151. Springer, 2005.
5. Henning Christiansen. Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming, 37(1-3):213-254, 1998.
6. Henning Christiansen. Abductive language interpretation as bottom-up deduction. In Shuly Wintner, editor, Natural Language Understanding and Logic Programming, volume 92 of Datalogiske Skrifter, pages 33-47, Roskilde, Denmark, July 28 2002.
7. Henning Christiansen. CHR Grammars. Int'l Journal on Theory and Practice of Logic Programming, 5(4-5) :467-501, 2005.
8. Henning Christiansen and Veronica Dahl. Assumptions and abduction in Prolog. In Elvira Albert, Michael Hanus, Petra Hofstedt, and Peter Van Roy, editors, 3rd International Workshop on Multiparadigm Constraint Programming Languages, MuItiCPL'04; At the 20th International Conference on Logic Programming, ICLP'04 Saint-Malo, France, 6-10 September, 2004, pages 87-101, 2004.
9. Henning Christiansen and Verónica Dahl. HYPROLOG: A new logic programming language with assumptions and abduction. In Maurizio Gabbrielli and Gopal Gupta, editors, ICLP, volume 3668 of Lecture Notes in Computer Science, pages 159-173. Springer, 2005.
10. Henning Christiansen and Davide Martinenghi. Symbolic constraints for meta-logic programming. Applied Artificial Intelligence, 14(4):345-367, 2000.
11. Stefania Costantini and Arianna Tocchio. A logic programming language for multiagent systems. In Sergio Flesca, Sergio Greco, Nicola Leone, and Giovambattista Ianni, editors, JELIA, volume 2424 of Lecture Notes in Computer Science, pages 1-13. Springer, 2002.
12. Verónica Dahl, Paul Tarau, and Renwei Li. Assumption grammars for processing natural language. In ICLP, pages 256-270, 1997.
13. Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, and Christian Holzbaur. The refined operational semantics of Constraint Handling Rules. In Bart Demoen and Vladimir Lifschitz, editors, Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, volume 3132 of Lecture Notes in Computer Science, pages 90-104. Springer, 2004.
14. Melvin Fitting. A deterministic prolog fixpoint semantics. J. Log. Program., 2(2):111-118, 1985.
15. Thom Frühwirth. Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming, 37(1-3) :95-138, October 1998.
16. Thom W. Frühwirth and Christian Holzbaur. Source-to-source transformation for a class of expressive rules. In Francesco Buccafurri, editor, APPIA-GULP-PRODE, pages 386-397, 2003.
17. Hisashi Hayashi. Computing with Changing Logic programs. PhD thesis, Imperial College of Science, Technology and Medicine, University of London, 2001.
18. Katsumi Inoue and Koji Iwanuma. Speculative computation through consequencefinding in multi-agent environments. Ann. Math. Artif. Intell., 42(1-3):255-291, 2004.
19. A.C. Kakas, R.A. Kowalski, and F. Toni. 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, pages 235-324, 1998.
20. João Leite and Luís Soares. Enhancing a multi-agent system with evolving logic programs. In Katsumi Inoue, Ken Satoh, and Francesca Toni, editors, Seventh Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VII), 2006. To appear.
21. Teodor C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundam. Inform., 13(4):445-463, 1990.
22. Ken Satoh. "All's well that ends well" - a proposal of global abduction. In James P. Delgrande and Torsten Schaub, editors, NMR, pages 360-367, 2004.
23. Ken Satoh. An application of global abduction to an information agent which modifies a plan upon failure - preliminary report. In João Alexandre Leite and Paolo Torroni, editors, CLIMA V, volume 3487 of Lecture Notes in Computer Science, pages 213-229. Springer, 2004.
24. Ken Satoh, Katsumi Inoue, Koji Iwanuma, and Chiaki Sakama. Speculative computation by abduction under incomplete communication environments. In ICMAS, pages 263-270. IEEE Computer Society, 2000.
25. Ken Satoh and Keiji Yamamoto. Speculative computation with multi-agent belief revision. In AAMAS, pages 897-904. ACM, 2002.
26. Christian Seitz, Bernhard Bauer, and Michael Berger. Multi agent systems using Constraint Handling Rules for problem solving. In Hamid R. Arabnia and Youngsong Mun, editors, IC-AI, pages 295-301. CSREA Press, 2002.
27. Swedish Institute of Computer Science. SICStus Prolog user's manual, Version 3.12. Most recent version available at http://wvw.sics.se/isl, 2006.
28. Paul Tarau, Verónica Dahl, and Andrew Fall. Backtrackable state with linear assumptions, continuations and hidden accumulator grammars. In John W. Lloyd, editor, Logic Programming, Proceedings of the 1995 International Symposium, page 642. MIT Press, 1995.