Mais uma realização do grupo/base de pesquisa CNPq/UFRN em
"Lógica, Conhecimento e Ética".
Estão todos convidados!
Tema: Aspectos topológicos da propriedade lógica da compacidade
Palestrante: Giovani Angelo Silva da Nobrega
Data de realização: 25/06/07, 2a-feira, horário 18h30-20h10
Local: sala de reuniões do DIMAp
Tema: Especificações formais (linguagem Z)
Palestrante: Regivan Hugo Nunes Santiago
Data de realização: 26/06/07, 3a-feira, horário T34 (14h55-16h35)
Local: sala 3A2
Tema: Semântica e verificação de programas
Palestrante: Jamille Silva Madureira
Data de realização: 27/06/07, 4a-feira, horário T12 (13h-14h40)
Local: sala 3C3
Tema: Lógica Temporal aplicada à computação
Palestrante: Anderson Paiva Cruz
Data de realização: 28/06/07, 5a-feira, horário T34 (14h55-16h35)
Local: sala 3A2
Tema: Lógica Combinatória e Isomorfismo de Curry-Howard
Palestrante: Gabriel de Medeiros Galvão
Data de realização: 29/06/07, 6a-feira, horário T12 (13h-14h40)
Local: sala 3C3
quinta-feira, 21 de junho de 2007
segunda-feira, 18 de junho de 2007
TOULMIN: o *layout* de argumentos"
O Departamento de Filosofia da UFRN, através da base de pesquisa "Lógica, Conhecimento e Ética", dá continuidade a sua programação anual dos Seminários de Lógica e Filosofia, com a palestra
TOULMIN: o *layout* de argumentos"
Prof. Dr. José Eduardo de Almeida Moura
Data: 22/ 06 /2007 às 16 h
Local: UFRN /CCHLA / Auditório de Filosofia
TOULMIN: o *layout* de argumentos"
Prof. Dr. José Eduardo de Almeida Moura
Data: 22/ 06 /2007 às 16 h
Local: UFRN /CCHLA / Auditório de Filosofia
domingo, 10 de junho de 2007
SATMS - The Simplified Assumption-based Truth Maintenance System
-----------------------------------------------------------------------------
Seminário do Grupo de Lógica, Inteligência Artificial
e Métodos Formais - LIAMF
Seminário Registrado na CPG do IME/USP
Página: http://www.ime.usp.br/~liamf/seminarios/index.html
-----------------------------------------------------------------------------
Título: SATMS - The Simplified Assumption-based Truth Maintenance System
Palestrante: Tiago Motta Jorge
Data e Local: dia 11.06.07 às 16:00 hs
Local: Sala 242 - Bloco A - IME - USP
Resumo:
e Métodos Formais - LIAMF
Seminário Registrado na CPG do IME/USP
Página: http://www.ime.usp.br/~liamf
------------------------------
Título: SATMS - The Simplified Assumption-based Truth Maintenance System
Palestrante: Tiago Motta Jorge
Data e Local: dia 11.06.07 às 16:00 hs
Local: Sala 242 - Bloco A - IME - USP
Resumo:
Truth maintenance systems (TMS) are mechanisms for keeping track of dependencies and detecting inconsistency. They are also known as a kind of belief revision systems.
Sometimes it is convenient to perform reasoning in the context of different hypothetical worlds, which may or may not resemble the way the world actually is. This strategy is particularly useful if there are a large number of hypotheses competing to account for the observations, with the possibility that a composite hypothesis may be required to cover all of them.
In an assumption-based truth maintenance system (ATMS), the program maintains a number of different contexts, referred to as environments. An environment is best thought of as a view of the world characterized by a set of assumptions.
One can think of the ATMS as being a dynamic structure that maintains dependencies among assumptions. Given a proposition, it can construct a label for that propostion telling in which environments it holds. With this structure, it is straightforward to add and retract assumptions and still be capable to check wheter or not a proposition still holds, without having to make a lot of inferences.
In this seminar, a simplified version of the ATMS will be presented. It assumes that all assumptions are fixed. Besides, it assumes that the inconsistent sets of assumptions are known a priori. The SATMS's job is just to give us one maximal consistent set of assumptions from an inconsistent set.
It will also be presented an application of the SATMS in a programming game called Guntactyx.
Sometimes it is convenient to perform reasoning in the context of different hypothetical worlds, which may or may not resemble the way the world actually is. This strategy is particularly useful if there are a large number of hypotheses competing to account for the observations, with the possibility that a composite hypothesis may be required to cover all of them.
In an assumption-based truth maintenance system (ATMS), the program maintains a number of different contexts, referred to as environments. An environment is best thought of as a view of the world characterized by a set of assumptions.
One can think of the ATMS as being a dynamic structure that maintains dependencies among assumptions. Given a proposition, it can construct a label for that propostion telling in which environments it holds. With this structure, it is straightforward to add and retract assumptions and still be capable to check wheter or not a proposition still holds, without having to make a lot of inferences.
In this seminar, a simplified version of the ATMS will be presented. It assumes that all assumptions are fixed. Besides, it assumes that the inconsistent sets of assumptions are known a priori. The SATMS's job is just to give us one maximal consistent set of assumptions from an inconsistent set.
It will also be presented an application of the SATMS in a programming game called Guntactyx.
Assinar:
Postagens (Atom)