Maximal unifiable subsets and minimal nonunifiable subsets-Reference-Cited by-同舟云学术

Maximal unifiable subsets and minimal nonunifiable subsets

Published:1986-06 Issue:2 Volume:4 Page:133-152
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:New Gener Comput

Author:

Chen T. Y.,Lassez J -L,Port G. S.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03037439.pdf

Reference10 articles.

1. Bruynooghe, M. and Pereira L. M., “Deduction Revision by Intelligent Backtracking,” inProlog Implementation (J. A. Campbell, ed.), pp. 194–215, 1984.

2. Chang, C. C. and Lee, D. C. T.,Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

3. Cox, P. T., “Finding Backtrack Points for Intelligent Backtracking,” inProlog Implementation (J. A. Campbell, ed.), pp. 216–233, 1984.

4. Jaffar, J., Lassez, J-L and Lloyd, J. W., “Completeness of the Negation as Failure Rule,”Proceedings of the International Joint Conference on Artificial Intelligence, pp. 500–506, 1983.

5. Kowalski, R. A.,Logic for Problem-Solving, North-Holland, 1981.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Source-tracking unification;Information and Computation;2005-09

2. Source-Tracking Unification;Automated Deduction – CADE-19;2003

3. A high-level Petri net for goal-directed semantics of Horn clause logic;IEEE Transactions on Knowledge and Data Engineering;1996-04

4. A brief overview of over-constrained systems;Over-Constrained Systems;1996

5. An improved data-dependency-based backtracking scheme for prolog;Information Processing Letters;1989-05