Front Cover (OFC, IFC) and matter
TLP volume 15 issue 6 Cover and Front matter
-
- Published online by Cambridge University Press:
- 29 September 2015, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Regular Papers
Lower complexity bounds for lifted inference
-
- Published online by Cambridge University Press:
- 22 May 2014, pp. 246-263
-
- Article
-
- You have access
- Export citation
aspeed: Solver scheduling via answer set programming1
-
- Published online by Cambridge University Press:
- 17 February 2014, pp. 117-142
-
- Article
- Export citation
Knowledge compilation of logic programs using approximation fixpoint theory
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 464-480
-
- Article
- Export citation
A logic programming approach to predict effective compiler settings for embedded software
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 481-494
-
- Article
- Export citation
Back Cover (IBC, OBC) and matter
TLP volume 15 issue 6 Cover and Back matter
-
- Published online by Cambridge University Press:
- 29 September 2015, pp. b1-b2
-
- Article
-
- You have access
- Export citation
Book Review
A Gentle Guide to Constraint Logic Programming via ECLiPSe by Antoni Niederliński , xiii + 509 pages, published by Jacek Skalmierski Computer Studio, Third Edition, 2014.
-
- Published online by Cambridge University Press:
- 29 October 2014, pp. 143-144
-
- Article
- Export citation
Regular Papers
Dual-normal logic programs – the forgotten class
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 495-510
-
- Article
- Export citation
Learning weak constraints in answer set programming
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 511-525
-
- Article
- Export citation
Horn clauses as an intermediate representation for program analysis and transformation*
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 526-542
-
- Article
-
- You have access
- Export citation
Planning as tabled logic programming
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 543-558
-
- Article
- Export citation
Rewriting recursive aggregates in answer set programming: back to monotonicity
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 559-573
-
- Article
- Export citation
Complexity and compilation of GZ-aggregates in answer set programming
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 574-587
-
- Article
- Export citation
Fuzzy answer set computation via satisfiability modulo theories
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 588-603
-
- Article
- Export citation
Optimizing phylogenetic supertrees using answer set programming
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 604-619
-
- Article
- Export citation
A denotational semantics for equilibrium logic*
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 620-634
-
- Article
- Export citation
Proving correctness of imperative programs by linearizing constrained Horn clauses
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 635-650
-
- Article
- Export citation
Adding partial functions to Constraint Logic Programming with sets
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 651-665
-
- Article
- Export citation
An infinitary encoding of temporal equilibrium logic*
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 666-680
-
- Article
- Export citation
Semantics of templates in a compositional framework for building logics
-
- Published online by Cambridge University Press:
- 03 September 2015, pp. 681-695
-
- Article
- Export citation