Advances in Artificial Intelligence: 16th Brazilian by Sheila R. M. Veloso, Paulo A. S. Veloso (auth.), Guilherme

By Sheila R. M. Veloso, Paulo A. S. Veloso (auth.), Guilherme Bittencourt, Geber L. Ramalho (eds.)

The biennial Brazilian Symposium on Arti?cial Intelligence (SBIA 2002) – of which this is often the sixteenth occasion – is a gathering and dialogue discussion board for arti?cial intelligence researchers and practitioners around the world. SBIA is the prime c- ference in Brazil for the presentation of analysis and functions in arti?cial intelligence. The ?rst SBIA used to be held in 1984, and because 1995 it's been a world convention, with papers written in English and a world software committee, which this 12 months used to be composed of forty five researchers from thirteen nations. SBIA 2002 was once held along side the VII Brazilian Symposium on Neural Networks (SBRN 2002). SBRN 2002 makes a speciality of neural networks and on different versions of computational intelligence. SBIA 2002, supported via the Brazilian machine Society (SBC), used to be held in Porto de Galinhas/Recife, Brazil, 11–14 November 2002. the decision for papers used to be very profitable, leading to 146 papers submitted from 18 international locations. a complete of 39 papers have been authorized for book within the lawsuits. we want to thank the SBIA 2002 sponsoring enterprises, CNPq, Capes, and CESAR, and likewise all of the authors who submitted papers. specifically, we wish to thank this system committee contributors and the extra referees for the di?cult activity of reviewing and commenting at the submitted papers.

Show description

Read or Download Advances in Artificial Intelligence: 16th Brazilian Symposium on Artificial Intelligence, SBIA 2002 Porto de Galinhas/Recife, Brazil, November 11–14, 2002 Proceedings PDF

Similar nonfiction_11 books

Extra resources for Advances in Artificial Intelligence: 16th Brazilian Symposium on Artificial Intelligence, SBIA 2002 Porto de Galinhas/Recife, Brazil, November 11–14, 2002 Proceedings

Sample text

The letters S and s will denote sets of propositional letters. Let S ⊂ P be a finite set of propositional letters. We abuse notation and write that, for any formula α ∈ LC , α ∈ S if all its propositional letters are in S. A propositional valuation vp is a function vp : P → {0, 1}. 2 Approximate Entailment We briefly present here the notion of approximate entailment and summarise the main results obtained in [SC95]. Schaerf and Cadoli define two approximations of classical entailment: |=1S which is complete but not sound, and |=3S which is classically sound but incomplete.

AAAI Press/The MIT Press, 1996. 11 [16] J. McCarthy. Notes on formalizing context. In Proceeding of the thirteen International Joint Conference on Artificial Intelligence, IJCAI’93, Chamb´ery, France. Morgan Kaufmann Publishers, 1993. 11, 12, 17, 19 [17] J. McCarthy and S. Buvaˇc. Formalizing Context: Expanded Notes. Technical Report STAN-CS-TN-94-13, Computer Science Dpt. - Stanford University, 1994. 11 [18] P. Nayak. Representing Multiple Theories. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 1154–1160, Cambridge, MAUSA, 1994.

N into δ1 , . . , δn : Definition 4. Given a formula γ and a belief sequence B, β, β ∈ B, β ≺ β if either (a) rel(γ, β, B) < rel(γ, β , B) (β is more relevant to γ than β ); or (b) β β, β are equally relevant (rel(γ, β, B) = rel(γ, β , B)) but β The new sequence is now ordered according to decreasing relevance, with lower indexed formulas being more relevant than those with higher indexes. The δ1 , . . , δn are the β1 , . . , βn under this order. In the definition below Γ is the set Γ B,k,γ and k is a preselected level of relevance.

Download PDF sample

Rated 4.80 of 5 – based on 45 votes