Deliverable N : R413. Covering period June.2003May.2004


 Melvin Barker
 1 years ago
 Views:
Transcription
1 REV!GIS REV!GIS: Uncertain Geographic Knowledge, Maintenance and Revision <IST > Algorithms for complex knowledge revision, v2 Deliverable N : R413 Covering period June.2003May.2004 Report Version: 1 Report Preparation Date: April 17 th, 2004 Classification: Int Contract Start Date: June 2000 Duration: 48 months Project Coordinator: Université de Provence, Marseille (Dr. R. Jeansoulin) Partners: ITC (NL), U. Keele (UK), U. Leicester (UK), TU Vienna (AT), CNR/ISTI (IT), U. Toulon (FR), CRG U. Laval (CA), Somei (FR) Here: the ST logo I Project funded by the European Community under the Information Society Technologies Programme ( ) Future and Emerging Technologies
2 DELIVERABLE SUMMARY SHEET Project Number: IST Project Acronym: REV!GIS Title: Uncertain Geographic Information Maintenance and Revision Deliverable N : R413 Due date: June, 1 st, 2004 Delivery Date: May, 5 th, 2004 Short Description: This deliverable reports on algorithms and Tractability issues for revision of knowledge. It summarizes the work performed during the previou years of the project, and develops what has been added during the last year of the project, which is:  Prioritized Removed Set Revision, (PRSR) principles, adaptation of smodel algorithms for PRSR,experimentation of PRSR on the flooding problem;  Removed Set Revision tranlated into a SAT problem, experimentation with the MINISAT solver on the flooding problem;  Removed Set Revision and ROBDD;  Revision in STP formalism;  Revision of partial preorders: algorithm and application;  Synthesis of Algorithms and Tractability issues. This last section provides basis for a sound selection of a revision strategy according to the characteristics of an application, in term of what structure order can emerge from the semantics of the user problem: the propositionalbased revision is always possible, but hardly tractable, polynomial revision is possible if a total preorder is present, and linearconstraintbased revision is appropriate and very fast, if a total and dense order exists behind the constraints and makes them linear. Partners owning: U. Toulon (Toulon, UK) Partners contributed: U. Provence (FR), U. Artois (FR), U. Laval (CA), U. Keele(UK), CNR (IT), SOMEI (FR), CEMAGREF(FR) Made available to: REV!GIS partners, ISTFET administration, project officer and reviewers. REVIGIS Project IST Delivery R413 2/11
3 Table of Contents: 1 PARTICIPATION AND MEETINGS SCIENTIFIC WORK SUMMARY OF PREVIOUS REPORTS FOR THIS TASK ADDITIONAL WORK DURING YEAR Prioritized Removed Set Revision (PRSR) principles, adaptation of smodel algorithms for PRSR, experimentation of PRSR on the flooding problem; Removed set revision tranlated into a SAT problem, experimentation with the MINISAT solver on the flooding problem; Removed Sets Revision and ROBDD Revision in the STP formalism; Revision of partial preorders: algorithm and application to the uncertain constraints on location problem Synthesis of the REVIGIS projecttask on Algorithms and Tractability issues REFERENCES FOR THIS SECTION : PROSPECTIVE AND FUTURE WORK LIST OF ANNEXES REVIGIS Project IST Delivery R413 3/11
4 1 Participation and Meetings Task Leader Odile Papini (PhD.) Professor, U. Toulon (Toulon, FR) Main Participants Eric Wurbel (PhD.) Senior Lecturer (Assistant Professor), U. Toulon (Toulon, FR)) Sylvain Lagrue (PhD) Associate Lecturer, SOMEI, and U. Artois (Lens, FR) Jonathan Bennaim (MsSc.)  PhD student, U. Toulon (Toulon, FR) Salem Benferhat (Dr.) Professor, U. Artois (Lens, FR) Mahat Khelfallah (MsSc.)  PhD student, U. Provence (Marseille, FR) Robert Jeansoulin (PhD.) Research fellow, U. Provence (Marseille, FR) Nic Wilson (PhD) postdoc, U. Keele (Keele, UK) Collaborators Christian Puech (PhD) directeur de recherche, CEMAGREF Damien Raclot (PhD) postdoc, CEMAGREF Belaid Benhamou(PhD) Assistant Professor, U. Provence (Marseille, UK) Chiara Renso (PhD) Research Fellow, CNR Pisa Geoffrey Edwards (PhD) Professor, U. Laval (Québec, CA) Mir Abolfazl Mostafavi(PhD) Postdoc, U. Laval (Québec, CA) Meetings (since start date)  Marseille (Full meeting, june 2000)  Keele (WP1 meeting, february 2001)  Quebec (Full meeting april 2001)  Toulouse (Full mee, september 2001)  Montpellier (WP1 meeting, september 2001)  Pisa (WP1 meeting, february 2002)  Marseille (February 2002, march 2002)  Enschede (Full meting, june 2002)  Toulon (PraxitecToulonCemagref, july 2002)  Marseille (1 st junior meeting, september 2002)  Pisa (CNRToulon, october 2002)  Marseille (PraxitecProvenceToulonKeele, january, february 2003)  Marseille (2 nd junior meeting, march 2003), full week  Lens (PraxitecLens, march, april 2003)  Marseille (3 rd junior meeting, june 2003), full week  Marseille (4 th junior meeting, september 2003), full week  Marseille (meeting october 2003)  Toulon (WP1. task 1.3 december 2003)  Toulouse(WP1. task 1.3 january 2004)  Marseille (WP1. task 1.3 february march 2003)  Toulouse (WP1. Task 1.3, january 2004)  Vienna (full meeting, during ISSDQ 2004 conference, april 2004) REVIGIS Project IST Delivery R413 4/11
5 2 Scientific work Introduction and description of the subtask of Task 1.3. Title: Reasoning under uncertainty with geographic knowledge: Algorithmic and Tractability Issues. Within the general objective of the workpackage #1: To survey and to develop the general formalisms for the representation of imperfect GI; To survey and to develop the computational approaches to reasoning with imperfect GI; To detect computational complexity issues and to propose solution whenever possible; To provide a goal oriented approach to integrate langage and architecture issue; To match particular approaches to corresponding classes of applications; To implement a demonstrator to illustrate the above objectives. The expectations and specific objective for Task 1.3 are: Several algorithms of 1.2 are basically NP complex. This task is to assess these algorithms, to define restrictions (linear case, convex subset, or cases isomorphic to "polynomial classes") and their specific algorithms, to implement into task 1.2version 2 algorithms series of software versions corresponding to time critical algorithms, tuned for specific applications: preliminary R113, specifications R213, v1, v2 (R313, R413) Subtasks:  Testing current divide and revise strategy on the flooding application (Toulon, UP, Cemagref): R Development of divide and revise strategy and assessment of a Prolog implementation (UP, Toulon). The development is expected in year 2: R Representing flooding constraints as DNNF and revision of these (Toulon): R Smodels: representing flooding constraints with logic programming, and revision (Toulon, CNR): R Application of Logic of Linear Constraints to flooding application (Keele, Cemagref, UP, Toulon, CNR): R Revision of partial preorders: tests on land use application (Toulon, IRIT): R DNNF representation: tests on flooding application (Toulon), will start Mar 02: R Smodels tests on flooding application (Toulon), will start Mar 02: R Heuristics for fusion/revision/updating of spatial data for WP3 (UP, TUW, Laval): R Application of generalised belief revision, possibility theory and DempsterShafer theory to flooding and similar problems (Keele, Cemagref, UP): part of R Summary of previous reports for this task During Year 1 and 2, we worked mainly on the implementation of the methods investigated in the task 1.2, and their application to the flooding problem. REVIGIS Project IST Delivery R413 5/11
6 Implementing classical formalisms for the flooding problem  Propositional calculus  Representation in Propositional calculus of geographic information  Propositional calculus for the flooding application  Comparison between three revision approaches o The REM algorithm o Formal comparison o Experimental comparison  Fuzzy Constraint Satisfaction Programming Developing algorithmic strategies:  Divide and Revise strategy  Representing constraints as Decomposable Negation Normal Forms  Representing constraints in Logic Programming (Smodels)  Representing constraints in the Logic of Linear Constraints Applying it to the flooding problem  Representation in terms of Linear Constraints, and Associated Propagation Algorithms  Applying Uncertainty Formalisms to the Problem Starting investigations on Revision of partial preorders (applic. to landcover classifications) During Year 3, we improved the work according to different directions:  1 Comparison between different approaches of revision on the Flooding Problem (Toulon with University of Provence, university of Keele and CEMAGREF). A comparison has been conducted on different revision approaches developped so far. These approaches can be classified into two categories: logical approaches of conflict detection and conflict resolution with propagation technics. The pros and the cons of each of these approaches lead to propose a mixed approach taking advantage of each of them.  2 Divide and revise strategy: piecewise revision for geographic information (University of Provence with university of Laval) In order to take into account the locality of conflicts, the notion of local containment and local reasoning are presented in 2.2, this is detailed in the annexed document Piecewise revision for geographic information, Annex DNNF and BDD approaches of revision (university of Toulon). We explain why the DNNF approach turned out to be problematical. We then investigated another knowledge compilation technique presented in 2.3, and detailed in the attached document Removed set revision and BDDs Annex Smodels: revision algorithm and implementation on the Flooding Problem (University of Toulon with university of Lens and CNR). In Annex Year 2 deliverable we showed how logic programming with negation by failure can be successfully applied to the Flooding Problem. In 2.4 we propose an adaptation of Smodels algorithm for revision and present an implementation on the Flooding Problem. The results clearly show that among logical approaches of conflict detection, this approach gives the most efficient ones. The approach is detailed in the attached document Answer set programming: an application in the framework of GIS Annex REVIGIS Project IST Delivery R413 6/11
7  5 Application of Logic of linear constraints to Flooding Problem (University of Keele with university of Provence and CEMAGREF) In Annex Year 2 deliverable, another new formalism stemming from the Logic of Linear Constraints (LLC), was proposed. In 2.5 it is shown how LLC can be successfully applied to the Flooding Problem. This is detailed in the attached document Geographic information revision based on linear constraints Annex Revision of partial preorders: algorithm and application to the uncertain constraints on location problem (PRAXITEC with university of Toulon with university of Artois, Lens). Stemming from the results obtained in WP1.1 about revision of partial preorders presented in year 2 deliverable Annex and Annex 211.5, and year 3 deliverable Annex 311.3, we propose in 2.6 an algorithm for performing revision of partially ordered beliefs and we show how our approach can be applied to uncertain constraints on location problem. 2.2 Additional work during Year Prioritized Removed Set Revision (PRSR) principles, adaptation of smodel algorithms for PRSR, experimentation of PRSR on the flooding problem; (university of Toulon, university of Artois, Lens) This is detailed in Annex 34.1 and Annex 34.7 Prioritized Removed Set Revision (PRSR) generalizes the Removed Set Revision, previously proposed R113, R213?, into the case of prioritized belief bases. Let K be a prioritized finite set of clauses, where K is partitioned into n strata, such that clauses in Ki have the same level of priority and are more prioritary than the ones in Kj where i is lower than j. K1 contains the clauses which are the most prioritary beliefs in K, and Kn contains the ones which are the least prioritary in K. When K is prioritized in order to restore consistency the principle of minimal change stems from removing the minimum number of clauses from K1, then the minimum number of clauses in K2, and so on. We introduce the notion of prioritized removed sets which generalizes the notion of removed set in order to perform Removed Sets Revision with prioritized sets of clauses. This generalization requires the introduction of a preference relation between subsets of K reflecting the principle of minimal change for prioritized sets of clauses. We then formalize the Prioritized Removed Sets Revision in terms of answer set programming. We first construct a logic program, in the same spirit of Niemela but, for each clause of K, we introduce a new atom and a new rule, such that the preferred answer sets of this program correspond to the prioritized removed sets of the union of K and A. We then define the notion of preferred answer set in order to perform PRSR. In order to get a one to one correspondence between preferred answer sets and prioritized removed sets, instead of computing the set of preferred answer sets of the union of P and A we compute the set of subsets of literals which are interpretations of Rk and that lead to preferred answer sets. The computation of Prioritized Removed Sets Revision is based on a new adaptation of the smodels system. This is achieved using two algorithms. The first algorithm, Prio, is an adaptation of smodels system algorithm which computes the set of subsets of literals of Rk which lead to preferred answer sets and which minimize the number of clauses to remove REVIGIS Project IST Delivery R413 7/11
8 from each stratum. The second algorithm, Rens, computes the prioritized removed sets of the union of K and A, applying the principle of minimal change for PRSR, that is, stratum by stratum. In the flooding application we have to deal with an aera consisting of 120 compartments and the stratification is usefull to deal with the whole aera. A stratification of S1 is induced from the geographic position of compartments. Compartments located in the north part of the valley are preferred to the compartments located in the south of the valley. An experimental study shows that using a stratification, the Rens algorithm can deal with the whole aera with a reasonable running time Removed set revision tranlated into a SAT problem, experimentation with the MINISAT solver on the flooding problem; (university of Toulon, university of Artois, Lens) This is detailed in Annex 34.7 The revision problem in the context of GIS is represented in propositional calculus and amounts to revise a knwoledge base K represented by a finite set of clauses by a new item of information A represented by another finite set of clauses. The revision method is the Removed Sets Revision which removes the minimal subsets of clauses from the initial knowledge base K, called removed sets, in order to restore consistency, while keeping the new information. We translated the Removed Sets Revision into a satisfiabily problem. We first apply a transformation on K, denoted by H(K), introducing for each clause of K, a new variable, called hypothesis variable, which acts as a clause selector. This transformation was initially proposed by De Kleer for ATMS. The Removed Sets Revision amounts to finding models of the union of H(K) and A which minimize the number of falsified hypothesis variable. In order to conduct an experimentation we used the solver MINISAT which won the 2003 competition for SAT solvers. We have experimented RSR with the MINISAT solver on the flooding problem; Removed Sets Revision and ROBDD (university of Toulon) This is detailed in Annex 34.2 Binary Decision Diagrams (BDD) are a compact and empirically efficient data structure for representing formulae in propositional logic. More precisely, BDDs allow a compact representation of the models of a formula. In the framework of the flooding application, we explored two possible uses of BDDs to achieve revision. The first approach, considering a K*A revision operation, we tried to encode all the knowledge of K and A into a single BDD, and then select suitable models of the revised knowledge. This approach appears to be intractable because of the huge data size. We recently developped a new approach which uses BDD. This approach relies on a semantic characterization of our revision operation, which leads to the building of three separate BDDs : one for the knowledge in K, one for the knowledge in A a a third BDD containing the preferece ordering on the knowledge which defines the revision strategy.this new approach have better partial results of complexity than the first one. REVIGIS Project IST Delivery R413 8/11
9 The theoretical model has been fully described, and now we start an experimental phase. This is a mandatory step when dealing with BDDs, as if the worst case complexity is still high, the mean case is too difficult to express theoretically, thus requiring an experimentation Revision in the STP formalism; (university of Provence) This is detailed in Annex 34.3 and in Annex 34.4 The Simple Temporal Problems formalism (STP), is based on linear constraints. We present a practical revision method based on STP resolution. Our revision method consists in the following steps:  The detection of conflicts: To detect the inconsistencies in an STP, we use an important result which stipulates that an STP is consistent if and only if its corresponding distance graph does not contain negative circuits. Thus, the detection of conflicts in an STP amounts to the detection of negative circuits in its graph of distance. To do this, we apply a modified version of the FloydWarshall algorithm (initially dedicated to computing the shortest paths in a graph).  Representation of detected conflicts as a graph, which we call the graph of conflicts. The vertices of this graph are the constraints involved in the conflicts and its edges represent the conflicts.  Identification of the smallest subsets of constraints whose the correction restores the consistency of the STP: amounts to the identification of minimal coverings (according to the cardinality) in the conflict graph.  Correction of the conflicting constraints identified in the previous step. The revision method presented in this section is implemented and tested on the Flooding problem Revision of partial preorders: algorithm and application to the uncertain constraints on location problem (SOMEI with university of Toulon and university of Artois, Lens) This detailed in Annex In R313 we proposed an algorithm for dealing with partially ordered constraints. We developped a system, mpropre to manage partially ordered constraints for building a construction. We have shown how to help an expert for finding the best place to build a house (condominium) in an urban area, according to several criteria both defined by city legislation and the property developer. These rules can sometimes be ordered by an expert according to their level of importance. Examples of rules are: 1. Field having a minimal area of m2; 2. Average field maximal slope of 6Â ; 3. Field situated at less than 2 kilometres of a commercial area; 4. Field situated at less than 150 meters from a fire hydrant. Usually, there is no parcel following all these rules. The expert can express its preference between some constraints but he can not always express a preference between all constraints: this leads to incomparablities. Despite this incomparablities, we are able to find the "best" REVIGIS Project IST Delivery R413 9/11
10 locations according to the constraints they satisfy or, dually, according to the constraints they falsify. For that, we need to build a preference relation between all the locations. We conducted an experimentation of our method on a data set on the city of Sherbrooke (Canada). For that, we have integrated mpropre to the commercial Geographic Information System Geomedia from Intergraph. We have considered 2782 parcels and 12 partially ordered constraints. The treatment was immediate and two parcels were chosen. An aerial snapshop confirm the properties of these parcels, what are the best we can find, according of the partial order on the constraints Synthesis of the REVIGIS projecttask on Algorithms and Tractability issues (Univ. Provence, Univ. Keele, Univ. Toulon, Univ. ArtoisLens, SOMEI) This detailed in Annex In year 3, in the R313 report we begun a comparison on the different methods and algorithms for revision in the framework of GIS. We enriched this work by a comparative study of different knowledge representation formalisms as well as the corresponding translation of the revision problem. 2.3 References for this section : Please refer to the Annex R413a1 or R413a2 for this list of stateoftheart references. 3 Prospective and future work Most of the work is, and will remain at an academic level. The first prospective step is to apply it in cooperation with application research institutes, such as Cemagref, CEH, etc. and possibly mapping agencies. Software publishers in GIS, and geographical applications are also concerned, at some regional SME in this domain, are invited to attend the review open meeting. The results obtained from the WP 1.3 could be of interest for applied research in the field of environmental science and for the companies that develop activities on GIS in the domain of environmental science, territory managment, and urban planning. 4 List of annexes Annex 34.1 "Révision d'une base de croyances dans le cadre de la programmation logique avec négation par échec : application à l'information géographique "J. Bennaim, DEA report, university of Toulon, june Annex 34.2 ``Revision par la méthode des rensembles et ROBDD''. Troisièmes Journées Nationales sur les Modèles de Raisonnement (JNMR'03). Proceedings of Journées sur le Raisonnement NonMonotone(JNMR'03). Daniel Kayser, Pierre Marquis et Amadeo Napoli ed. pages Paris, novembre REVIGIS Project IST Delivery R413 10/11
11 Annex ``Révision de contraintes temporelles : application au problème de l'inondation.'', B. Benhamou, M. Khelfallah, R. Jeansoulin, Proceedings of of Journées sur le Raisonnement NonMonotone(JNMR'03). Daniel Kayser, Pierre Marquis et Amadeo Napoli ed. pages Paris, novembre Annex ``Révision d'informations géographiques à base de contraintes temporelles'', B. Benhamou, M. Khelfallah, R. Jeansoulin, Proceedings of RFIA'2004 conference, Toulouse, january 2004 Annex 34.5 "Gestion d'informations partiellement ordonnées : raisonnement, revision et information géographique.", S. Lagrue, PhD Thesis, university of Toulon, december 2003 Annex `` Raisonner qualitativement avec des croyances partiellement ordonnées''. S, Benferhat, S. Lagrue, O. Papini, Proceedings of the conference Reconnaissance des Formes et Intelligence Artificielle (RFIA'04). p Toulouse. january 2004 Annex ``Answer set programming and revision: an application in the framework of GIS'' J. Bennaim, S. Benferhat, O. Papini, E. Wurbel. march 2004 Annex `` Revision in the framework of GIS : REV!GIS project a synthesis ''J. Bennaim, S, Benferhat, R. Jeansoulin, M. Khelfallah, S. Lagrue, O. Papini, N. Wilson, E. Wurbel. april 2004 Other publications : Full texts or Web links, etc. REVIGIS Project IST Delivery R413 11/11
PROFESSIONAL EXPERIENCE IN TEACHING AND RESEARCH
Odile BOIZARD Assistant Professor of Strategy and Competitivity KEDGE BUSINESS SCHOOL PROFESSIONAL +33 4 91 82 79 53 CELL +33 6 61 71 93 70 odile.boizard@kedgebs.com EDUCATION 2008 IHEDN (Institut des
More informationContents. Chapter 1: Introduction to Artificial Intelligence and Soft Computing
Contents Chapter 1: Introduction to Artificial Intelligence and Soft Computing 1.1 Evolution of Computing 1.2 Defining AI 1.3 General Problem Solving Approaches in AI 1.4 The Disciplines of AI 1.4.1 The
More informationPresented at SAT 2014, Vienna, Austria (*Won the best student paper award)
by Zack Newsham 1, Vijay Ganesh 1, Sebastian Fischmeister 1, Gilles Audemard 2, and Laurent Simon 3 1 University of Waterloo, 2 University of Artois and 3 University of Bordeaux Presented at SAT 2014,
More informationEconomic and Financial KnowledgeBased Processing
Louis F. Pau. Claudio Gianotti Economic and Financial KnowledgeBased Processing With 67 Figures SpringerVerlag Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Research Professor Louis
More informationReview for the Final Exam
Lecture slides for Automated Planning: Theory and Practice Review for the Final Exam Dana S. Nau University of Maryland 5:12 PM April 30, 2012 1 What We ve Covered Chapter 1: Introduction Chapter 2: Representations
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationClassical Planning. CS 486/686: Introduction to Artificial Intelligence
Classical Planning CS 486/686: Introduction to Artificial Intelligence 1 Outline Planning Problems Planning as Logical Reasoning STRIPS Language Planning Algorithms Planning Heuristics 2 Introduction Last
More informationA Beginner s Introduction to Heuristic Search Planning
A Beginner s Introduction to Heuristic Search Planning 7. Going Further Malte Helmert Gabriele Röger AAAI 2015 Tutorial January 25, 2015 What else happens...... in heuristic planning? Heuristics Other
More informationDialogue systems and planning
Dialogue systems and planning Guy Camilleri Abstract Planning processes are often used in dialogue systems to recognize the intentions conveyed in dialogue. The generation of utterances can also be achieved
More informationANNA UNIVERSITY SUBJECT NAME : ARTIFICIAL INTELLIGENCE SUBJECT CODE : CS2351 YEAR/SEM :III / VI QUESTION BANK UNIT I PROBLEM SOLVING 1. What is Intelligence? 2. Describe the four categories under which
More informationSupport of Contextual Classifier Ensembles Design
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1683 1689 DOI: 10.15439/2015F353 ACSIS, Vol. 5 Support of Contextual Classifier Ensembles Design Janina A. Jakubczyc
More informationAn Overview of Heuristic Knowledge Discovery for Large Data Sets Using Genetic Algorithms and Rough Sets
An Overview of Heuristic Knowledge Discovery for Large Data Sets Using Genetic Algorithms and Rough Sets Alina Lazar, PhD Youngstown State University H E U R I S T I C S Uninformed or blind search, which
More informationDistributed and MultiAgent Planning: Challenges and Open Issues
Distributed and MultiAgent Planning: Challenges and Open Issues Andrea Bonisoli Dipartimento di Ingegneria dell Informazione, Università degli Studi di Brescia, Via Branze 38, I25123 Brescia, Italy.
More informationReasoning about Plans*
Reasoning about Plans* Witold Lukaszewicz and Ewa MadalinskaBugaj Institute of Informatics, Warsaw University 02097 Warszawa, ul. Banacha 2, POLAND email: {witlu,ewama}@mimuw.edu.pl Abstract In classical
More information100 CHAPTER 4. MBA STUDENT SECTIONING
Summary Maastricht University is offering a MBA program for people that have a bachelor degree and at least 5 years of working experience. Within the MBA program, students work in groups of 5 during a
More informationDECISION SUPPORT TOOLS FOR NATURAL HAZARDS MANAGEMENT UNDER UNCERTAINTY
12 th Congress INTERPRAEVENT 2012 Grenoble / France Extended Abstracts www.interpraevent.at DECISION SUPPORT TOOLS FOR NATURAL HAZARDS MANAGEMENT UNDER UNCERTAINTY NEW APPROACHES BASED ON MULTICRITERIA
More informationUsing Users Expectations to Adapt Business Intelligence Systems.
Babajide AFOLABI and Odile THIERY Laboratoire Lorraine de Recherche en Informatique et ses Applications (LORIA) Campus Scientifique, BP 239 54506 Vandoeuvre  Lès  Nancy, France Using Users Expectations
More informationArtificial Intelligence Recap. Mausam
Artificial Intelligence Recap Mausam What is intelligence? (bounded) Rationality We have a performance measure to optimize Given our state of knowledge Choose optimal action Given limited computational
More informationRulebased Expert Systems
Rulebased Expert Systems What is knowledge? is a theoretical or practical understanding of a subject or a domain. is also the sim of what is currently known, and apparently knowledge is power. Those who
More informationArtificial Intelligence
Artificial Intelligence COMP241, Level6 Course CoordinatorMohammad Fahim Akhtar Faculty Members Dr. Mohammad Hassan, Adel AlQahtani Department of Computer Science Jazan University, KSA Chapter 5: Planning
More informationIntroductory Lecture
Introductory Lecture What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous) objects. Calculus deals with continuous objects
More informationOverview. Knowledge in AI. The Knowledge Principle. The Role of Knowledge. What is Knowledge? COMP219: Artificial Intelligence
COMP219: Artificial Intelligence Lecture 13: Knowledge Representation Last time Game playing Minimax decisions Alphabeta pruning Overview Today Introduce the need for explicit knowledge representation
More informationArtificial Intelligence and Human Thinking. Robert Kowalski Imperial College London
Artificial Intelligence and Human Thinking Robert Kowalski Imperial College London 1 2 AI tools and techniques can be reconciled and combined Logic Procedural representations Heuristics Production Systems
More informationCONSTRAINT PROGRAMMING FOR DYNAMIC SCHEDULING PROBLEMS
CONSTRAINT PROGRAMMING FOR DYNAMIC SCHEDULING PROBLEMS Abdallah Elkhyari, Christelle Guéret, and Narendra Jussien École des Mines de Nantes 4, rue Alfred Kastler BP 20722 F44307 Nantes Cedex 3 France
More informationAutomatic Induction of MAXQ Hierarchies
Automatic Induction of MAXQ Hierarchies Neville Mehta, Mike Wynkoop, Soumya Ray, Prasad Tadepalli, and Tom Dietterich School of EECS, Oregon State University Scaling up reinforcement learning to large
More informationArtificial Intelligence Lecture 9
Artificial Intelligence Lecture 9 Lecture plan Prolog Probabilities AI in general (ch. 1) Search based AI (ch. 4) search, games, planning, optimization Agents (ch. 8) applied AI techniques in robots, software
More informationCorrecting erroneous N+N structures in the productions of French users of English
The Call Triangle: student, teacher and institution Correcting erroneous N+N structures in the productions of French users of English Marie Garnier Equipe Cultures AngloSaxonnes, Université Toulouse Le
More informationA Classification Method using Decision Tree for Uncertain Data
A Classification Method using Decision Tree for Uncertain Data Annie Mary Bhavitha S 1, Sudha Madhuri 2 1 Pursuing M.Tech(CSE), Nalanda Institute of Engineering & Technology, Siddharth Nagar, Sattenapalli,
More informationarxiv:cmplg/ v1 3 May 1996
Active Constraints for a Direct Interpretation of HPSG arxiv:cmplg/9605006v1 3 May 1996 1 Introduction Philippe Blache and JeanLouis Paquelin 2LC  CNRS 1361 route des Lucioles F06560 Sophia Antipolis
More informationA MULTIAGENT SYSTEM FOR A DISTANCE SUPPORT IN EDUCATIONAL ROBOTICS
A MULTIAGENT SYSTEM FOR A DISTANCE SUPPORT IN EDUCATIONAL ROBOTICS Sébastien GEORGE Christophe DESPRES Laboratoire d Informatique de l Université du Maine Avenue René Laennec, 72085 Le Mans Cedex 9, France
More informationSome characteristics of Instructional Design. for Industrial Training
Some characteristics of Instructional Design for Industrial Training Claude Frasson Université de Montréal, Département d'informatique et de recherche opérationnelle 2920 Chemin de la Tour, Montréal, H3T
More informationCPSC 533 Reinforcement Learning. Paul Melenchuk Eva Wong Winson Yuen Kenneth Wong
CPSC 533 Reinforcement Learning Paul Melenchuk Eva Wong Winson Yuen Kenneth Wong Outline Introduction Passive Learning in an Known Environment Passive Learning in an Unknown Environment Active Learning
More informationLast Class: Agents acting in an environment
Last Class: Agents acting in an environment Abilities Goals/Preferences Prior Knowledge Agent Observations Past Experiences Environment Actions Clicker Question The ability of the agent is: A What functions
More informationORF 363/COS 323 Computing and Optimization in the Physical and Social Sciences
ORF 363/COS 323 Computing and Optimization in the Physical and Social Sciences Amir Ali Ahmadi Princeton, ORFE Lecture 1 Fall 2015 1 What is optimization? Roughly, can think of optimization as the science
More informationPerception for robot autonomy. Perception for robot autonomy
Perception for robot autonomy Martial Hebert Drew Bagnell Tony Stentz Perception for robot autonomy Sensor input Perception algorithms Interpretation Execution 1 Perception for robot autonomy From sensor
More informationScholarship Application Guide
Fonds de recherche du Québec  Nature et technologies Scholarship Application Guide «Building on Excellence» TABLE OF CONTENTS Page Foreword... 3 Introduction... 4 Section 1: Suggestions for applicants...
More informationA sofware for a new data analysis method : CHIC
A sofware for a new data analysis method : CHIC Marc BAILLEUL Institut Universitaire de Formation des Maîtres CAEN, FRANCE Abstract : CHIC : what does it stand for? Hierarchical Implicative and Cohesitive
More informationJournée de la Recherche du LAMSADE
Journée de la Recherche du LAMSADE Brice Mayag brice.mayag@dauphine.fr LAMSADE 15 Mars 2012 brice.mayag@dauphine.fr (LAMSADE) Journée de la Recherche du LAMSADE 15 Mars 2012 1 / 19 Formation Who am I?
More informationMathematics Courses1
Mathematics Courses1 Courses marked as additive credit are considered creditbearing for the purposes of financial aid, tuition, and the determination of fulltime student status, but do not count toward
More informationAli ELouafiq Supervised by: Dr. Violetta Cavalli Sforza CSC3309 Machine Cognitive Models
Ali ELouafiq Supervised by: Dr. Violetta Cavalli Sforza CSC3309 Machine Cognitive Models 1. Introduction: Through history, the human being tried to relay its daily tasks to other creatures, which was the
More informationHybrid Logical Bayesian Networks
Hybrid Logical Bayesian Networks Irma Ravkic, Jan Ramon, and Jesse Davis Department of Computer Science KU Leuven Celestijnenlaan 200A, B3001 Heverlee, Belgium irma.ravkic@cs.kuleuven.be jan.ramon@cs.kuleuven.be
More informationK 12 Inquiry and Design (Science Practices)
K 12 Inquiry and Design (Science Practices) The nature of science and technology is characterized by applying process knowledge that enables students to become independent learners. These skills include
More informationInterdicting Networks to Competitively Minimize Evasion with Synergy Between Applied Resources
Interdicting Networks to Competitively Minimize Evasion with Synergy Between Applied Resources Brian J. Lunday 1 Hanif D. Sherali 2 1 Department of Mathematical Sciences, United States Military Academy
More informationDocumentation Tool: an Object oriented Model for Electronic Library Management
Documentation Tool: an Object oriented Model for Electronic Library Management Saad Harous Dept. of Computer Science University of Sharjah Sharjah, UAE Djamila Mechta Département d Informatique, Faculté
More informationAdvanced Mathematical Topics
K12 Mathematics Introduction The Georgia Mathematics Curriculum focuses on actively engaging the students in the development of mathematical understanding by using manipulatives and a variety of representations,
More informationMachine Learning and Artificial Neural Networks (Ref: Negnevitsky, M. Artificial Intelligence, Chapter 6)
Machine Learning and Artificial Neural Networks (Ref: Negnevitsky, M. Artificial Intelligence, Chapter 6) The Concept of Learning Learning is the ability to adapt to new surroundings and solve new problems.
More informationArtificial Intelligence with DNN
Artificial Intelligence with DNN JeanSylvain Boige Aricie jsboige@aricie.fr Please support our valuable sponsors Summary Introduction to AI What is AI? Agent systems DNN environment A Tour of AI in DNN
More informationComputational Linguistics: Syntax II
Computational Linguistics: Syntax II Raffaella Bernardi KRDB, Free University of BozenBolzano P.zza Domenicani, Room: 2.28, email: bernardi@inf.unibz.it Contents 1 Recall....................................................
More informationChapter 1. Introduction. Expert System Applications in Chemistry. 1Rohm and Haas Company, Spring House, PA 19477
Chapter 1 Introduction Expert System Applications in Chemistry Bruce A Hohne 1 and Thomas H. Pierce 2 1Rohm and Haas Company, Spring House, PA 19477 2 Rohm and Haas Company, Bristol, PA 19007 This symposium
More informationAdvanced Finite Mathematics
K12 Mathematics Introduction Georgia Mathematics focuses on actively engaging the student in the development of mathematical understanding by working independently and cooperatively to solve problems,
More informationCAP 4630 Artificial Intelligence
CAP 4630 Artificial Intelligence Instructor: Sam Ganzfried sganzfri@cis.fiu.edu 1 Brains vs. AI Competition https://www.youtube.com/watch?v=phrayf1rq0i 2 What is AI? 3 Acting humanly Turing test: https://www.youtube.com/watch?v=sxxppebr7k
More informationARTIFICIAL INTELLIGENCE
1 ARTIFICIAL INTELLIGENCE Networks and Communication Department Lecture 5 By: Latifa ALrashed Outline q q q q q q q Define and give a brief history of artificial intelligence. Describe how knowledge is
More informationExam for IN4oloTU Artificial Intelligence Techniques
Exam for IN4oloTU Artificial Intelligence Techniques 26 January 2006 This exam will test your knowledge and understanding of Russell and Norvig, Artzficial Intelligence: A Modern Approach. Using the book
More informationMathematical Sciences
Mathematical Sciences Associate Professors McKenzie R. Lamb (Chair), David W. Scott, Andrea N. Young Visiting Professors Mark A. Krines, William S. Retert Communicating Plus  Mathematical Sciences: Students
More informationDecision Making Tools in. Project Management
Decision Making Tools in Project Management Referent: Magid Al Araki 27 November 2006 400 402 403 406 Content 1. Introduction... 1 2. Plus, Minus and Interesting (PMI)... 2 3. Annalistic hierarchy process
More informationPERFORMANCE EVALUATION OF ECOLLABORATION
PERFORMANCE EVALUATION OF ECOLLABORATION Raoudha Chebil and Wided Lejouad Chaari Laboratoire d'ingénierie Informatique Intelligente (LI3)ISG Tunis Ecole Nationale des Sciences de l Informatique Université
More informationSOFTCOMPUTING IN MODELING & SIMULATION
SOFTCOMPUTING IN MODELING & SIMULATION 9th July, 2002 Faculty of Science, Philadelphia University Dr. Kasim M. AlAubidy Computer & Software Eng. Dept. Philadelphia University The only way not to succeed
More informationAQUA: An OntologyDriven Question Answering System
AQUA: An OntologyDriven Question Answering System Maria VargasVera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
More informationApplying machine learning techniques to improve user acceptance on ubiquitous environment
Applying machine learning techniques to improve user acceptance on ubiquitous environment Djallel Bouneffouf Djallel.bouneffouf@itsudparis.eu Abstract. Ubiquitous information access becomes more and more
More informationThe Need for Dierent DomainIndependent Heuristics. Peter Stone and Manuela Veloso and Jim Blythe. Carnegie Mellon University
The Need for Dierent DomainIndependent Heuristics Peter Stone and Manuela Veloso and Jim Blythe School of Computer Science Carnegie Mellon University Pittsburgh PA 15213389 fpstone, veloso, blytheg@cs.cmu.edu
More informationRound robin scheduling a survey
DEPARTMENT OF OPERATIONS RESEARCH UNIVERSITY OF AARHUS Working Paper no. 2006 / 2 2006 / 06 / 29 Round robin scheduling a survey Rasmus V. Rasmussen and Michael A. Trick ISSN 16008987 Department of Mathematical
More informationEfficient Text Summarization Using Lexical Chains
Efficient Text Summarization Using Lexical Chains H. Gregory Silber Computer and Information Sciences University of Delaware Newark, DE 19711 USA silber@udel.edu ABSTRACT The rapid growth of the Internet
More informationFoundations of Algebra
Course Design Information for Foundations of Algebra 1. Longterm Behaviors What the student should learn to practice in life, personally and professionally 2. Broad Learning Goals Key learning objectives
More informationSeminar  Organic Computing
Seminar  Organic Computing SelfOrganisation of OCSystems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SOSystems 3. Concern with Nature 4. DesignConcepts
More informationCOMBINED SCIENCE INTRODUCTION
(revised as of April 2013) COMBINED SCIENCE INTRODUCTION The public assessment of this subject is based on the Curriculum and Assessment Guide (Secondary 46) Combined Science jointly prepared by the Curriculum
More informationIAI : Machine Learning
IAI : Machine Learning John A. Bullinaria, 2005 1. What is Machine Learning? 2. The Need for Learning 3. Learning in Neural and Evolutionary Systems 4. Problems Facing Expert Systems 5. Learning in Rule
More informationExplaining similarity in CBR
Explaining similarity in CBR Eva Armengol, Santiago Ontañón and Enric Plaza Artificial Intelligence Research Institute (IIIACSIC) Campus UAB, 08193 Bellaterra, Catalonia (Spain) Email: {eva, enric}@iiia.csic.es
More informationCOMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection.
COMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection. Instructor: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/comp551 Unless otherwise
More informationP(A, B) = P(A B) = P(A) + P(B)  P(A B)
AND Probability P(A, B) = P(A B) = P(A) + P(B)  P(A B) P(A B) = P(A) + P(B)  P(A B) Area = Probability of Event AND Probability P(A, B) = P(A B) = P(A) + P(B)  P(A B) If, and only if, A and B are independent,
More informationTableaux for Diagrammatic Reasoning
Tableaux for Diagrammatic Reasoning Octavian Patrascoiu 1, Simon Thompson 1, and Peter Rodgers 1 1 Computing Laboratory, University of Kent, United Kingdom {O.Patrascoiu, S.J.Thompson, P.J.Rodgers}@kent.ac.uk
More informationInternet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 7: Expert Systems
Internet Engineering Jacek Mazurkiewicz, PhD Softcomputing Part 7: Expert Systems RuleBased Expert Systems Introduction, or what is knowledge? Rules as a knowledge representation technique The main players
More informationOn ProjecFon using SAT/SMT
On ProjecFon using SAT/SMT Jörg Brauer (RWTH Aachen University) Andy King (Portcullis Computer Security) Jael Kriener (University of Kent) 05.03.2012 @ MPI, Saarbrücken Myself Diploma in CS from University
More informationModel Checking as Planning and Service
Model Checking as Planning and Service B.Comp. Dissertation Li Yi Department of Computer Science School of Computing National University of Singapore April 19, 2011 Li Yi (National University of Singapore)
More informationSimilarity, Homothety and Thales theorem together for an effective teaching
Similarity, Homothety and Thales theorem together for an effective teaching Élgar Gualdrón  Pamplona University (Pamplona, Colombia)  egualdron@unipamplona.edu.co Joaquín Giménez  Barcelona University
More informationUnsupervised Learning
09s1: COMP9417 Machine Learning and Data Mining Unsupervised Learning June 3, 2009 Acknowledgement: Material derived from slides for the book Machine Learning, Tom M. Mitchell, McGrawHill, 1997 http://www2.cs.cmu.edu/~tom/mlbook.html
More informationAvailable online at ScienceDirect. Procedia Engineering 123 (2015 ) Creative Construction Conference 2015 (CCC2015)
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 123 (2015 ) 198 207 Creative Construction Conference 2015 (CCC2015) Investigation of critical activities in a network with pointtopoint
More informationNOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or
NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying
More informationLearning Software Engineering with Group Work
Learning Software Engineering with Group Work Maria Isabel Alfonso and Francisco Mora Dept. of Computer Science and Artificial Intelligence. University of Alicante. Spain eli@dccia.ua.es, mora@dccia.ua.es
More informationFormal Models in AGI Research
Formal Models in AGI Research Pei Wang Temple University, Philadelphia PA 19122, USA http://www.cis.temple.edu/ pwang/ Abstract. Formal models are necessary for AGI systems, though it does not mean that
More informationSelected Aspects of Temporal Knowledge Engineering
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems pp. 1091 1096 DOI: 10.15439/2014F290 ACSIS, Vol. 2 Selected Aspects of Temporal Knowledge Engineering Maria MachKról
More informationLearning Concept Classification Rules Using Genetic Algorithms
Learning Concept Classification Rules Using Genetic Algorithms Kenneth A. De Jong George Mason University Fairfax, VA 22030 USA kdejong@aic.gmu.edu William M. Spears Naval Research Laboratory Washington,
More informationA mathematical formulation for a school bus routing problem
A mathematical formulation for a school bus routing problem Patrick Schittekat 1, Marc Sevaux 2, Kenneth Sörensen 3 1 University of Antwerp, Belgium (patrick.schittekat@ua.ac.be) 2 University of South
More informationIII/IV B.Tech, (Regular/Supplementary) DEGREE EXAMINATION
November, 2016 Fifth Semester Time: Three Hours Answer Question No.1 compulsorily. Answer ONE question from each unit. III/IV B.Tech, (Regular/Supplementary) DEGREE EXAMINATION 14CS506/A Computer Science
More informationCLARINPL a Polish Language Technology Infrastructure for the Users
a Polish Language Technology Infrastructure for the Users Maciej Piasecki Wrocław University of Technology G4.19 Research Group maciej.piasecki@pwr.wroc.pl Users make problems Users make all software systems
More informationEvaluation and Comparison of Performance of different Classifiers
Evaluation and Comparison of Performance of different Classifiers Bhavana Kumari 1, Vishal Shrivastava 2 ACE&IT, Jaipur Abstract: Many companies like insurance, credit card, bank, retail industry require
More informationMathematics for Access to Honours Bachelor Degree STEM (Science, Technology, Engineering and Mathematics) Programmes
Mathematics for Access to Honours Bachelor Degree STEM (Science, Technology, Engineering and Mathematics) Programmes Introduction Many prospective students are ineligible for enrolment on STEM programmes
More informationArtificial Intelligence. agents
Notes adapted from lecture notes for CMSC 421 by B.J. Dorr Artificial Intelligence 1: logic agents Lecturer: Tom Lenaerts Institut de Recherches Interdisciplinaires et de Développements en Intelligence
More informationVisualization of Differences in Data Measuring Mathematical Skills
Visualization of Differences in Data Measuring Mathematical Skills Lukáš Zoubek, Michal Burda {Lukas.Zoubek, Michal.Burda}@osu.cz Department of Information and Communication Technologies, Pedagogical Faculty,
More informationHow does the ISA align with the IB curriculum?
How does the ISA align with the IB curriculum? More than twothirds of ISA schools use an International Baccalaureate (IB) component in their curriculum. This document shows how the ISA assessments can
More information6 CONCLUSIONS FURTHER RESEARCH
CHAPTER 6 6 CONCLUSIONS FURTHER RESEARCH The purpose of the current thesis is to describe the most appropriate statistical models and methods in order to analyze hierarchical data structures. In the first
More informationIEEE TRANSACTIONS ON MULTIMEDIA, VOL. 11, NO. 1, JANUARY
IEEE TRANSACTIONS ON MULTIMEDIA, VOL 11, NO 1, JANUARY 2009 101 A Framework for Foresighted Resource Reciprocation in P2P Networks Hyunggon Park, Student Member, IEEE, and Mihaela van der Schaar, Senior
More informationCaseBased Reasoning A Short Introduction
CaseBased Reasoning A Short Introduction Christiane Gresse von Wangenheim 1. Introduction CaseBased Reasoning (CBR) [BBL + 98,Wes95,AP94,Kol93] is an approach to develop knowledgebased systems that
More informationAn Extractive Approach of Text Summarization of Assamese using WordNet
An Extractive Approach of Text Summarization of Assamese using WordNet Chandan Kalita Department of CSE Tezpur University Napaam, Assam784028 chandan_kalita@yahoo.co.in Navanath Saharia Department of
More informationEducation. Research Areas. Publications. Jocelyn Martel. Academic Publications. Articles. Contact
Education Jocelyn Martel Professor, Department Finance CoDirector, Chair ESSEC  AMUNDI Chair on Asset & Risk Management Ph.D. Economics, University of Montreal, 1994 Field: Financial Economics Thesis:
More informationNGSS Science and Engineering Practices* (March 2013 Draft)
Science and Engineering Practices Asking Questions and Defining Problems A practice of science is to ask and refine questions that lead to descriptions and explanations of how the natural and designed
More informationPlanning: Representation
Planning: Representation Alan Mackworth UBC CS 322 Planning 1 February 13, 2013 Textbook 8.08.2 Reminders Coming up:  Assignment 2 due on Friday, 1pm  Midterm Wednesday, Mar 6: DMP 110, 33:50pm  ~60%
More informationAnnotating and measuring temporal relations in texts
Annotating and measuring temporal relations in texts Philippe Muller IRIT, Université Paul Sabatier Toulouse, France muller@irit.fr avier Tannier IRIT, Université Paul Sabatier Toulouse, France tannier@emse.fr
More informationA Cognitive Model of Analytical Reasoning Using GRE Problems
A Cognitive Model of Analytical Reasoning Using GRE Problems Final Project: Cognitive Modeling and Intelligent Tutoring Systems Scott B Kaufman skaufman@cmu.edu Helen J Ross hjr@andrew.cmu.edu Friday,
More informationA Characterization of Prediction Errors
A Characterization of Prediction Errors Christopher Meek Microsoft Research One Microsoft Way Redmond, WA 98052 Abstract Understanding prediction errors and determining how to fix them is critical to building
More informationCOMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection.
COMP 551 Applied Machine Learning Lecture 6: Performance evaluation. Model assessment and selection. Instructor: Herke van Hoof (herke.vanhoof@mail.mcgill.ca) Slides mostly by: Class web page: www.cs.mcgill.ca/~hvanho2/comp551
More information