Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 4
Editorial: 29th International Conference on Logic Programming special issue
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 465-470
-
- Article
-
- You have access
- Export citation
- Cited by 4
Diagrammatic confluence for Constraint Handling Rules*
-
- Published online by Cambridge University Press:
- 05 September 2012, pp. 737-753
-
- Article
- Export citation
- Cited by 4
A new algorithm to automate inductive learning of default theories*
-
- Published online by Cambridge University Press:
- 23 August 2017, pp. 1010-1026
-
- Article
- Export citation
- Cited by 4
Termination prediction for general logic programs
-
- Published online by Cambridge University Press:
- 16 June 2009, pp. 751-780
-
- Article
- Export citation
- Cited by 4
A non-termination criterion for binary constraint logic programs
-
- Published online by Cambridge University Press:
- 18 February 2009, pp. 145-164
-
- Article
- Export citation
- Cited by 4
Tractable answer-set programming with weight constraints: bounded treewidth is not enough*
-
- Published online by Cambridge University Press:
- 17 July 2012, pp. 141-164
-
- Article
- Export citation
- Cited by 4
onlineSPARC: A Programming Environment for Answer Set Programming
-
- Published online by Cambridge University Press:
- 14 November 2018, pp. 262-289
-
- Article
- Export citation
- Cited by 4
Using Tabled Logic Programming to Solve the Petrobras Planning Problem
-
- Published online by Cambridge University Press:
- 21 July 2014, pp. 697-710
-
- Article
- Export citation
- Cited by 4
Simulating Dynamic Systems Using Linear Time Calculus Theories
-
- Published online by Cambridge University Press:
- 21 July 2014, pp. 477-492
-
- Article
- Export citation
- Cited by 4
A Comparative Study of Some Central Notions of ASPIC+ and DeLP
-
- Published online by Cambridge University Press:
- 10 October 2019, pp. 358-390
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 4
Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework
-
- Published online by Cambridge University Press:
- 04 March 2022, pp. 1029-1069
-
- Article
- Export citation
- Cited by 4
A Neuro-Symbolic ASP Pipeline for Visual Question Answering
-
- Published online by Cambridge University Press:
- 11 July 2022, pp. 739-754
-
- Article
- Export citation
- Cited by 4
Omission-Based Abstraction for Answer Set Programs
-
- Published online by Cambridge University Press:
- 09 June 2020, pp. 145-195
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 4
Three optimisations for sharing
-
- Published online by Cambridge University Press:
- 10 March 2003, pp. 243-257
-
- Article
- Export citation
- Cited by 4
Description, Implementation, and Evaluation of a Generic Design for Tabled CLP
-
- Published online by Cambridge University Press:
- 18 January 2019, pp. 412-448
-
- Article
- Export citation
- Cited by 4
Lightweight compilation of (C)LP to JavaScript*
-
- Published online by Cambridge University Press:
- 05 September 2012, pp. 755-773
-
- Article
- Export citation
- Cited by 4
Strong Equivalence of Logic Programs with Counting
-
- Published online by Cambridge University Press:
- 24 June 2022, pp. 573-588
-
- Article
- Export citation
- Cited by 4
On the interaction between sharing and linearity
-
- Published online by Cambridge University Press:
- 24 September 2009, pp. 49-112
-
- Article
- Export citation
- Cited by 4
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
-
- Published online by Cambridge University Press:
- 22 July 2022, pp. 523-537
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 4
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
-
- Published online by Cambridge University Press:
- 23 September 2021, pp. 629-645
-
- Article
-
- You have access
- Open access
- Export citation