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
Swapping evaluation: A memory-scalable solution for answer-on-demand tabling*
-
- Published online by Cambridge University Press:
- 09 July 2010, pp. 401-416
-
- Article
- Export citation
- Cited by 1
Introduction to the Special Issue on Logic Programming and the Web
-
- Published online by Cambridge University Press:
- 01 May 2008, pp. 247-248
-
- Article
- Export citation
- Cited by 1
Decomposing non-redundant sharing by complementation
-
- Published online by Cambridge University Press:
- 25 March 2002, pp. 233-261
-
- 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
On Uniform Equivalence of Epistemic Logic Programs
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 826-840
-
- 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
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 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
Parallelism, concurrency and distribution in constraint handling rules: A survey
-
- Published online by Cambridge University Press:
- 23 May 2018, pp. 759-805
-
- Article
-
- You have access
- Export citation
- Cited by 1
Precise complexity guarantees for pointer analysis via Datalog with extensions*
-
- Published online by Cambridge University Press:
- 14 October 2016, pp. 916-932
-
- Article
- Export citation
- Cited by 1
A comparison between two logical formalisms for rewriting
-
- Published online by Cambridge University Press:
- 01 January 2007, pp. 183-213
-
- Article
- Export citation
- Cited by 1
Disjunctive logic programs with existential quantification in rule heads
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 563-578
-
- Article
- Export citation
- Cited by 1
Efficient TBox Reasoning with Value Restrictions using the
${\cal F}{{\cal L}_0}$ wer Reasoner
-
- Published online by Cambridge University Press:
- 15 October 2021, pp. 162-192
-
- Article
-
- You have access
- Open access
- 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
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
A Module System for Domain-Specific Languages
-
- Published online by Cambridge University Press:
- 21 July 2014, pp. 771-785
-
- Article
- Export citation
- Cited by 1
A tribute to Alain Colmerauer
-
- Published online by Cambridge University Press:
- 09 June 2004, pp. 637-646
-
- Article
- 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
A structured alternative to Prolog with simple compositional semantics
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 611-627
-
- Article
- Export citation
- Cited by 1
Programming in Prolog. Using the ISO Standard. by William F. Clocksin, Christopher S. Mellish, Springer-Verlag, 2003, ISBN 3-540-00678-8, xiii+299 pages
-
- Published online by Cambridge University Press:
- 09 May 2005, pp. 391-395
-
- Article
- Export citation