skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
A Logic with Conditional Probabilities
RASKOVIC, Miodrag ; OGNJANOVIC, Zoran ; MARKOVIC, Zoran
Lecture notes in computer science, 2004, p.226-238
[Periódico revisado por pares]
Berlin, Heidelberg: Springer Berlin Heidelberg
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
A Logic with Conditional Probabilities
Autor:
RASKOVIC, Miodrag
;
OGNJANOVIC, Zoran
;
MARKOVIC, Zoran
Assuntos:
Applied sciences
;
Artificial intelligence
;
Completeness Theorem
;
Computer science
;
control theory
;
systems
;
Conditional Probability
;
Exact sciences and technology
;
Inference Rule
;
Intended Meaning
;
Learning and adaptive systems
;
Logical, boolean and switching functions
;
Propositional Formula
;
Theoretical computing
É parte de:
Lecture notes in computer science, 2004, p.226-238
Descrição:
The paper presents a logic which enriches propositional calculus with three classes of probabilistic operators which are applied to propositional formulas: P ≥ s(α), CP = s(α, β) and CP ≥ s (α, β), with the intended meaning ”the probability of α is at least s”, ”the conditional probability of α given β is s”, and ”the conditional probability of α given β is at least s”, respectively. Possible-world semantics with a probability measure on sets of worlds is defined and the corresponding strong completeness theorem is proved for a rather simple set of axioms. This is achieved at the price of allowing infinitary rules of inference. One of these rules enables us to syntactically define the range of the probability function. This range is chosen to be the unit interval of a recursive nonarchimedean field, making it possible to define another probabilistic operator CP ≈ 1(α, β) with the intended meaning ”probabilities of α ∧ β and β are almost the same”. This last operator may be used to model default reasoning.
Editor:
Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma:
Inglês
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
2
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript