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
Stabilization of cooperative information agents in unpredictable environment: a logic programming approach
-
- Published online by Cambridge University Press:
- 27 January 2006, pp. 1-22
-
- Article
- 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
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
Forward slicing of functional logic programs by partial evaluation*
-
- Published online by Cambridge University Press:
- 01 January 2007, pp. 215-247
-
- Article
- Export citation
- Cited by 1
Constraint-Based Inference in Probabilistic Logic Programs
-
- Published online by Cambridge University Press:
- 10 August 2018, pp. 638-655
-
- Article
-
- You have access
- 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
Top-down and Bottom-up Evaluation Procedurally Integrated
-
- Published online by Cambridge University Press:
- 10 August 2018, pp. 706-721
-
- Article
-
- You have access
- Export citation
- Cited by 1
Region-based memory management for Mercury programs
-
- Published online by Cambridge University Press:
- 29 May 2012, pp. 959-1024
-
- 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
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
Locally Tight Programs
-
- Published online by Cambridge University Press:
- 19 January 2024, pp. 1-31
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
“What if?” in Probabilistic Logic Programming
-
- Published online by Cambridge University Press:
- 17 July 2023, pp. 884-899
-
- Article
-
- You have access
- Open access
- HTML
- 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
A simple correctness proof for magic transformation
-
- Published online by Cambridge University Press:
- 04 March 2011, pp. 929-936
-
- Article
- Export citation
- Cited by 1
An open ended tree
-
- Published online by Cambridge University Press:
- 13 May 2003, pp. 377-385
-
- Article
- Export citation
- Cited by 1
PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
-
- Published online by Cambridge University Press:
- 01 November 2007, pp. 633-695
-
- Article
- Export citation
- Cited by 1
Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
-
- Published online by Cambridge University Press:
- 28 June 2022, pp. 693-707
-
- Article
- Export citation
- Cited by 1
Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
-
- Published online by Cambridge University Press:
- 21 September 2020, pp. 799-814
-
- Article
-
- You have access
- Open access
- Export citation
- 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
Logic programming with default, weak and strict negations
-
- Published online by Cambridge University Press:
- 16 October 2006, pp. 737-749
-
- Article
- Export citation