Negation in logic programs: is it necessary two connectives?

Negative information can be represented in several classes of logic programs. These approaches were first motivated by the search for an appropriate declarative semantics for negation as failure. Recently, some formalizations of monotonic negation were also introduced in logic programming in the for...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Fillottrani, Pablo Rubén, Simari, Guillermo Ricardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1998
Materias:
Ciencias Informáticas
Informática
Logic Programming
Nonmonotic reasoning
Negation
Negation as failure
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24901
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24901
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Informática
Logic Programming
Nonmonotic reasoning
Negation
Negation as failure
spellingShingle Ciencias Informáticas
Informática
Logic Programming
Nonmonotic reasoning
Negation
Negation as failure
Fillottrani, Pablo Rubén
Simari, Guillermo Ricardo
Negation in logic programs: is it necessary two connectives?
topic_facet Ciencias Informáticas
Informática
Logic Programming
Nonmonotic reasoning
Negation
Negation as failure
description Negative information can be represented in several classes of logic programs. These approaches were first motivated by the search for an appropriate declarative semantics for negation as failure. Recently, some formalizations of monotonic negation were also introduced in logic programming in the form of “classical” or “strong” negation. In view of such a diversity of semantics for negation in logic programs, Dix [7,5,6] proposed a method for classigying and characterizing them. In this paper we present an analysis of these approaches from the view-point of knowledge representation. We compare them with nonmonotonic formalisms such as default logic, circumscription, and autoepistemic logic, identifying some problems that are not preset in these logics. Then we suggest some alternatives, considering Dix’s formal properties. Finally we discuss the effect of allowing only one negative connective in the syntax of logic programs, whose semantics is defined by the programmer.
format Objeto de conferencia
Objeto de conferencia
author Fillottrani, Pablo Rubén
Simari, Guillermo Ricardo
author_facet Fillottrani, Pablo Rubén
Simari, Guillermo Ricardo
author_sort Fillottrani, Pablo Rubén
title Negation in logic programs: is it necessary two connectives?
title_short Negation in logic programs: is it necessary two connectives?
title_full Negation in logic programs: is it necessary two connectives?
title_fullStr Negation in logic programs: is it necessary two connectives?
title_full_unstemmed Negation in logic programs: is it necessary two connectives?
title_sort negation in logic programs: is it necessary two connectives?
publishDate 1998
url http://sedici.unlp.edu.ar/handle/10915/24901
work_keys_str_mv AT fillottranipabloruben negationinlogicprogramsisitnecessarytwoconnectives
AT simariguillermoricardo negationinlogicprogramsisitnecessarytwoconnectives
bdutipo_str Repositorios
_version_ 1764820466553323520

Ejemplares similares