We consider a denition of the belief revision prob- lem that consists in removing a contradiction from an extended logic program by modifying the truth value of a selected set of literals called revis- ables. The program contains as well clauses with false in the head, representing integrity constraints. Any model of the program must ensure that the body of integrity constraints be false for the program to be non-contradictory. Contradiction may also arise in an extended logic program when both a literal L and its opposite :L are obtainable in the model of the program. Such a problem has been widely studied in the literature, and various so- lutions have been proposed that are based on abductive logic proof procedures. The system performs belief revision in a society of logic-based agents, by means of a (distributed) genetic algorithm. The problem can be modeled by means of a genetic algorithm, by assigning to each revisable of a logic program a gene in a chromosome. In the case of a two-valued revision, the gene will have the value 1 if the corresponding revisable is true and the value 0 if the revisable is false. The fitness function that is used in this case is represented in part by the percentage of integrity constraints that are satisfied by a chromosome.

A system for multi-agent belief revision by genetic search

LAMMA, Evelina;RIGUZZI, Fabrizio;
2001

Abstract

We consider a denition of the belief revision prob- lem that consists in removing a contradiction from an extended logic program by modifying the truth value of a selected set of literals called revis- ables. The program contains as well clauses with false in the head, representing integrity constraints. Any model of the program must ensure that the body of integrity constraints be false for the program to be non-contradictory. Contradiction may also arise in an extended logic program when both a literal L and its opposite :L are obtainable in the model of the program. Such a problem has been widely studied in the literature, and various so- lutions have been proposed that are based on abductive logic proof procedures. The system performs belief revision in a society of logic-based agents, by means of a (distributed) genetic algorithm. The problem can be modeled by means of a genetic algorithm, by assigning to each revisable of a logic program a gene in a chromosome. In the case of a two-valued revision, the gene will have the value 1 if the corresponding revisable is true and the value 0 if the revisable is false. The fitness function that is used in this case is represented in part by the percentage of integrity constraints that are satisfied by a chromosome.
2001
Logic Prograimming; Belief Revision; Multi-Agent Systems; Genetic Algorithms
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11392/1195328
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact