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

Approximating answer sets of unitary Lifschitz-Woo programs

  • Victor W. Marek
  • , Inna Pivkina
  • , Mirosław Truszczyński

Producción científica: Conference contribution › revisión exhaustiva

Resumen

We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different methods of approximation and obtain results on the relationship between them. Since general logic programs with single literals as heads are equivalent to revision programs, we obtain results on approximations of justified revisions of databases by revision programs.

Idioma originalEnglish
Título de la publicación alojadaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Páginas66-78
Número de páginas13
DOI
EstadoPublished - 2005
Evento8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005 - Diamante, Italy
Duración: sept 5 2005 → sept 8 2005

Serie de la publicación

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

Conference

Conference8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005
País/TerritorioItaly
CiudadDiamante
Período9/5/05 → 9/8/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Huella

Profundice en los temas de investigación de 'Approximating answer sets of unitary Lifschitz-Woo programs'. En conjunto forman una huella única.

Citar esto