Simple random logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5753 LNAI, Issue , 2009, Pages 223-235

  Namasivayam, Gayathri ^a   Truszczyński, Mirosław ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; LOGIC PROGRAMS; NEGATIVE CONSTRAINTS;

ATOMS;

LOGIC PROGRAMMING;

EID: 70349850655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04238-6_20     Document Type: Conference Paper

References (20)

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.:Randomsatisfiability. In:Biere,A.,Heule, M., vanMaaren,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. Zhao, Y., Lin, F.: Answer set programming phase transition: a study on randomly generated programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.2916, pp. 239-253. Springer, Heidelberg (2003)
6. Marek, W., Truszczýnski, M.: Autoepistemic logic. Journal of the ACM 38, 588-619 (1991)
7. Huang, G.S., Jia, X., Liau, C.J., You, J.H.: Two-literal logic programs and satis- fiability representation of stable models: a comparison. In: Cohen, R., Spencer, B. (eds.) Canadian AI 2002. LNCS (LNAI), vol.2338, pp. 119-131. Springer, Heidelberg (2002)
8. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and data bases, pp. 293-322. Plenum Press, New York (1978)
9. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181-234 (2002)
10. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.4483, pp. 260-265. Springer, Heidelberg (2007)
11. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 499-562 (2006)
12. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002), pp. 112-117. AAAI Press, Menlo Park (2002)
13. Lierler, Y., Maratea, M.: Cmodels-2: Sat-based answer set solver enhanced to nontight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.2923, pp. 346-350. Springer, Heidelberg (2004)
14. Bollob́as, B.: Random Graphs. Academic Press, London (1985)
15. Janson, S., Luczak, T., Rucínski, A.: Random Graphs.Wiley- Interscience, Hoboken (2000)
16. de la Vega, W.F.: Kernels in random graphs. Discrete Math. 82, 213-217 (1990)
17. Janhunen, T.: Representing normal programs with clauses. In: de Ḿantaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 358-362. IOS Press, Amsterdam (2004)
18. Fages, F.: Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60 (1994)
19. Éen, N., SÖrensson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.2919, pp. 502-518. Springer, Heidelberg (2003)
20. Wong, D., Schlipf, J., Truszczýnski, M.: On the distribution of programs with stable models. Unpublished, presented at the Dagstuhl Seminar 05171, Nonmonotonic Reasoning, Answer Set Programming and Constraints (2005)