Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

ASSAT : computing answer sets of a logic program by SAT solvers

Descargar SCORM

Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

 
Ver

Detalles del recurso

Marcadores Sociales
ASSAT : computing answer sets of a logic program by SAT solvers
Id. 5664767
Idioma inglés (Estados Unidos)
Titulo ASSAT : computing answer sets of a logic program by SAT solvers
Autor(es) Lin, Fangzhen
Zhao, Yuting
Localización Proceedings of AAAI - 2002, P. 112
http://hdl.handle.net/1783.1/765
Versión 1.0
Estado Final
Descripción We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one-to-one correspondence between the answer sets of the program and the models of the resulting propositional theory. Compared with the translation by Ben-Eliyahu and Dechter, ours has the advantage that it does not use any extra variables, and is considerably simpler, thus easier to understand. However, in the worst case, it requires computing exponential number of loop formulas. To address this problem, we propose an approach that adds loop formulas a few at a time, selectively. Based on these results, we implemented a system called ASSAT(X), depending on the SAT solver X used, and tested it on a variety of benchmarks including the graph coloring, the blocks world planning, and Hamiltonian Circuit domains. The results are compared with those by smodels and dlv, and it shows a clear edge of ASSAT(X) over them in these domains.
Tipo 77417 bytes
application/pdf
Palabras clave Logic program
Tipo de recurso Conference paper
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
Copyright © 2002 American Association for Artificial Intelligence. Information about AAAI publications is available at: http://www.aaai.org/Publications/publications.html
Formatos 77417 bytes
application/pdf
Requerimientos técnicos Browser: Any
Fecha de contribución 18-dic-2008
Contacto

Valoración de los usuarios

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.