A-system: Declarative programming with abduction

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

Volumn 2173 LNAI, Issue , 2001, Pages 393-397

  Van Nuffelen, Bert ^a   Kakas, Antonis ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 20144375672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_29     Document Type: Conference Paper

References (6)

1. Marc Denecker and Danny De Schreye. SLDNFA: an abductive procedure for normal abductive programs. J. Logic Programming, 34(2):111-167, 1998.
2. A. C. Kakas and C. Mourlas. ACLP: Flexible solutions to complex problems. In Proceedings of LPNMR-97, pages 387-398, 1997.
3. A. C. Kakas, A. Michael, and C. Mourlas. ACLP: Abductive constraint logic programming. Journal of Logic Program ming, 44(1-3):129-177, July, August 2000.
4. A.C Kakas, Bert Van Nuffelen, and Marc Denecker. A-system: Problem solving through abduction. In Proceedings of IJCAI'01, 2001. to appear.
5. Nikolay Pelov, Emmanuel De Mot, and Maurice Bruynooghe. A comparison of logic programming approaches for representation and solving of constraint satisfaction problems. In Proceedings of NMR' 2000, pages 1-15, 2000.
6. Bert Van Nuffelen and Marc Denecker. Problem solving in ID-logic with aggregates. In Proceedings of NMR'2000, special track on Abductive Reasoning, pages 1-9, 2000.