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
Refactoring the Whitby Intelligent Tutoring System for Clean Architecture
-
- Published online by Cambridge University Press:
- 02 November 2021, pp. 818-834
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 1
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
-
- Published online by Cambridge University Press:
- 26 July 2022, pp. 678-692
-
- Article
- Export citation
- Cited by 1
A datalog-based computational model for coordination-free, data-parallel systems
-
- Published online by Cambridge University Press:
- 05 September 2018, pp. 874-927
-
- Article
-
- You have access
- Export citation
- Cited by 1
Tabling with Sound Answer Subsumption
-
- Published online by Cambridge University Press:
- 14 October 2016, pp. 933-949
-
- Article
- Export citation
- Cited by 1
Checking modes of HAL programs
-
- Published online by Cambridge University Press:
- 31 October 2005, pp. 623-667
-
- Article
- Export citation
- Cited by 1
Expressiveness of communication in answer set programming
-
- Published online by Cambridge University Press:
- 01 November 2011, pp. 361-394
-
- Article
- Export citation
- Cited by 1
A concurrent constraint programming interpretation of access permissions
-
- Published online by Cambridge University Press:
- 10 April 2018, pp. 252-295
-
- Article
- Export citation
- Cited by 1
Mathematical Logic: Foundations for Information Science by Wei Li, Birkhäuser, Berlin, 2010. Hardcover, ISBN-978-3-7643-9976-4.
-
- Published online by Cambridge University Press:
- 28 October 2011, pp. 989-992
-
- Article
- Export citation
- Cited by 1
Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM
-
- Published online by Cambridge University Press:
- 27 May 2019, p. 629
-
- Article
-
- You have access
- Export citation
- Cited by 1
Handling defeasibilities in action domains
-
- Published online by Cambridge University Press:
- 13 May 2003, pp. 329-376
-
- Article
- Export citation
- Cited by 1
Learn Prolog Now!Patrick Blackburn, Johan Bos, Kristina Striegnitz College Publications, 2006 Paperback: ISBN 1-904987-17-6, Price: £12 xiv + 265 pages.
-
- Published online by Cambridge University Press:
- 01 March 2008, pp. 235-242
-
- Article
- Export citation
- Cited by 1
Completing the Picture: Complexity of Graded Modal Logics with Converse
-
- Published online by Cambridge University Press:
- 27 April 2021, pp. 493-520
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 1
Unifying Framework for Optimizations in Non-Boolean Formalisms
-
- Published online by Cambridge University Press:
- 15 November 2022, pp. 1248-1280
-
- Article
- Export citation
- Cited by 1
Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
-
- Published online by Cambridge University Press:
- 22 September 2020, pp. 942-957
-
- Article
- Export citation
- Cited by 1
Introduction to the 26th international conference on logic programming special issue
-
- Published online by Cambridge University Press:
- 09 July 2010, pp. 361-364
-
- Article
- Export citation
- Cited by 1
Compositional Specification in Rewriting Logic
-
- Published online by Cambridge University Press:
- 09 October 2019, pp. 44-98
-
- Article
- Export citation
- Cited by 1
Term Rewriting Systems by “Terese” (Marc Bezem, Jan Willem Klop, and Roel de Vrijer, eds.), Cambridge University Press, Cambridge Tracts in Theoretical Computer Science55, 2003, hard cover: ISBN 0-521-39115-6, xxii+884 pages
-
- Published online by Cambridge University Press:
- 09 May 2005, pp. 395-399
-
- Article
- Export citation
- Cited by 1
(Co-)Inductive semantics for Constraint Handling Rules
-
- Published online by Cambridge University Press:
- 06 July 2011, pp. 593-609
-
- Article
- Export citation
- Cited by 1
Relational theories with null values and non-herbrand stable models
-
- Published online by Cambridge University Press:
- 05 September 2012, pp. 565-582
-
- Article
- Export citation
- Cited by 1
Chain programs for writing deterministic metainterpreters
-
- Published online by Cambridge University Press:
- 25 March 2002, pp. 203-232
-
- Article
- Export citation