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 1
A Brief History of Updates of Answer-Set Programs
-
- Published online by Cambridge University Press:
- 22 March 2022, pp. 57-110
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
Schedulers and redundancy for a class of constraint propagation rules
-
- Published online by Cambridge University Press:
- 01 July 2005, pp. 441-465
-
- Article
- Export citation
- Cited by 1
Abstract Solvers for Computing Cautious Consequences of ASP programs
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 740-756
-
- Article
- Export citation
- Cited by 1
Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
-
- Published online by Cambridge University Press:
- 18 March 2022, pp. 335-366
-
- Article
- Export citation
- Cited by 1
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
-
- Published online by Cambridge University Press:
- 01 July 2022, pp. 708-722
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
Solving distributed constraint optimization problems using logic programming*†
-
- Published online by Cambridge University Press:
- 27 June 2017, pp. 634-683
-
- Article
- Export citation
- Cited by 1
Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog
-
- Published online by Cambridge University Press:
- 05 November 2021, pp. 680-697
-
- Article
- Export citation
- Cited by 1
ValAsp: A Tool for Data Validation in Answer Set Programming
-
- Published online by Cambridge University Press:
- 14 March 2022, pp. 965-985
-
- Article
- Export citation
- Cited by 1
Parallel backtracking with answer memoing for independent and-parallelism
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 555-574
-
- Article
- Export citation
- Cited by 1
ALPprolog – A new logic programming method for dynamic domains
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 451-468
-
- Article
- Export citation
- Cited by 1
Estimating the overlap between dependent computations for automatic parallelization
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 575-591
-
- Article
- Export citation
- Cited by 1
Solving stable matching problems using answer set programming
-
- Published online by Cambridge University Press:
- 07 March 2016, pp. 247-268
-
- Article
- Export citation
- Cited by 1
Special issue on ‘Program development’
-
- Published online by Cambridge University Press:
- 26 July 2002, pp. 423-424
-
- Article
- Export citation
- Cited by 1
On Cascade Products of Answer Set Programs
-
- Published online by Cambridge University Press:
- 21 July 2014, pp. 711-723
-
- Article
- Export citation
- Cited by 1
Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP
-
- Published online by Cambridge University Press:
- 22 September 2022, pp. 770-775
-
- Article
-
- You have access
- HTML
- Export citation
- Cited by 1
A Survey of the Proof-Theoretic Foundations of Logic Programming
-
- Published online by Cambridge University Press:
- 18 November 2021, pp. 859-904
-
- Article
- Export citation
- Cited by 1
On Establishing Robust Consistency in Answer Set Programs
-
- Published online by Cambridge University Press:
- 19 September 2022, pp. 1094-1127
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
On the Foundations of Grounding in Answer Set Programming
-
- Published online by Cambridge University Press:
- 25 July 2022, pp. 1138-1197
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling
-
- Published online by Cambridge University Press:
- 26 January 2023, pp. 1281-1306
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
A knowledge-based approach for selecting information sources*
-
- Published online by Cambridge University Press:
- 01 May 2007, pp. 249-300
-
- Article
- Export citation