Risultati scientifici Progetto MIUR PRIN 2008 n.20089M932N - Anno 2010-2011 Unità di Perugia

Page created by Roger Delgado

Finance

English

Like
Share
Embed
Fullscreen
Slides
Download HTML
Download PDF
Abuse

←

→

Page content transcription

If your browser does not render page correctly, please read the page content below

Risultati scientifici Progetto MIUR
PRIN 2008 n.20089M932N
Anno 2010-2011
Unità di Perugia

People                                       PostDoc
                                                 Santini Francesco CWI,
                                                 Netherlands
   Bistarelli Stefano responsabile unità di     Trubitsyna   Irina Università della
    ricerca Dip. Matematica e                    Calabria
    Informatica Università degli Studi di
    Perugia bista(at)dmi.unipg.it                Dottorandi
   Formisano Andrea Dip. Matematica e           Bottalico Marco Dip.
    Informatica Università degli Studi di        Scienze Università G.d'Annunzio Chieti -
    Perugia formis(at)dipmat.unipg.it            Pescara bottalic(at)sci.unich.it
   Poggioni Valentina Dip. Matematica e         Campagna    Dario Dip. Matematica e
    Informatica Università degli Studi di        Informatica Università degli studi di
    Perugia poggioni(at)dmi.unipg.it             Perugia
                                                 Campli  Paola Dip.
Componenti di altre Università / Enti vigilati   Scienze Università G.d'Annunzio Chieti -
                                                 Pescara campli(at)sci.unich.it
   Meo Maria Chiara Dip.
    Scienze Università G.d'Annunzio Chieti -     Gosti  Giorgio Dip. Matematica e
    Pescara meo(at)sci.unich.it                  Informatica Università degli studi di
                                                 Perugia

Obiettivi
   La proposta dell'unità di ricerca di Perugia
    verte sulle estensioni del framework di
    vincoli soft con paradigmi di
    programmazione concorrente e logica
    nonmonotona con applicationi alla QoS e
    alla Bioinformatica.

UniPg (A. Formisano)
   Comparison, integration and mutual support between CLP and ASP
    [JETAI09].
   Action description languages in CLP(FD), declarative specification
    languages and planners, multiagency, distribution, concurrency, and
    coordination.
    [TPLP10,TPLP11,FI10a,DFP65,LPNMR09,CILC10a,CILC09a].
   Extensions of ASP for quantitative modeling of processes
    consuming/producing of resources, possibly involving preferences.
    [JLC10,FI10b,JALGOR09,LPNMR11,AAAI11,CILC09b,GTTV11].
   Software:
    clpplan, BMAP, BMV, BAAC: Declarative planning and multi-agent
    planning in CLP. http://users.dimi.uniud.it/~agostino.dovier/CLPASP
    Raspberry: Enabling declarative reasoning on consumption and
    production of resources. http://www.dmi.unipg.it/~formis/raspberry

Articoli
   [JETAI09]. Dovier, Formisano, Pontelli. An Empirical Study of
    Constraint Logic Programming and Answer Set Programming
    Solutions of Combinatorial Problems. JETAI, 21(2):79-121. 2009.
    [TPLP10] Dovier, Formisano, Pontelli. Multi-valued Action Languages
    with Constraints in CLP(FD). TPLP, 10(2):167-235. 2010.
   [TPLP11] Dovier, Formisano, Pontelli. Autonomous Agents
    Coordination: Action Description Languages meet CLP(FD) and
    Linda. TPLP, To appear. 2011.
    [FI10a] Dovier, Formisano, Pontelli. An Investigation of Multi-agent
    Planning in CLP. Fundamenta Informaticae, 105(1-2):1-33. 2010.
   [DFP65] Dovier, Formisano, Pontelli. Perspectives on Logic-based
    Approaches for Reasoning About Actions and Change. In Logic
    Programming, Knowledge Representation, and Nonmonotonic
    Reasoning. 2011. [LPNMR09] Dovier, F., Pontelli. Representing
    Multi-agent Planning in CLP. Proc. of LPNMR09, LNCS 5753, 2009.
   [CILC10a] Dovier, Formisano, Pontelli. Autonomous Agents
    Coordination: Action Description Languages meet CLP(FD) and
    Linda. Proc. of CILC’10.

