Author:
Dixon Clare,Konev Boris,Fisher Michael,Nietiadi Sherly
Funder
EPSRC
Department of Computer Science at the University of Liverpool
Subject
Applied Mathematics,Logic
Reference58 articles.
1. The Tableaux Workbench;Abate,2003
2. O. Bailleux, Y. Boufkhad, Efficient CNF encoding of boolean cardinality constraints, in: Ninth International Conference on Principles and Practice of Constraint Programming (CP), in: LNCS, vol. 2833, pp. 108–122.
3. Up and down the temporal way;Barringer;The Computer Journal,1987
4. Deductive verification of simple foraging robotic behaviours;Behdenna;International Journal of Intelligent Computing and Cybernetics,2009
5. Two proof procedures for a cardinality based language in propositional calculus;Benhamou,1994
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献