Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrea Orlandini

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Carla Limongelli

> Home > Persons > Andrea Orlandini

Publications

2023
[e9]
- view
- export record
  dblp key:
  - conf/aiia/2023dp
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/2023dp
Roberto Basili, Domenico Lembo, Carla Limongelli, Andrea Orlandini:
Proceedings of the Discussion Papers - 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023 DP) co-located with 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), Rome, Italy, November 6-9, 2023. CEUR Workshop Proceedings 3537, CEUR-WS.org 2023 [contents]
[e7]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/2023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/2023
Roberto Basili, Domenico Lembo, Carla Limongelli, Andrea Orlandini:
AIxIA 2023 - Advances in Artificial Intelligence - XXIInd International Conference of the Italian Association for Artificial Intelligence, AIxIA 2023, Rome, Italy, November 6-9, 2023, Proceedings. Lecture Notes in Computer Science 14318, Springer 2023, ISBN 978-3-031-47545-0 [contents]
2007
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/jolli/MayerLOP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jolli/MayerLOP07
Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Linear temporal logic as an executable semantics for planning languages. J. Log. Lang. Inf. 16(1): 63-89 (2007)
2005
[j1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/ia/CialdeaLOP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ia/CialdeaLOP05
Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
A Proposal for Planning with Graded Fluents and Actions. Intelligenza Artificiale 2(4): 66-73 (2005)
[c5]
- view
  - electronic edition @ ijcai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ijcai/CialdeaLOP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/CialdeaLOP05
Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Planning with graded fluents and actions. IJCAI 2005: 1711-1712
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/tableaux/MayerLOP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tableaux/MayerLOP05
Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Pdk: The System and Its Language. TABLEAUX 2005: 307-311
2003
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/MayerLOP03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/MayerLOP03
Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini, Valentina Poggioni:
Planning under Uncertainty in Linear Time Logic. AI*IA 2003: 324-335
2000
[c1]
- view
  - electronic edition @ aaai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/aips/MayerOBL00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aips/MayerOBL00
Marta Cialdea Mayer, Andrea Orlandini, Giulio Balestreri, Carla Limongelli:
A Planning Fully Based on Linear Time Logic. AIPS 2000: 347-354

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.