7 results
Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description)*
-
- Journal:
- Theory and Practice of Logic Programming / Volume 16 / Issue 5-6 / September 2016
- Published online by Cambridge University Press:
- 14 October 2016, pp. 688-702
-
- Article
- Export citation
Preface for special section from FLOPS 2014
-
- Journal:
- Journal of Functional Programming / Volume 26 / 2016
- Published online by Cambridge University Press:
- 22 July 2016, e14
-
- Article
-
- You have access
- Export citation
Compiling finite domain constraints to SAT with BEE*
-
- Journal:
- Theory and Practice of Logic Programming / Volume 12 / Issue 4-5 / July 2012
- Published online by Cambridge University Press:
- 05 September 2012, pp. 465-483
-
- Article
- Export citation
SAT-based termination analysis using monotonicity constraints over the integers
-
- Journal:
- Theory and Practice of Logic Programming / Volume 11 / Issue 4-5 / July 2011
- Published online by Cambridge University Press:
- 06 July 2011, pp. 503-520
-
- Article
- Export citation
Logic programming with satisfiability
-
- Journal:
- Theory and Practice of Logic Programming / Volume 8 / Issue 1 / January 2008
- Published online by Cambridge University Press:
- 01 January 2008, pp. 121-128
-
- Article
- Export citation
Inferring termination conditions for logic programs using backwards analysis
-
- Journal:
- Theory and Practice of Logic Programming / Volume 5 / Issue 1-2 / January 2005
- Published online by Cambridge University Press:
- 10 January 2005, pp. 75-91
-
- Article
- Export citation
Worst-case groundness analysis using definite Boolean functions
-
- Journal:
- Theory and Practice of Logic Programming / Volume 1 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 18 October 2001, pp. 611-615
-
- Article
- Export citation