Elimination of negation in term algebras-Reference-Cited by-同舟云学术

Elimination of negation in term algebras

Published:1991 Issue: Volume: Page:1-16
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1991
language:
Short-container-title:

Author:

Lassez J-L.,Maher M.,Marriott K.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54345-7_44.pdf

Reference43 articles.

1. D. Chan, Constructive Negation based on Completed Database, Proc. 5th Symposium on Logic Programming, 111–125, 1988.

2. D. Chan, An Extension of Constructive Negation and its Application in Coroutining, Proc. North American Conf. on Logic Programming, Cleveland, 477–493, 1989.

3. H. Comon, Sufficient Completeness, Term Rewriting Systems and Anti-Unification. Proc. 8th Conference on Automated Deduction (J. Siekmann, Ed.), Lecture Notes in Computer Science Vol. 230, Springer-Verlag, 128–140, 1986.

4. H. Comon, An Effective Method for Handling Initial Algebras. Proc. 1st International Workshop on Algebraic and Logic Programming, Lecture Notes in Computer Science Vol. 343, Springer-Verlag, 108–118, 1988.

5. H. Comon, Disunification: A Survey, in: Computational Logic, J-L. Lassez & G. Plotkin (Eds.), MIT Press, 1991.

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

1. Equational formulas and pattern operations in initial order-sorted algebras;Formal Aspects of Computing;2017-05

2. Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras;Logic-Based Program Synthesis and Transformation;2015

3. Finite Models in FOL-Based Crypto-Protocol Verification;Foundations and Applications of Security Analysis;2009

4. Implementing Constructive Intensional Negation;New Generation Computing;2008-11

5. On deciding subsumption problems;Annals of Mathematics and Artificial Intelligence;2004-12-31