Multiple Revision on Horn Belief Bases
- Autores
- Valdez, Néstor Jorge; Falappa, Marcelo Alejandro
- Año de publicación
- 2016
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In logic programming, Horn clauses play a basic role, and in many logical constructs their consideration is important. In this paper we study the multiple revision of a belief base where the underlying logic is composed by Horn clauses. The main di culties as to restricting to the Horn fragment for revision operators by a single sentence are analyzed, and general results are presented about multiple revision operators on belief bases. We de ne prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic. We propose a set of postulates and representation theorems for each operation. This work is relevant for multiple revision in areas that employ Horn clauses, such as logic programming and deductive databases applications.
XVII Workshop Agentes y Sistemas Inteligentes (WASI).
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
horn belief revision
belief base
multiple change - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/55735
Ver los metadatos del registro completo
| id |
SEDICI_822d6cf44bc7f2275fa589bb00db9c4d |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/55735 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Multiple Revision on Horn Belief BasesValdez, Néstor JorgeFalappa, Marcelo AlejandroCiencias Informáticashorn belief revisionbelief basemultiple changeIn logic programming, Horn clauses play a basic role, and in many logical constructs their consideration is important. In this paper we study the multiple revision of a belief base where the underlying logic is composed by Horn clauses. The main di culties as to restricting to the Horn fragment for revision operators by a single sentence are analyzed, and general results are presented about multiple revision operators on belief bases. We de ne prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic. We propose a set of postulates and representation theorems for each operation. This work is relevant for multiple revision in areas that employ Horn clauses, such as logic programming and deductive databases applications.XVII Workshop Agentes y Sistemas Inteligentes (WASI).Red de Universidades con Carreras en Informática (RedUNCI)2016-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf45-54http://sedici.unlp.edu.ar/handle/10915/55735enginfo:eu-repo/semantics/reference/hdl/10915/55718info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:05:48Zoai:sedici.unlp.edu.ar:10915/55735Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:05:48.948SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Multiple Revision on Horn Belief Bases |
| title |
Multiple Revision on Horn Belief Bases |
| spellingShingle |
Multiple Revision on Horn Belief Bases Valdez, Néstor Jorge Ciencias Informáticas horn belief revision belief base multiple change |
| title_short |
Multiple Revision on Horn Belief Bases |
| title_full |
Multiple Revision on Horn Belief Bases |
| title_fullStr |
Multiple Revision on Horn Belief Bases |
| title_full_unstemmed |
Multiple Revision on Horn Belief Bases |
| title_sort |
Multiple Revision on Horn Belief Bases |
| dc.creator.none.fl_str_mv |
Valdez, Néstor Jorge Falappa, Marcelo Alejandro |
| author |
Valdez, Néstor Jorge |
| author_facet |
Valdez, Néstor Jorge Falappa, Marcelo Alejandro |
| author_role |
author |
| author2 |
Falappa, Marcelo Alejandro |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas horn belief revision belief base multiple change |
| topic |
Ciencias Informáticas horn belief revision belief base multiple change |
| dc.description.none.fl_txt_mv |
In logic programming, Horn clauses play a basic role, and in many logical constructs their consideration is important. In this paper we study the multiple revision of a belief base where the underlying logic is composed by Horn clauses. The main di culties as to restricting to the Horn fragment for revision operators by a single sentence are analyzed, and general results are presented about multiple revision operators on belief bases. We de ne prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic. We propose a set of postulates and representation theorems for each operation. This work is relevant for multiple revision in areas that employ Horn clauses, such as logic programming and deductive databases applications. XVII Workshop Agentes y Sistemas Inteligentes (WASI). Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
In logic programming, Horn clauses play a basic role, and in many logical constructs their consideration is important. In this paper we study the multiple revision of a belief base where the underlying logic is composed by Horn clauses. The main di culties as to restricting to the Horn fragment for revision operators by a single sentence are analyzed, and general results are presented about multiple revision operators on belief bases. We de ne prioritized multiple revision operators under a more restricted logic than classical propositional logic, i.e. Horn logic. We propose a set of postulates and representation theorems for each operation. This work is relevant for multiple revision in areas that employ Horn clauses, such as logic programming and deductive databases applications. |
| publishDate |
2016 |
| dc.date.none.fl_str_mv |
2016-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/55735 |
| url |
http://sedici.unlp.edu.ar/handle/10915/55735 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/reference/hdl/10915/55718 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 45-54 |
| 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_ |
1844615928612913152 |
| score |
13.069144 |