ACLP: Abductive Constraint Logic Programming

Journal of Logic Programming

Volumn 44, Issue 1-3, 2000, Pages 129-177

  Kakas, A C ^a   Michael, A ^a   Mourlas, C ^a  

^a UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; PROBLEM SOLVING;

ABDUCTIVE CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVING; NONMONOTONIC REASONING;

LOGIC PROGRAMMING;

EID: 0034231028     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00075-8     Document Type: Article

References (59)

1. G. Brewka, J. Dix, K. Konolige, Nonmonotonic Reasoning: An Overview, CSLI publications, 1997.
2. M. Bruynooghe, H. Vandecasteele, D. AndredeWaal, M. Denecker, Detecting unsolvable queries for definite logic programs, in: Principles of Declarative Programming, Proceedings of the PLILP '98, LNCS 1490, Springer, Berlin, 1998, pp. 118-133.
3. L. Console, D. Theseider Dupre, P. Torasso, On the relationship between abduction and deduction, J. Logic Comput. 2 (5) (1991) 661-690.
4. L. Console, M.L. Sapino, D. Theseider Dupre, The role of abduction in database view updating, J. Intell. Syst. 1994.
5. L. Console, L. Portinale, D. Dupr, Using compiled knowledge to guide and focus abductive diagnosis, J. IEEE Trans. Knowledge and Data Engrg. 8 (1996) 690-706.
6. M. Denecker, D. De Schreye, SLDNFA: an abductive procedure for normal abductive programs, in: Proceedings of the International Conference Symposium on Logic Programming, 1992, pp. 686-700.
7. M. Denecker, D. De Schreye, SLDNFA: an abductive procedure for abductive logic programs, J. Logic Programming 34 (2) (1998) 111-167.
8. M. Denecker, H. Vandecasteele, D. De Schreye, G. Seghers, T. Bayens, Scheduling by Abductive Execution of a Classical Logic Specification. Technical Report, Department of Computer Science, K.U. Leuven, Belgium, 1997.
9. P.M. Dung, Negation as hypothesis: an abductive foundation for logic programming, in: Proceedings of Eighth International Conference on Logic Programming, MIT Press, Paris, 1991.
10. P.M. Dung, An argumentation theoretic foundation for logic programming, J. Logic Programming 22 (2) (1995) 151-177.
11. ECLiPSe User Manual ECRC, Munich, Germany, 1994.
12. A. El-Kholy, B. Richards, Temporal and resource reasoning in planning: the parcPLAN approach, in: Proceedings of ECAI-96, 1996.
13. K. Esghsi, Abductive planning with the event calculus, in: Proceedings of the Fifth International Conference on Logic Programming, 1998.
14. K. Eshghi, R.A. Kowalski, Abduction compared with negation by failure, in: Proceedings of the Sixth International Conference on Logic Programming, ICLP89, Lisbon, MIT Press, Cambridge, 1989.
15. T.F. Fung, R.A. Kowalski, The iff proof procedure for abdcutive logic programming, J. Logic Programming 33 (2) (1997) 151-165.
16. T. Frühwirth, Constraint Handling Rules, in: A. Podelski (Ed.), Constraint Programming: Basic and Trends, LNCS 910, Springer, Berlin, 1995.
17. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of Fifth International Conference on Logic Programming, 1988.
18. J. Jaffar, J.L. Lassez, Constraint Logic Programming. Technical Report, Department of Computer Science, Monash University, 1986.
19. J. Jaffar, J.L. Lassez, Constraint logic programming, in: Proceedings of 14th ACM Principles of Programming Languages Conference, POPL87, Munich, Germany, 1987.
20. J. Jaffar, J.L. Lassez, M.J. Maher, in: D. DeGroot, G. Lindstrom (Eds), A Logic Programming Language Scheme, Logic Programming: Relations Functions and Equations, Prentice-Hall, NJ, 1986.
21. J. Jaffar, M.J. Maher, Constraint logic programming: a survey, J. Logic Programming Special 10th Aniversary Issue 19/20 (1994).
22. J. Jaffar, M.J. Maher, Constraint Logic Programming: A Survey, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, 1998.
23. A.C. Kakas, R.A. Kowalski, F. Toni, The Role of Abduction in Logic Programming, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, Oxford University Press, Oxford, 1998, pp. 235-324.
24. A.C. Kakas, P. Mancarella, Generalized stable models: a semantics for abduction, in: Proceedings of Nineth European Conference on AI, ECAI90, Stockolm, 1990.
25. A.C. Kakas, P. Mancarella, Abductive logic programming, in: Proceedings of NACLP Workshop on Non-Monotonic Reasoning and Logic Programming, Austin, Texas, 1990.
26. A.C. Kakas, P. Mancarella, On the relation of truth maintenance and abduction, in: Proceedings of First Pacific Rim International Conference on Artificial Intelligence, PRICAI90, Nagoya, Japan, 1990.
27. A.C. Kakas, P. Mancarella, Database updates through abduction, in: Proceedings of 16th International Conference on Very Large Databases, VLDB'90, Brisbane, Australia, 1990.
28. A.C. Kakas, P. Mancarella, Preferred extensions are partial stable models, J. Logic Program. 14 (3,4) (1993) 341-348.
29. A.C. Kakas, P. Mancarella, Constructive Abduction in Logic Programming, Technical Report, Dipartimento di Informatica, Universit di Pisa, 1993.
30. A.C. Kakas, A. Michael, Integrating abductive and constraint logic programming, in: Proceedings of the 12th International Conference on Logic Programming, Tokyo, 1995.
31. A.C. Kakas, A. Michael, Timetabling in an integrated abductive and constraint logic programming framework, in: Proceedings of the First International Conference on the Practice and Theory of Automated Timetabling, ICPTAT-95, 167-177, Edingburgh, 1995.
32. A.C. Kakas, C. Mourlas, ACLP: Flexible solutions to complex problems, in: Proceedings of Logic Programming and Non-monotonic Reasoning, 1997.
33. K. Konolige, Closure+minimization implies abduction, in: Proceedings of PRICAI90, 1990.
34. R.A. Kowalski, Problem and promises of computational logic, in: Lloyd (Ed.), Proceedings of Symposium on Computational Logic, Lecture Notes in Computer Science, Springer, Berlin, 1990.
35. R.A. Kowalski, F. Sadri, Knowledge representation without integrity constraints, Technical Report, Department of Computing, Imperial College, London, 1988.
36. R.A. Kowalski, M. Sergot, A logic-based calculus of events, New Generation Comput. 4 (1986).
37. R.A. Kowalski, G. Wetzel, F. Toni, A Unifying Framework for ALP, CLP and SQO, Technical report, Department of Computing, Imperial College, London, 1996.
38. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
39. J.W. Lloyd, R.W. Topor, A basis for deductive database system, J. Logic Programming 2 (1985) 93-109.
40. M. Maher, A transformation system for deductive database modules with perfect model semantics, Theoretical Comput. Sci. 110 (1993) 377-403.
41. E. Maim, Abduction and constraint logic programming, in: Proceedings of ECAI92, Vienna, Austria, 1992.
42. T. Menzies, Applications of abduction: knowledge-level modeling, Int. J. Human Computer Studies, August, 1996.
43. A. Michael, Abductive logic programming and its application to scheduling, Ph.D. thesis, University of London, Submitted, 1998.
44. L. Missiaen, M. Bruynooghe, M. Denecker, CHICA A planning system based on the event calculus, J. Logic Comput. 5 (5) (1995) 579-602.
45. R. Reiter, On integrity constraints, in: Y. Vardi (Ed.), Proceedings of the Second Conference on Theoretical Aspects of Reasoning about Knowledge, Moshe, Pacific Grove, California, 1988.
46. D. Poole, R.G. Goebel, Aleliunas, Theorist: a logical reasoning system for default and diagnosis, in: McCalla (Eds.), The Knowledge Fronteer: Essays in the Representation of Knowledge, Cereone, Lecture Notes in Computer Science, Springer, Berlin, 1987.
47. T. Przymusinski, On the declarative and procedural semantics of logic programs, J. Automated Reasoning 5 (1989) 167-205.
48. D. Saccà, C. Zaniolo, Stable models and non determinism for logic programs with negation, in: Proceedings of the ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, 1990.
49. T. Sato, Completed logic programming and their consistency, J. Logic Programming 9 (1990) 33-44.
50. N. Sadeh, Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, 1991.
51. M.P. Shanahan, Prediction is deduction but explanation is abduction, in: Proceedings of IJCAI89, 1989.
52. M.P. Shanahan, Robotics and the common sense informatic situation, in: Proceedings of the 12th European Conference on Artificial Intelligence, Hungary, 1996.
53. M.P. Shanahan, Event Calculus Planning Revisited, in: Proceedings of the 1997 European Conference on Planning (ECP 97), 1997.
54. F. Teusink, Using SLDFA-resolution with abductive logic programs, ILPS93 Postconference Workshop on Logic Programming with Incomplete Information, 1993.
55. F. Teusink, Logic programming and non-monotonic reasoning, Ph.D. Thesis. Department of Computing, University of Amsterdam, 1996.
56. F. Toni, A theorem-proving approach to job-shop scheduling, Technical Report, Imperial College, 1994.
57. P. Van Hentenryck, Constraint satisfaction in logic programming, Logic Programming Series, MIT Press, Cambridge, 1989.
58. G. Wetzel, Scheduling in a new constraint logic programming framework, M.Sc. thesis, Imperial College, London, 1994.
59. G. Wetzel, Abductive and constraint logic programming, Ph.D. thesis, Imperial College, London, 1997.