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 3
Timed soft concurrent constraint programs: An interleaved and a parallel approach
-
- Published online by Cambridge University Press:
- 06 June 2014, pp. 743-782
-
- Article
- Export citation
- Cited by 3
Building Information Modeling Using Constraint Logic Programming
-
- Published online by Cambridge University Press:
- 14 July 2022, pp. 723-738
-
- Article
- Export citation
- Cited by 3
A Transformational Approach to Resource Analysis with Typed-norms Inference
-
- Published online by Cambridge University Press:
- 05 September 2019, pp. 310-357
-
- Article
- Export citation
- Cited by 3
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
-
- Published online by Cambridge University Press:
- 01 July 2009, pp. 529-564
-
- Article
- Export citation
- Cited by 3
Business process verification with constraint temporal answer set programming*
-
- Published online by Cambridge University Press:
- 25 September 2013, pp. 641-655
-
- Article
- Export citation
- Cited by 3
Constraint Processing by Rina Dechter, Morgan Kaufmann Publishers, 2003, hard cover: ISBN 1-55860-890-7, xx + 481 pages
-
- Published online by Cambridge University Press:
- 12 August 2004, pp. 755-757
-
- Article
- Export citation
- Cited by 3
Inconsistency Proofs for ASP: The ASP - DRUPE Format
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 891-907
-
- Article
- Export citation
- Cited by 3
Logic programming with social features1
-
- Published online by Cambridge University Press:
- 01 November 2008, pp. 643-690
-
- Article
- Export citation
- Cited by 3
Forgetting in Answer Set Programming – A Survey
-
- Published online by Cambridge University Press:
- 27 December 2021, pp. 111-156
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
-
- Published online by Cambridge University Press:
- 02 November 2021, pp. 195-225
-
- Article
- Export citation
- Cited by 3
A design and implementation of the Extended Andorra Model1
-
- Published online by Cambridge University Press:
- 04 May 2011, pp. 319-360
-
- Article
- Export citation
- Cited by 3
On the complexity of identifying head-elementary-set-free programs
-
- Published online by Cambridge University Press:
- 13 November 2009, pp. 113-123
-
- Article
- Export citation
- Cited by 3
Solving Advanced Argumentation Problems with Answer Set Programming
-
- Published online by Cambridge University Press:
- 15 January 2020, pp. 391-431
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
ASP (
$\mathcal A \mathcal C$): Answer Set Programming with Algebraic Constraints
-
- Published online by Cambridge University Press:
- 22 September 2020, pp. 895-910
-
- Article
-
- You have access
- Open access
- Export citation
- Cited by 3
Integrating Cardinality Constraints into Constraint Logic Programming with Sets
-
- Published online by Cambridge University Press:
- 09 November 2021, pp. 468-502
-
- Article
- Export citation
- Cited by 3
Random logic programs: Linear model
-
- Published online by Cambridge University Press:
- 05 September 2014, pp. 818-853
-
- Article
- Export citation
- Cited by 3
SUNNY-CP and the MiniZinc challenge*
-
- Published online by Cambridge University Press:
- 10 August 2017, pp. 81-96
-
- Article
- Export citation
- Cited by 3
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming*
-
- Published online by Cambridge University Press:
- 01 January 2007, pp. 123-151
-
- Article
- Export citation
- Cited by 3
Range-based argumentation semantics as two-valued models
-
- Published online by Cambridge University Press:
- 03 May 2016, pp. 75-90
-
- Article
- Export citation
- Cited by 3
Revisiting Explicit Negation in Answer Set Programming
-
- Published online by Cambridge University Press:
- 20 September 2019, pp. 908-924
-
- Article
-
- You have access
- Open access
- Export citation