, Specification and verification of agent interaction using social integrity contraints, ENTCS, vol.85, issue.2, pp.150-177, 2003.
, Prolog and infinite trees, Logic Programming, pp.231-251, 1982.
, Prolog, Theoretical Basis and Current Developments, TSI, vol.2, issue.4, pp.271-311, 1983.
, Equations and inequations on finite and infinite trees, Proceeding of the International conference on the fifth generation of computer systems, pp.85-99, 1984.
, An introduction to Prolog III, Communication of the ACM, vol.33, issue.7, pp.68-90, 1990.
DOI : 10.1007/978-3-642-76274-1_2
, Expressiveness of full first-order formulas in the algebra of finite or infinite trees, Constraints, vol.8, issue.3, pp.283-302, 2003.
DOI : 10.1023/A:1025675127871
, Disunification : a survey, Computational Logic : Essays in Honor of Alan Robinson, 1991.
, Resolution de contraintes du premier ordre dans la theorie des arbres finis ou infinis, These d'informatique, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00144920
, Decomposable theories Journal of Theory and practice of logic programming TPLP, 2006.
, Theory of finite or infintie trees revisited Journal of Theory and practice of logic programming TPLP. (` a para??trepara??tre) Disponible en lignèlignè a l'adresse suivante http The Refined Operational Semantics of Constraint Handling Rules, Proc of the 20th International Conference on Logic Programming, pp.105-119, 2004.
, Autonomous robot navigation using human spatial concepts. International journal of intelligent systems, pp.165-196, 2000.
DOI : 10.1002/(sici)1098-111x(200003)15:3<165::aid-int3>3.0.co;2-x
, Theory and Practice of Constraint Handling Rules. Special Issue on Constraint Logic Programming, Journal of Logic Programming, vol.37, pp.1-3, 1998.
, The Munich Rent Advisor: A success for logic programming on then Internet, Theory and Practice of Logic Programming, vol.1, issue.03, pp.303-319, 2001.
DOI : 10.1017/S1471068401001181
, Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis, proc of the 21st International Conference of Logic Programming, pp.113-127, 2005.
DOI : 10.1007/11562931_11
, Context interchange: new features and formalisms for the intelligent integration of information, ACM Transactions on Information Systems, vol.17, issue.3, pp.270-293, 1999.
DOI : 10.1145/314516.314520
, Complete axiomatizations of the algebras of finite, rational and infinite trees, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, 1988.
DOI : 10.1109/LICS.1988.5132
, Complexity of CHR solveur for existentially quantified conjunctions of equations over trees, Recent Advances in Constraints. LNAI
, Classical search strategies for test case generation with CLP. In proceedings of formal approaches to testing of software, pp.47-60, 2001.
, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.
DOI : 10.1145/321250.321253
, Prolog : Manuel de Reference et d'Utilisation, Groupe d'Intelligence Artificielle, 1975.
, FLUX: A logic programming method for reasoning agents, Theory and Practice of Logic Programming, vol.5, issue.4-5, pp.4-5, 2005.
DOI : 10.1017/S1471068405002358
, Constraint Handling Rules with Negations as Absence, Proc of the third Workshop on Constraint Handling Rules, 2006.
, Automatic Implication Checking for CHR Constraints, Proc of the 6th International Workshop on Rule-Based Programming . ENTC, pp.93-111, 2006.
DOI : 10.1016/j.entcs.2005.06.039
URL : http://doi.org/10.1016/j.entcs.2005.06.039
, An improved lower bound for the elementary theories of trees, Proceeding of the 13th Conference on Automated Deduction. LNAI, pp.275-287
DOI : 10.1007/3-540-61511-3_91