A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems-Reference-Cited by-同舟云学术

A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems

Published:2005 Issue: Volume: Page:67-82
ISSN:0302-9743
Container-title:Logic Programming
language:
Short-container-title:

Author:

Dovier Agostino,Formisano Andrea,Pontelli Enrico

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11562931_8.pdf

Reference24 articles.

1. Anger, C., Schauß, T., Truszczyński, M.: ASPARAGUS – the Dagstuhl Initiative. ALP Newsletter 17(3) (2004)

2. Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)

3. Clote, P., Backofen, R.: Computational Molecular Biology. Wiley & Sons, Chichester (2001)

4. Crescenzi, P., et al.: On the complexity of protein folding. In: STOC, pp. 597–603 (1998)

5. Dal Palù, A., Dovier, A., Fogolari, F.: Constraint logic programming approach to protein structure prediction. BMC Bioinformatics 5(186), 1–12 (2004)

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Industrial-size job shop scheduling with constraint programming;Operations Research Perspectives;2022

2. OntoScene, A Logic-Based Scene Interpreter: Implementation and Application in the Rock Art Domain;Theory and Practice of Logic Programming;2020-01-15

3. Constraint Answer Set Programming without Grounding;Theory and Practice of Logic Programming;2018-07

4. Freight transportation broker agent based on constraint logic programming;Evolving Systems;2018-06-04

5. Preface;Theory and Practice of Logic Programming;2017-07