Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Luca Pulina

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 Marco Maratea

> Home > Persons > Luca Pulina

Publications

2018
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/constraints/GiunchigliaMP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/constraints/GiunchigliaMP18
Enrico Giunchiglia, Marco Maratea, Luca Pulina:
Translation-based approaches for solving disjunctive temporal problems with preferences. Constraints An Int. J. 23(4): 383-402 (2018)
2015
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/logcom/MarateaPR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/MarateaPR15
Marco Maratea, Luca Pulina, Francesco Ricca:
Multi-engine ASP solving with policy adaptation. J. Log. Comput. 25(6): 1285-1306 (2015)
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/MarateaPR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/MarateaPR15
Marco Maratea, Luca Pulina, Francesco Ricca:
Advances in Multi-engine ASP Solving. AI*IA 2015: 179-190
[c36]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dlog/AdorniMPP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlog/AdorniMPP15
Giovanni Adorni, Marco Maratea, Laura Pandolfo, Luca Pulina:
An Ontology-Based Archive for Historical Research. Description Logics 2015
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/lpnmr/MarateaPR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpnmr/MarateaPR15
Marco Maratea, Luca Pulina, Francesco Ricca:
Multi-level Algorithm Selection for ASP. LPNMR 2015: 439-445
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/rr/AdorniMPP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rr/AdorniMPP15
Giovanni Adorni, Marco Maratea, Laura Pandolfo, Luca Pulina:
An Ontology for Historical Research Documents. RR 2015: 11-18
2014
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ia/MarateaP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ia/MarateaP14
Marco Maratea, Luca Pulina:
Efficient DTPP solving with a reduction-based approach. Intelligenza Artificiale 8(1): 101-111 (2014)
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tplp/MarateaPR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tplp/MarateaPR14
Marco Maratea, Luca Pulina, Francesco Ricca:
A multi-engine approach to answer-set programming. Theory Pract. Log. Program. 14(6): 841-868 (2014)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/MarateaPR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MarateaPR14
Marco Maratea, Luca Pulina, Francesco Ricca:
The Multi-engine ASP Solver ME-ASP: Progress Report. CoRR abs/1405.0876 (2014)
2013
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/MarateaPR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/MarateaPR13
Marco Maratea, Luca Pulina, Francesco Ricca:
Automated Selection of Grounding Algorithm in Answer Set Programming. AI*IA 2013: 73-84
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/BourguetMP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/BourguetMP13
Jean-Rémi Bourguet, Marco Maratea, Luca Pulina:
A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences. AI*IA 2013: 445-456
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/MarateaPR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/MarateaPR13
Marco Maratea, Luca Pulina, Francesco Ricca:
A Multi-Engine Approach to Answer Set Programming. CoRR abs/1306.4925 (2013)
2012
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/aicom/MarateaP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aicom/MarateaP12
Marco Maratea, Luca Pulina:
Solving disjunctive temporal problems with preferences using maximum satisfiability. AI Commun. 25(2): 137-156 (2012)
[c21]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/iclp/MarateaPR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/MarateaPR12
Marco Maratea, Luca Pulina, Francesco Ricca:
Applying Machine Learning Techniques to ASP Solving. ICLP (Technical Communications) 2012: 37-48
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/jelia/MarateaPR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/jelia/MarateaPR12
Marco Maratea, Luca Pulina, Francesco Ricca:
The Multi-Engine ASP Solver me-asp. JELIA 2012: 484-487
2011
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/MarateaP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/MarateaP11
Marco Maratea, Luca Pulina:
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions. AI*IA 2011: 420-425

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.