Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference32 articles.
1. On the logic of theory change: partial meet contraction and revision functions;Alchourrón;J. Symbolic Logic,1985
2. L. Bachmair, H. Ganzinger, Resolution theorem proving, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, Elsevier Science Publishers B.V., Amsterdam, 1999.
3. S. Basu, Uniform Quantifier Elimination and Constraint Query Processing, Proceedings of ISSAC, ACM Press, New York, 1997, pp. 21–27.
4. New results on quantifier elimination over real closed fields and applications to constraint databases;Basu;J. ACM,1999
5. M. Benedikt, L. Libkin, On the structure of queries in constraint query languages, Proceedings of IEEE Symposium on Logic in Computer Science, 1996, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 25–34.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献