Simple Random Logic Programs-Reference-Cited by-同舟云学术

Simple Random Logic Programs

Published:2009 Issue: Volume: Page:223-235
ISSN:0302-9743
Container-title:Logic Programming and Nonmonotonic Reasoning
language:
Short-container-title:

Author:

Namasivayam Gayathri,Truszczyński Mirosław

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04238-6_20

Reference20 articles.

1. Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of AAAI 1992, pp. 459–465. Morgan Kaufmann, San Francisco (1992)

2. Achlioptas, D.: Random satisfiability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 245–270. IOS Press, Amsterdam (2009)

3. Selman, B., Kautz, H., McAllester, D.: Ten challenges in propositional reasoning and search. In: Proceedings of the 15th International Joint Conference on Artificial Inteligence, IJCAI 1997, pp. 50–54. Morgan Kaufmann, San Francisco (1997)

4. Gent, I., Walsh, T.: Easy problems are sometimes hard. Artificial Intelligence 70, 335–345 (1994)

5. Lecture Notes in Computer Science;Y. Zhao,2003

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

1. New models for generating hard random boolean formulas and disjunctive logic programs;Artificial Intelligence;2020-02

2. Generating Random Logic Programs Using Constraint Programming;Lecture Notes in Computer Science;2020

3. A Model for Phase Transition of Random Answer-Set Programs;ACM Transactions on Computational Logic;2016-07-22

4. Random logic programs: Linear model;Theory and Practice of Logic Programming;2014-09-05

5. Testing and debugging techniques for answer set solver development;Theory and Practice of Logic Programming;2010-07