Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Simple random logic programs

  • Gayathri Namasivayam
  • , Mirosław Truszczyński

Producción científica: Conference contributionrevisión exhaustiva

8 Citas (Scopus)

Resumen

We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random "sparse" and "dense" programs with two-literal rules have answer sets. We study experimentally how hard it is to compute answer sets of such programs. For programs that are constraint-free and purely negative we show that the easy-hard-easy pattern emerges. We provide arguments to explain that behavior. We also show that the hardness of programs from the hard region grows quickly with the number of atoms. Our results point to the importance of purely negative constraint-free programs for the development of ASP solvers.

Idioma originalEnglish
Título de la publicación alojadaLogic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings
Páginas223-235
Número de páginas13
DOI
EstadoPublished - 2009
Evento10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009 - Potsdam, Germany
Duración: sept 14 2009sept 18 2009

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen5753 LNAI
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conference

Conference10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009
País/TerritorioGermany
CiudadPotsdam
Período9/14/099/18/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Huella

Profundice en los temas de investigación de 'Simple random logic programs'. En conjunto forman una huella única.

Citar esto