Articoli
   [CILC09a] Dovier, F., Pontelli. Multi-agent planning in CLP. Proc. of
    CILC’09.
    [JLC10 Costantini, F.. Answer Set Programming with Resources.
    Journal of Logic and Computation, 20(2):533-571. 2010.
   [FI10b] Costantini, F., Petturiti. Extending and Implementing RASP.
    Fundamenta Informaticae, 105(1-2):79-103. 2010
    [JALGOR09] Costantini, F.. Modeling Preferences and Conditional
    Preferences on Resource Consumption and Production in ASP.
    Journal of Algorithms in Cognition, Informatics and Logic, 64(1):3-
    15. 2009.
    [LPNMR11] Costantini, F.. Weight Constraints with Preferences in
    Answer Set Programming. Proc. of LPNMR 2011, LNCS 6645, 2011.
    [AAAI11] Costantini, F.. Augmenting Weight Constraints with
    Complex Preferences. Proc. of Commonsense11, AAAI Spring
    Symposium, 2011.
    [CILC09b] F., Petturiti. Extending and implementing RASP. Proc. of
    CILC’09, 2009.
    [GTTV11] Costantini, F., Pearce. Strong Equivalence of RASP
    Programs. Proc. of GTTV11 – LPNMR workshop, 2011.

UniPg (Poggioni)
   ACOPlan is a planner based on the ant colony
    optimization framework, in which a colony of planning
    ants searches for near optimal solution plans with
    respect to an overall plan cost metric. Planning ants
    perform a stochastic and heuristic based search by
    interacting through a pheromone model

   Baioletti, Milani, Poggioni, Rossi. The ACOPlan Planner.
    "The 2011 International Planning Competition"
   Baioletti, Milani, Poggioni, Rossi. The ACOPlan Planner:
    multicore version "The 2011 International Planning
    Competition"

UniPg (Campagna)
   Development of a CLP-based interactive configuration
    system (Morhpos Configuration Engine) with Acritas
    S.r.l.
   Improvements over existing Acritas configuration
    system (Morphos) in terms of modeling language
    expressiveness, model maintainability, and choice
    consequences computation

Publications
D. Campagna, C. De Rosa, A. Dovier, A. Montanari, and C. Piazza. Morphos
Configuration Engine: the Core of a Commercial Configuration System in
CLP(FD). Fundam. Inform., 105(1-2):105–133, 2010.

Product and Process Configuration
     Development of a graphical framework (ProdProc) for
      both product and production process modeling and
      configuration
     Extension of MCE and Aldanondo et al. works
     A modeling and configuration tool is being implemented
      on top of ProdProc

Publications
D. Campagna, A Graphical Framework for Supporting Mass Customization.
In Proceedings of the IJCAI'11 Workshop on Configuration, pages 1-8, 2011.

D. Campagna, A. Formisano. ProdProc - Product and Production Process
Modeling and Configuration. In 26th Italian Conference on Computational
Logic (CILC 2011). Pescara, Italy, August 2011.

UniCh (Bottalico)
   Ribosome Database: classifying ribosomal
    proteins of Saccharomyces Cerevisiae, taking
    info from all the databases in literature in order
    to be able to query a common database

   Bottalico, Caianello, Di Marco, Gallo, Spano’,
    Ribosome Database: from map to function,
    work in progress. (collaboration with UnivAq)

UniPg (Bistarelli, Gosti, Santini)
 Argumentation: development of a tool
  that manage argument extensions with
  constraints (ConArg)
 Solving Fuzzy Distributed CSPs with
  Naming Games
 Deduction and Abduction in CHR inside a
  mobile devices environment
 Arc consistency to deal with (absorptive)
  semirings that may not be invertible.
 Nonmonotonic Soft CCP

Journal
   S. Bistarelli, F. Fioravanti, P,. Peretti, F. Santini, “Evaluation of complex
    security scenarios using defense trees and economic indexes”, to
    appear in Journal of Experimental & Theoretical Artificial
    Intelligence.
    S. Bistarelli, F. Gadducci, J. Larrosa, E. Rollon, F. Santini, "Local Arc
    Consistency for Non-Invertible Semirings, with an Application to
    Multi-Objective Optimization", to appear in Expert Systems with
    Applications, Eslevier.
   S. Bistarelli, F. Santini, "A Nonmonotonic Soft Concurrent
    Constraint Language to Model the negotiation Process" to appear
    in Fundamenta Informaticae

Workshop & conferences
   S. Bistarelli, P. Campli, F. Santini: Finding partitions of arguments with
    Dung's properties via SCSPs. SAC 2011: 913-919
   S. Bistarelli, F. Santini: ConArg: A Constraint-based Computational
    Framework for Argumentation Systems, to appear in ICTAI 2011,
    IEEE
   S. Bistarelli, G. Gosti, F. Santini, “Solving Fuzzy DCSPs with Naming
    Games”, to appear in ICTAI 2011
   S. Bistarelli, F. Santini: ConArg: A Constraint-based Computational
    Framework for Argumentation Systems, TAFA 2011, LNAI, Springer
   “Solving Fuzzy DCSPs with Naming Games”, S. Bistarelli, G. Gosti, F.
    Santini, Annual ERCIM Workshop on Constraint Solving and
    Constraint Logic Programming, CSCLP 2011
   S. Bistarelli, G. Gosti, F. Santini, “Solving Fuzzy DCSPs with Naming
    Games”, RCRA11
   S. Bistarelli, F. Martinelli, F. Santini, CHR Abduction and Deduction
    Inferences for Trust-based Access Authorization on Mobile Devices,
    ITAIS 201, Springer

You can also read