Author:
Kepser Stephan,Schulz Klaus U.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. P. Aczel, “Non-well-founded Sets,” CSLI Lecture Notes 14, Stanford Univ., 1988.
2. H. Ait-Kaci, A. Podelski, and G. Smolka, “A feature-based constraint system for logic programming with entailment,” Theoretical Comp. Science 122, 1994, pp.263–283.
3. F. Baader and K.U. Schulz, “On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers,” in: Proceedings CP'95, U.Montanari, F.Rossi (Eds.), Springer LNCS 976, pp. 380–397.
4. F. Baader, J. Siekmann, “Unification Theory,” in D.M. Gabbay, C. Hogger, and J. Robinson, Editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1994, pp. 41–125.
5. R. Backofen and R. Treinen, “How to Win a Game with Features,” in Constraints in Computational Logics, Proc. CCL'94, J.-P. Jouannaud (Ed.), Springer LNCS 845, 1994, pp. 320–335.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combining Constraint Solving;Constraints in Computational Logics;2001