Negation in logic programs: is it necessary two connectives?
- Autores
- Fillottrani, Pablo Rubén; Simari, Guillermo Ricardo
- Año de publicación
- 1998
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: Teoría
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Informática
Logic Programming
Nonmonotic reasoning
Negation
Negation as failure - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24901
Ver los metadatos del registro completo
id |
SEDICI_bce75af1f6002e6a6f8f070ff60dd0fa |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24901 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Negation in logic programs: is it necessary two connectives?Fillottrani, Pablo RubénSimari, Guillermo RicardoCiencias InformáticasInformáticaLogic ProgrammingNonmonotic reasoningNegationNegation as failureNegative 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.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI)1998-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24901enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:48Zoai:sedici.unlp.edu.ar:10915/24901Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:49.714SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Negation in logic programs: is it necessary two connectives? |
title |
Negation in logic programs: is it necessary two connectives? |
spellingShingle |
Negation in logic programs: is it necessary two connectives? Fillottrani, Pablo Rubén Ciencias Informáticas Informática Logic Programming Nonmonotic reasoning Negation Negation as failure |
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? |
dc.creator.none.fl_str_mv |
Fillottrani, Pablo Rubén Simari, Guillermo Ricardo |
author |
Fillottrani, Pablo Rubén |
author_facet |
Fillottrani, Pablo Rubén Simari, Guillermo Ricardo |
author_role |
author |
author2 |
Simari, Guillermo Ricardo |
author2_role |
author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Informática Logic Programming Nonmonotic reasoning Negation Negation as failure |
topic |
Ciencias Informáticas Informática Logic Programming Nonmonotic reasoning Negation Negation as failure |
dc.description.none.fl_txt_mv |
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. Eje: Teoría Red de Universidades con Carreras en Informática (RedUNCI) |
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. |
publishDate |
1998 |
dc.date.none.fl_str_mv |
1998-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24901 |
url |
http://sedici.unlp.edu.ar/handle/10915/24901 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260127848071168 |
score |
13.13397 |