B. Aït-kaci and H. , The WAM: A (real) tutorial, 1990.

J. F. Allen, Temporal Reasoning and Planning, Principles of Knowledge Representation and Reasoning: Proc. of the Second International Conference (KR'9l), pp.3-14, 1991.
DOI : 10.1016/B978-1-55860-137-6.50007-8

;. J. Allen and P. J. Hayes¡, A common-sense theory of time, Proc, of the 9 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.528-531, 1985.

J. F. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM, vol.26, issue.11, pp.832-843, 1983.
DOI : 10.1145/182.358434

J. F. Allen, Towards a general theory of action and time, Artificial Intelligence, vol.23, issue.2, pp.123-154, 1984.
DOI : 10.1016/0004-3702(84)90008-0

B. E. Ayeb, P. Marquis, and M. Rusinowitch, A new diagnosis approach by deduction and abduction, Expert Systems in Engineering: Principles and Applications: Proc. of the International Workshop, pp.32-46, 1990.
DOI : 10.1007/3-540-53104-1_29

F. Baader and J. Siekmann, Unification theory, Handbook of Logic in Artificial Intelligence and Logic Programming, 1993.
DOI : 10.1016/b978-044450813-3/50010-2

F. Bacchus, J. Tenenberg, and J. Koomen, A non-reified temporal logic, Artificial Intelligence, vol.52, issue.1, pp.87-108, 1991.
DOI : 10.1016/0004-3702(91)90025-F

H. Barringer, M. Fisher, D. Gabbay, and A. Hunter, Meta-reasonning in executable temporal logic, Principles of Knowledge Representation and Reasoning: Proc. of the Second International Conference (KR'91), pp.40-49, 1991.

P. Barth, CLP(VB): A meta-interpeter in CLP(ft) Research report MPI- 1-92-233, 1992.

C. Baykan and M. Fox, An investigation of opportunistic constraint satisfaction in space planning, Proc. of the 10 th Int. Joint Conference on Artificial Intelligence (IJCAI), 1987.

M. Borillo and B. Gaume, Une extension cognitive du calcul d'évènemts de Kowalski et Sergot et son application au raisonnement spatio-temporel. Revue d'intelligence artificielle, pp.7-26, 1990.

R. Brachman and H. Levesque, Readings in Knowledge Representation, 1985.

H. Bürckert, .4 Resolution Principle for a Logic with Restricted Quantifiers, Lecture Notes in Artificial Intelligence, vol.568, 1991.
DOI : 10.1007/3-540-55034-8

T. Bylander, D. Allemang, M. C. Tanner, and J. Josephson, The computational complexity of abduction, Artificial Intelligence, vol.49, issue.1-3, pp.25-60, 1991.
DOI : 10.1016/0004-3702(91)90005-5

O. Caprotti, Extending RISC-CLP(Real) to handle symbolic functions, DISCO '93: International Symposium on Design and Implementation of Symbolic Computation Systems, pp.241-255, 1993.
DOI : 10.1007/BFb0013181

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Cavedon and J. Lloyd, A completeness theorem for SLDNF resolution, The Journal of Logic Programming, vol.7, issue.3, pp.177-191, 1989.
DOI : 10.1016/0743-1066(89)90020-4

D. Chan, Constructive negation based on the completed database, Logic Programming: Proc. of the Sixth International Conference and Symposium, pp.111-125, 1988.

D. Chapman, Planning for conjunctive goals, Artificial Intelligence, vol.32, issue.3, pp.333-378, 1987.
DOI : 10.1016/0004-3702(87)90092-0

L. Chittaro, A. Montanari, and A. Provetti, Skeptical and credulous event calculi for supporting modal queries, Proc. of the 11 th EC AI, pp.361-365, 1994.

K. Clark, Negation as Failure, Logic and Databases, pp.293-322, 1978.
DOI : 10.1007/978-1-4684-3384-5_11

P. Cox and T. Pietrzykowsky, Causes for events: Their computation and applications, Proc. of the $ International Conference on Automated Deduction, pp.608-621, 1986.
DOI : 10.1007/3-540-16780-3_125

P. Cox and T. Pietrzykowsky, General diagnosis by abductive inference, Proc. of Symposium on Logic Programing, pp.183-189, 1987.

E. Davis, Constraint propagation with interval labels, Artificial Intelligence, vol.32, issue.3, pp.281-331, 1987.
DOI : 10.1016/0004-3702(87)90091-9

T. L. Dean and M. Boddy, Reasoning about partially ordered events, Artificial Intelligence, vol.36, issue.3, pp.375-399, 1988.
DOI : 10.1016/0004-3702(88)90087-2

T. L. Dean and D. V. Mcdermott, Temporal data base management, Artificial Intelligence, vol.32, issue.1, pp.1-55, 1987.
DOI : 10.1016/0004-3702(87)90061-0

R. Dechter and I. Meiri, Experimental evaluation of preprocessing techniques in constraint satisfaction problems, Proc. of the 11, 1989.

R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Artificial Intelligence, vol.49, issue.1-3, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6

R. Deitrich and F. Hagl, A polymorphic type system with subtypes for Prolog, Proc. of 2nd European Symposium on Programming (ESOP) of Lecture Notes in Computer Science, pp.79-93, 1988.
DOI : 10.1007/3-540-19027-9_6

M. Denecker and D. De-schreye, SLDNFA: an abductive procedure for normal abductive programs, Proc. of the Joint International Conference and Symposium on Logic Programming, pp.686-700, 1992.

D. Diaz and P. Codognet, A minimal extension of the warn for CLP(FD), 1993.

C. Dousson, P. Gaborit, and . Ghallab, Situation recognition, Proc. of the 13 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.166-172, 1993.

W. Dowling and J. Gallier, Linear-time algorithms for testing the satisfiability of propositional horn formulae, The Journal of Logic Programming, vol.1, issue.3, pp.267-284, 1984.
DOI : 10.1016/0743-1066(84)90014-1

J. Doyle, A truth maintenance system, Artificial Intelligence, vol.12, issue.3, pp.231-272, 1979.
DOI : 10.1016/0004-3702(79)90008-0

P. Enjalbert and L. F. Cerro, Modal resolution in clausal form, Theoretical Computer Science, vol.65, issue.1, pp.1-33, 1989.
DOI : 10.1016/0304-3975(89)90137-0

K. Eshghi and R. A. Kowalski, Abduction compared with negation by failure, Logic Programming: Proc. of the Sixth International Conference, pp.234-254, 1989.

K. Eshghi, Abductive planning with event calculus, Proc. of the 5 th Int. Conf. on Logic Programming, pp.562-579, 1988.

K. Eshghi, A tractable class of abduction problems, Proc. of the 13 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.3-8, 1993.

C. Evans, The Macro Event Calculus: Representing temporal granularity, 1990.

K. T. Fann, Peirce's Theory of Abduction. Nijhoff. The Hague, 1970.

M. Fisher, A resolution method for temporal logic, Proc. of the 12 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.99-104, 1991.

C. Freksa, Temporal reasoning based on semi-intervals, Artificial Intelligence, vol.54, issue.1-2, pp.199-227, 1992.
DOI : 10.1016/0004-3702(92)90090-K

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Fusaoka, H. Seki, and K. Takahashi, A description and reasoning of plant controllers in temporal logic, Proc. of the 8 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.405-408, 1983.

A. Galton, A critical examination of Allen's theory of action and time, Artificial Intelligence, vol.42, issue.2-3, pp.159-188, 1990.
DOI : 10.1016/0004-3702(90)90053-3

A. Galton, A critique of Yoav Shoham's theory of causal reasoning, Proc. ofAAAI-91, pp.355-359, 1991.

A. Galton, Reified temporal theories and how to unreify them, Proc. of the 12 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.1177-1182, 1991.

M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, Proc. ofICLP'88, pp.1070-1080, 1988.

A. Gerevini and L. Schubert, Efficient temporal reasoning through timegraphs, Proc. of the 13, 1993.

A. Gerevini and L. Schubert, ON COMPUTING THE MINIMAL LABELS IN TIME POINT ALGEBRA NETWORKS, Computational Intelligence, vol.6, issue.3, 1994.
DOI : 10.1016/0020-0255(74)90008-5

M. Ghallab and A. Mounir-alaoui, Managing efficiently temporal relations through indexed spanning trees, Proc. of the 11 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.1297-1303, 1989.

T. Granier, Contribution à l'étude du temps objectif dans le raisonnement, 1988.

E. Groß, J. Hertzberg, S. Materne, and H. &¿-von, On clipping persistence (or whatever must be clipped) in time maps, ERCIM Workshop on Theoretical and Experimental Aspects of Knowledge Representation, pp.139-148, 1992.

J. Halpern and Y. Shoham, A prepositional modal logic of time intervals, 1986.

S. Hanks and D. V. Mcdermott, Nonmonotonic logic and temporal projection, Artificial Intelligence, vol.33, issue.3, pp.379-412, 1987.
DOI : 10.1016/0004-3702(87)90043-9

C. Hansson, A prototype system for logical reasoning about time and action, thesis, 1990.

C. Hartshorne and P. Weiss, Collected Papers of Charles Sanders Peirce, 1958.

. B. Haugh, Non-standard semantics for the method of temporal arguments, Proc. of the 10 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.449-455, 1987.

B. A. Haugh, Simple causal minimizations for temporal persistence and projection, Proc. of AAAI-87, pp.218-223, 1987.

J. Hertzberg, Theoretical planning and its contributions to practical and applied planning, Proc. of the 11 th ECAI, pp.811-812, 1994.

M. Höhfeld and G. Smolka, Definite relations over constraint languages, Liîog report 53, IBM Deutschland, 1988.

J. Hsiang, Rewrite method for theorem proving in first order theory with equality, Journal of Symbolic Computation, vol.3, issue.1-2, pp.133-151, 1987.
DOI : 10.1016/S0747-7171(87)80024-X

J. Jaffar and J. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.111-119, 1987.
DOI : 10.1145/41625.41635

J. Jaffar and M. J. Maher, Constraint logic programming: a survey, The Journal of Logic Programming, vol.19, issue.20, 1994.
DOI : 10.1016/0743-1066(94)90033-7

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap, An abstract machine for CLP(TZ), Proceedings ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), pp.128-139, 1992.

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap, The CLP(R ) language and system, ACM Transactions on Programming Languages and Systems, vol.14, issue.3, pp.339-395, 1992.
DOI : 10.1145/129393.129398

A. C. Kakas, R. Kowalski, and F. Toni, Abductive Logic Programming, Journal of Logic and Computation, vol.2, issue.6, pp.719-770, 1992.
DOI : 10.1093/logcom/2.6.719

A. C. Kakas and P. Mancarella, Database updates through abduction, Proc. of the lb* Conference on Very Large Databases, 1990.

A. C. Kakas and P. Mancarella, Generalized stable models: A semantics for abduction, Proc. of the 9 th ECAI, pp.385-391, 1990.

A. C. Kakas and P. Mancarella, On the relation between truth maintenance and abduction, Proc. of PRICAF90, pp.438-443, 1990.

A. C. Kakas and P. Mancarella, Constructive abduction in logic programming, 1993.

H. A. Kautz, The logic of persistence, Proc. of AAAI-86, p.401, 1986.

H. A. Kautz and P. B. <fc-ladkin, Integrating metric and qualitative temporal reasoning, Proc. of AAAI-91, pp.241-246, 1991.

J. Koomen, The TIMELOGIC temporal reasoning system, 1989.

M. Koubarakis, Dense time and temporal constraints with ^, Principles of Knowledge Representation and Reasoning: Proc. of the Third International Conference (KR '92), pp.24-35, 1992.

R. Kowalski and M. Sergot, A logic-based calculus of events, New Generation Computing, vol.10, issue.No. 2, pp.67-95, 1986.
DOI : 10.1007/BF03037383

B. Kuipers, Abstraction by Time-Scale in Qualitative Simulation, Proc. of AAAI-87, pp.621-625, 1987.
DOI : 10.1016/B978-1-4832-1447-4.50051-1

K. Kunen, Signed data dependencies in logic programs, The Journal of Logic Programming, vol.7, issue.3, pp.231-246, 1989.
DOI : 10.1016/0743-1066(89)90022-8

URL : http://doi.org/10.1016/0743-1066(89)90022-8

T. Lakshman and U. S. Sz-reddy, Typed prolog: A semantic reconstruction of the mycroft-o'keefe type system, Also in Proc. of ILPS'91, 1991.

A. L. Lansky, A REPRESENTATION OF PARALLEL ACTIVITY BASED ON EVENTS, STRUCTURE, AND CAUSALITY, Reasoning about actions and plans: proceedings of the 1986 Workshop, pp.123-159, 1986.
DOI : 10.1016/B978-0-934613-30-9.50009-3

A. L. Lansky, Localized event-based reasoning for multiagent domain, Computational Intelligence, vol.4, issue.1, pp.319-340, 1988.
DOI : 10.1016/0004-3702(84)90053-5

A. L. Lansky, Localized search for controlling automated reasoning, Proc. of the 1990 DARPA Planning Workshop, pp.115-125, 1990.

J. Lassez and K. Mcaloon, Independence of negative constraints, TAPSOFT'89, 1989.
DOI : 10.1007/3-540-50939-9_122

J. Lassez and K. Mcaloon, A canonical form for generalized linear constraints, Journal of Symbolic Computation, vol.13, issue.1, pp.1-24, 1992.
DOI : 10.1016/0747-7171(92)90002-L

G. Ligozat, Weak representations of interval algebras, Proc. of AAAI-90, pp.715-720, 1990.

G. Ligozat, Towards a general characterization of conceptual neighborhoods in temporal and spatial reasoning, Proc. of the AAAI-94 Workshop on Spatial and Temporal Reasoning, pp.55-59, 1994.
URL : https://hal.archives-ouvertes.fr/hal-01424752

J. Lloyd, Foundations of Logic Programming, 1987.

R. Loganantharaj, D. Mitra, and S. Giambrone, An efficient algorithm for incremental temporal constraint propagation, Proc. of the Seventh Florida Artificial Intelligence Research Symposium, pp.342-346, 1994.

D. Mackinson, Logique modale: Quelques jalons essentiels, Modèles logiques et systèmes d'Intelligence Artificielle, 1990.

A. K. Mackworth and E. C. &¿-freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, vol.25, issue.1, pp.65-74, 1985.
DOI : 10.1016/0004-3702(85)90041-4

Z. Manna and A. &z-pnuelli, Verification of concurrent programs.) part 1: The temporal framework, 1981.

P. Marquis, Extending abduction from propositional to first-order logic, Fundamentals of Artificial Intelligence Research: International Workshop FAIR'91 Proc, pp.141-155, 1991.
DOI : 10.1007/3-540-54507-7_12

P. Marquis, Contribution à l'étude des méthodes de construction d'hypothèses en intelligence artificielle, 1991.

W. W. Mccune, OTTER 2.0 users guide, 1990.

D. V. Mcdermott, A Temporal Logic for Reasoning about Processes and Plans*, Cognitive Science, vol.41, issue.1, 2, pp.101-155, 1982.
DOI : 10.1207/s15516709cog0602_1

I. Meiri, Combining qualitative and quantitative constraints in temporal reasoning, Proc. of AAAI-91, pp.260-267, 1991.
DOI : 10.1016/0004-3702(95)00109-3

L. Missiaen and K. U. Leuven, Localized Abductive Planning with the Event Calculus, 1991.

L. Missiaen, M. Bruynooghe, and M. Denecker, CHICA, an abductive planning system based on event calculus. Draft, 1993.

R. Mohr and T. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4

URL : https://hal.archives-ouvertes.fr/inria-00548487

U. Montarían, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

P. H. Morris, The anomalous extension problem in default reasoning, Artificial Intelligence, vol.35, issue.3, pp.383-399, 1988.
DOI : 10.1016/0004-3702(88)90022-7

A. Mounir-alaoui, Raisonnement temporel pour la planification et la reconnaissance de situations, 1990.

A. Mycroft and R. Keefe, A polymorphic type system for prolog, Artificial Intelligence, vol.23, issue.3, pp.295-307, 1984.
DOI : 10.1016/0004-3702(84)90017-1

B. Nebel and C. Sz-bäckström, On the computational complexity of temporal projection and some related problems, German Center for Artificial Intelligence, 1991.

B. Nebel and H. Bürckert, Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra, Journal of the ACM, vol.42, issue.1, 1993.
DOI : 10.1145/200836.200848

F. Nef, Quelques systèmes de logique temporelle propositionnelle, Modèles logiques et systèmes d'Intelligence Artificielle . Hermès, 1990.

H. Ohlbach, A resolution calculus for modal logics, Lecture Notes in Computer Science, vol.310, pp.500-516, 1988.
DOI : 10.1007/BFb0012852

S. E. Panitz, Default reasoning with a constrained resolution principle, 1993.

G. Paul, Approaches to abductive reasoning: an overview, Artificial Intelligence Review, vol.13, issue.2, pp.109-152, 1993.
DOI : 10.1007/BF00849080

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Poole, A logical framework for default reasoning, Artificial Intelligence, vol.36, issue.1, pp.27-47, 1988.
DOI : 10.1016/0004-3702(88)90077-X

H. E. Pople, On the mechanization of abductive logic, Proc. of the 3 rd Int. Joint Conference on Artificial Intelligence (IJCAI), pp.147-151, 1973.

T. C. Przymusinski, On constructive negation in logic programming, Proc. of The North American Conf. On Logic Programming Cleveland, 1989.

T. C. Przymusinski, On the declarative and procedural semantics of logic programs, Journal of Automated Reasoning, vol.5, issue.2, pp.167-205, 1989.
DOI : 10.1007/BF00243002

S. Reeves, Semantic tableaux as a framework for automated theoremproving, Advances in Artifical Intelligence, 1987.

H. Reichgelt, A comparison of first-order and modal logic of time, Logic-based Knowledge Representation, pp.143-176, 1989.

R. Reiter, On closed world data bases, Logic and Data Bases, pp.55-76, 1978.

R. Reiter, A logic for default reasoning, Artificial Intelligence, vol.13, issue.1-2, pp.81-132, 1980.
DOI : 10.1016/0004-3702(80)90014-4

C. Ribeiro and A. Porto, Maximal intervals: An approach to temporal reasoning, Proc. of EPIA '91, pp.180-194, 1991.
DOI : 10.1007/3-540-54535-2_33

F. Sadri and R. A. Kowalski, A Theorem-Proving Approach to Database Integrity, Foundations of Deductive Databases and Logic Programming, 1988.
DOI : 10.1016/B978-0-934613-40-8.50013-0

E. Sandewall, Non-monotonic entailment for reasoning about time and action Part I : Sequential actions, 1988.

E. Sandewall, Non-monotonic entailment for reasoning about time and action Part II : Concurrent actions, 1988.

E. Sandewall, Non-monotonic entailment for reasoning about time and action Part III : Decision procedure, 1988.

K. Satoh and N. Iwayama, Computing abduction by using the TMS, Logic Programming: Proc. of the Eighth International Conference, pp.505-518, 1991.

K. Satoh and N. Iwayama, A query evaluation method for abductive logic programming, Proc. of the Joint International Conference and Symposium on Logic Programming, pp.671-685, 1992.

B. Selman and H. J. Levesque, Abductive and default reasoning: A computational core, Proc. of AAAI-90, pp.343-348, 1990.

M. Shanahan, Prediction is deduction but explanation is abduction, Proc. of the 11 th Int. Joint Conference on Artificial Intelligence (DCAI), pp.1055-1060, 1989.

M. Shanahan, Representing continuous change in the Event Calculus, Tech. rep., Imperial College, Dept. of Computing, Logic Programming Group, 1989.

M. Shanahan, Representing continuous change in the Event Calculus, Proc. of the 9 th EC AI, 1990.

Y. Shoham, Temporal logics in AI: Semantical and ontological considerations, Artificial Intelligence, vol.33, issue.1, pp.89-104, 1987.
DOI : 10.1016/0004-3702(87)90052-X

Y. Shoham, Chronological ignorance: Experiments in nonmonotonic temporal reasoning, Artificial Intelligence, vol.36, issue.3, pp.279-331, 1988.
DOI : 10.1016/0004-3702(88)90085-9

Y. Shoham, Nonmonotonic Reasoning and Causation, Cognitive Science, vol.11, issue.2, pp.213-252, 1990.
DOI : 10.1207/s15516709cog1402_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. E. Stickel, Rationale and methods for abductive reasoning in naturallanguage interpretation, Natural Language and Logic: Proc. of the International Scientific Symposium, pp.233-252, 1990.

M. E. Stickel, Automated deduction by theory resolution, Journal of Automated Reasoning, vol.1, issue.4, pp.333-355, 1985.
DOI : 10.1007/BF00244275

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

. P. Stuckey, Constructive negation for contraint logic programming, Proc. of LICS, Logic in Computer Science, pp.328-339, 1991.

P. J. Stuckey, Incremental Linear Constraint Solving and Detection of Implicit Equalities, ORSA Journal on Computing, vol.3, issue.4, pp.269-274, 1991.
DOI : 10.1287/ijoc.3.4.269

G. J. Sussman, A Computer Model of Skill Acquisition, 1975.

T. Swift and D. S. Warren, An abstract machine for SLG resolution, 1994.

P. Van-b^ek, Reasoning about qualitative temporal information, Proc. of AAAI-90, pp.728-734, 1990.
DOI : 10.1016/0004-3702(92)90011-L

P. Van-beek, Approximation algorithms for temporal reasoning, Proc. of the 11 th Int. Joint Conference on Artificial Intelligence (IJCAI), pp.1291-1296, 1989.

G. Venkatesh, A decision method for temporal logic based on resolution, Lecture Notes in Computer Science, vol.206, pp.272-289, 1986.
DOI : 10.1007/3-540-16042-6_15

L. Vila, A survey on temporal reasoning in artificial intelligence, pp.4-28, 1994.

M. Vilain and H. Kautz, Constraint propagation algorithms for temporal reasoning, Proc. of AAAI-86, pp.377-382, 1986.

D. H. Warren, An abstract prolog instruction set. Technical note 309, SRI International, 1983.

P. Wolper, The Tableau method for temporal logic: an overview. Logique et Analyse, pp.110-111, 1985.

L. Wos and G. A. Robinson, Paramodulation and set of support, Symposium on Automatic Demonstration, pp.276-310, 1970.
DOI : 10.1145/321296.321302

E. Yampratoom and J. F. Allen, Performance of temporal reasoning systems. TRAINS technical note 93-1, 1993.