Raftul cu initiativa Book Archive

Machine Theory

Progress in Artificial Intelligence: 12th Portuguese by Carlos Bento, Amilcar Cardoso, Gael Dias

By Carlos Bento, Amilcar Cardoso, Gael Dias

This ebook constitutes the refereed lawsuits of the twelfth Portuguese convention on man made Intelligence, EPIA 2005, held in Covilhã, Portugal in December 2005 as 9 built-in workshops.

The fifty eight revised complete papers provided have been conscientiously reviewed and chosen from a complete of 167 submissions. according to the 9 constituting workshops, the papers are geared up in topical sections on basic man made intelligence (GAIW 2005), affective computing (AC 2005), synthetic existence and evolutionary algorithms (ALEA 2005), development and employing ontologies for the semantic net (BAOSW 2005), computational tools in bioinformatics (CMB 2005), extracting wisdom from databases and warehouses (EKDB&W 2005), clever robotics (IROBOT 2005), multi-agent platforms: thought and purposes (MASTA 2005), and textual content mining and functions (TEMA 2005).

Show description

Read or Download Progress in Artificial Intelligence: 12th Portuguese Conference on Artificial Intelligence, EPIA 2005, Covilhã, Portugal, December 5-8, 2005. Proceedings PDF

Similar machine theory books

Digital and Discrete Geometry: Theory and Algorithms

This ebook presents accomplished assurance of the trendy tools for geometric difficulties within the computing sciences. It additionally covers concurrent subject matters in info sciences together with geometric processing, manifold studying, Google seek, cloud facts, and R-tree for instant networks and BigData. the writer investigates electronic geometry and its comparable optimistic equipment in discrete geometry, providing exact equipment and algorithms.

Artificial Intelligence and Symbolic Computation: 12th International Conference, AISC 2014, Seville, Spain, December 11-13, 2014. Proceedings

This ebook constitutes the refereed complaints of the twelfth foreign convention on man made Intelligence and Symbolic Computation, AISC 2014, held in Seville, Spain, in December 2014. The 15 complete papers provided including 2 invited papers have been conscientiously reviewed and chosen from 22 submissions.

Statistical Language and Speech Processing: Third International Conference, SLSP 2015, Budapest, Hungary, November 24-26, 2015, Proceedings

This booklet constitutes the refereed court cases of the 3rd overseas convention on Statistical Language and Speech Processing, SLSP 2015, held in Budapest, Hungary, in November 2015. The 26 complete papers awarded including invited talks have been rigorously reviewed and chosen from seventy one submissions.

Additional info for Progress in Artificial Intelligence: 12th Portuguese Conference on Artificial Intelligence, EPIA 2005, Covilhã, Portugal, December 5-8, 2005. Proceedings

Example text

5 Selecting Minimal Diagnosis Typically in a preference revision problem, we only consider minimal diagnoses (wrt. set inclusion) and the problem that naturally arises is how to select the best ones. In some situations, we may ask the user for more information about his or her preferences in order to narrow down the alternatives. In other situations, we require a completely automatized approach. Thus, we need a selection function f (X) ⊆ X where X is a set of minimal diagnoses. Ideally f (X) is a singleton, otherwise we must arbitrarily choose one diagnosis from it.

Osorio, J. A. Navarro P´erez & J. Arrazola Safe Beliefs for Propositional Theories Ann. Pure & Applied Logic (in press). 16. D. Pearce, V. Sarsakov, T. Schaub, H. Tompits & S. Woltran. Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs. In Proc. of the 19th Int. Conf. on Logic Programming (ICLP’02), 405–420, 2002. 17. D. Pearce. A New Logical Characterisation of Stable Models and Answer Sets. In Non-Monotonic Extensions of Logic Programming, NMELP 96, LNCS 1216, pages 57–70.

In [12] several of the reduction rules of §3 were already proposed in order to show that nested programs can be reduced to generalised disjunctive programs. In [1] it is shown for the first time that arbitrary propositional theories have equivalent programs in the same vocabulary; but complexity issues are not discussed. In [16] a reduction is proposed for nested programs into disjunctive programs containing new atoms. The reduction is shown to be polynomial and has been implemented as a front-end to DLV called nlp.

Download PDF sample

Rated 4.69 of 5 – based on 49 votes