Advances in Artificial Intelligence – SBIA 2010: 20th by Alexandre Lorenzatti, Mara Abel, Sandro Rama Fiorini, Ariane

By Alexandre Lorenzatti, Mara Abel, Sandro Rama Fiorini, Ariane Kravczyk Bernardes (auth.), Antônio Carlos da Rocha Costa, Rosa Maria Vicari, Flavio Tonidandel (eds.)

This publication constitutes the complaints of the twentieth Brazilian Symposium on synthetic Intelligence, SBIA 2010, held in São Bernardo do Campo, Brazil, in October 2010. The 31 papers awarded have been conscientiously reviewed and chosen from ninety one submissions. the subjects lined are: ontologies, wisdom illustration and reasoning; desktop studying; self sufficient brokers and multiagent structures; common language processing; making plans and scheduling; constraints and seek; and logics for AI.

Show description

Read or Download Advances in Artificial Intelligence – SBIA 2010: 20th Brazilian Symposium on Artificial Intelligence, São Bernardo do Campo, Brazil, October 23-28, 2010. Proceedings PDF

Similar nonfiction_7 books

High energy density materials

A. J. Bellamy: FOX-7 (1,1-Diamino-2,2-dinitroethene). - R. P. Singh, H. Gao, D. T. Meshri, J. M. Shreeve: Nitrogen-Rich Heterocycles. - T. M. Klapötke: New Nitrogen-Rich excessive Explosives. - R. D. Chapman: natural Difluoramine Derivatives. -B. M. Rice, E. F. C. Byrd, W. D. Mattson: Computational features of Nitrogen-Rich HEDMs.

Synchronous Equivalence: Formal Methods for Embedded Systems

An embedded method is loosely outlined as any procedure that makes use of electronics yet isn't really perceived or used as a general-purpose machine. ordinarily, a number of digital circuits or microprocessors are actually embedded within the process, both taking on roles that was once played by way of mechanical units, or supplying performance that's not in a different way attainable.

Functional Adaptive Control: An Intelligent Systems Approach

The sphere of clever keep watch over has lately emerged as a reaction to the problem of controlling hugely advanced and unsure nonlinear structures. It makes an attempt to endow the controller with the main houses of edition, examine­ ing and autonomy. the sphere continues to be immature and there exists a large scope for the advance of recent equipment that improve the foremost homes of in­ telligent platforms and enhance the functionality within the face of more and more complicated or doubtful stipulations.

Additional resources for Advances in Artificial Intelligence – SBIA 2010: 20th Brazilian Symposium on Artificial Intelligence, São Bernardo do Campo, Brazil, October 23-28, 2010. Proceedings

Sample text

This means that “It is not allowed to start the microwave oven with the opened door ”. Motivation. In Figure 1, the state transitions are labelled with actions. However, actions are not part of a Kripke structure, which is the formalism used in most of the model checking and updating known approaches [1,3,10]. Moreover, those works do not consider the contingencies and constraints of the application domain. In this paper, we intend to show that representing actions in the formal model of a system, and considering the domain constraints, can allow for more realistic changes in the system model in order to effectively correct errors introduced in the specification design phase.

Our algorithm calls the function ComputeUpdate(agbs , b), defined in [5]. The output of this function is a new ABox A with the belief b included. The removal of a (ground) belief at from a belief base (T ,A ) is performed by calling the same function ComputeUpdate used for computing belief addition. The difference is that, besides the belief base, ¬at has to be passed as argument. This is intuitive, since, for not being able to conclude at anymore, we have to make an effort to include in the belief base contradictions to at.

V. de Menezes, S. do L. N. de Barros Fig. 5. A labelled transition system. Solid lines represent a partial model M ⊆ M . PUA1: Adding transitions induced by an action. Given a partial model M = S, L, T , a corresponding updated model M = S , L , T , with respect to M = S , L , T , can be obtained from M by adding a transition between states si , sj ∈ S. In other words: T = T ∪ {(si , a, s) ∈ T : ∃a ∈ A, (si , a, sj ) ∈ T }; S = S ∪ {s : ∃a ∈ A, (si , a, s) ∈ T } and L (s) = L (s), s ∈ S . Adding a transition between two states si and sj in the partial model is possible only if there is some transition between these states in the complete model.

Download PDF sample

Rated 4.13 of 5 – based on 19 votes