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 8
On the correctness of pull-tabbing
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 713-730
-
- Article
- Export citation
- Cited by 8
Semantics for Possibilistic Disjunctive Programs*
-
- Published online by Cambridge University Press:
- 28 July 2011, pp. 33-70
-
- Article
- Export citation
- Cited by 8
Decomposable theories
-
- Published online by Cambridge University Press:
- 01 September 2007, pp. 583-632
-
- Article
- Export citation
- Cited by 8
Declarative Approaches to Counterfactual Explanations for Classification
-
- Published online by Cambridge University Press:
- 27 December 2021, pp. 559-593
-
- Article
- Export citation
- Cited by 8
Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming
-
- Published online by Cambridge University Press:
- 02 November 2021, pp. 51-80
-
- Article
- Export citation
- Cited by 8
A Syntactic Operator for Forgetting that Satisfies Strong Persistence
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 1038-1055
-
- Article
- Export citation
- Cited by 8
On modular termination proofs of general logic programs
-
- Published online by Cambridge University Press:
- 23 April 2002, pp. 263-291
-
- Article
- Export citation
- Cited by 8
Combining decidability paradigms for existential rules
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 877-892
-
- Article
- Export citation
- Cited by 8
A declarative approach to distributed computing: Specification, execution and analysis
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 815-830
-
- Article
- Export citation
- Cited by 8
Using sequential runtime distributions for the parallel speedup prediction of SAT local search
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 625-639
-
- Article
- Export citation
- Cited by 8
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
-
- Published online by Cambridge University Press:
- 08 October 2010, pp. 881-904
-
- Article
- Export citation
- Cited by 8
A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There*
-
- Published online by Cambridge University Press:
- 27 January 2011, pp. 171-202
-
- Article
- Export citation
- Cited by 8
Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning
-
- Published online by Cambridge University Press:
- 10 August 2018, pp. 571-588
-
- Article
-
- You have access
- Export citation
- Cited by 8
Optimizing Answer Set Computation via Heuristic-Based Decomposition
-
- Published online by Cambridge University Press:
- 28 February 2019, pp. 603-628
-
- Article
- Export citation
- Cited by 8
Linear-Time Temporal Answer Set Programming
-
- Published online by Cambridge University Press:
- 27 December 2021, pp. 2-56
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 8
A general framework for static profiling of parametric resource usage*
-
- Published online by Cambridge University Press:
- 14 October 2016, pp. 849-865
-
- Article
- Export citation
- Cited by 8
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings)
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 847-861
-
- Article
- Export citation
- Cited by 8
Resource Analysis driven by (Conditional) Termination Proofs
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 722-739
-
- Article
- Export citation
- Cited by 8
Scaling-up reasoning and advanced analytics on BigData
-
- Published online by Cambridge University Press:
- 05 September 2018, pp. 806-845
-
- Article
-
- You have access
- Export citation
- Cited by 8
Proving correctness and completeness of normal programs – a declarative approach
-
- Published online by Cambridge University Press:
- 31 October 2005, pp. 669-711
-
- Article
- Export citation