default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Maratea
- > Home > Persons > Marco Maratea
Publications
- 2024
[c85]Matteo Cardellini
, Enrico Giunchiglia, Marco Maratea:
Symbolic Numeric Planning with Patterns. AAAI 2024: 20070-20077- 2023
- [c80]Enrico Giunchiglia, Marco Maratea, Marco Mochi:
A Simple Proof-Theoretic Characterization of Stable Models. IPS-RCRA-SPIRIT@AI*IA 2023 - [i19]Matteo Cardellini, Enrico Giunchiglia, Marco Maratea:
Symbolic Numeric Planning with Patterns. CoRR abs/2312.09963 (2023) - 2018
- [j32]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) - 2013
- [c31]Alessandro Armando, Enrico Giunchiglia, Marco Maratea, Serena Elisa Ponta:
Modeling and Reasoning about Business Processes under Authorization Constraints: A Planning-Based Approach. ICAPS 2013 - 2012
- [j9]Alessandro Armando, Enrico Giunchiglia, Marco Maratea, Serena Elisa Ponta:
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints. J. Comput. Syst. Sci. 78(1): 119-141 (2012) - [c29]Enrico Giunchiglia, Marco Maratea:
Algorithms for Solving Satisfiability Problems with Qualitative Preferences. Correct Reasoning 2012: 327-344 - 2011
- [j7]Enrico Giunchiglia, Marco Maratea:
Introducing Preferences in Planning as Satisfiability. J. Log. Comput. 21(2): 205-229 (2011) - 2010
- [j6]Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea:
Solving satisfiability problems with preferences. Constraints An Int. J. 15(4): 485-515 (2010) - 2009
- [c23]Enrico Giunchiglia, Marco Maratea:
Improving Plan Quality in SAT-Based Planning. AI*IA 2009: 253-263 - 2008
- [j5]Enrico Giunchiglia, Nicola Leone, Marco Maratea:
On the relation among answer set solvers. Ann. Math. Artif. Intell. 53(1-4): 169-204 (2008) - [c21]Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea:
Computing All Optimal Solutions in Satisfiability Problems with Preferences. CP 2008: 603-607 - [c20]Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea:
A new Approach for Solving Satisfiability Problems with Qualitative Preferences. ECAI 2008: 510-514 - 2007
- [c18]Enrico Giunchiglia, Marco Maratea:
Planning as Satisfiability with Preferences. AAAI 2007: 987-992 - [c17]Enrico Giunchiglia, Marco Maratea:
SAT-Based Planning with Minimal-#actions Plans and "soft" Goals. AI*IA 2007: 422-433 - 2006
- [j2]Enrico Giunchiglia, Yuliya Lierler, Marco Maratea:
Answer Set Programming Based on Propositional Satisfiability. J. Autom. Reason. 36(4): 345-377 (2006) - [c15]Enrico Giunchiglia, Marco Maratea:
Solving Optimization Problems with DLL. ECAI 2006: 377-381 - [c14]Enrico Giunchiglia, Marco Maratea:
optsat: A Tool for Solving SAT Related Optimization Problems. JELIA 2006: 485-489 - 2005
- [j1]Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea:
The SAT-based Approach to Separation Logic. J. Autom. Reason. 35(1-3): 237-263 (2005) - [c13]Enrico Giunchiglia, Marco Maratea:
Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming. AI*IA 2005: 122-134 - [c12]Enrico Giunchiglia, Marco Maratea:
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming. Answer Set Programming 2005 - [c11]Enrico Giunchiglia, Marco Maratea:
On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels). ICLP 2005: 37-51 - 2004
- [c10]Enrico Giunchiglia, Yuliya Lierler, Marco Maratea:
SAT-Based Answer Set Programming. AAAI 2004: 61-66 - [c8]Enrico Giunchiglia, Yuliya Lierler, Marco Maratea:
A SAT-based polynomial space algorithm for answer set programming. NMR 2004: 189-196 - [c7]Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea:
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. SAT 2004 - [c6]Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea:
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints. SAT (Selected Papers 2004: 16-29 - [c5]Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Massimo Idini, Marco Maratea:
TSAT++: an Open Platform for Satisfiability Modulo Theories. D/PDPAR@IJCAR 2004: 25-36 - 2003
- [c3]Enrico Giunchiglia, Marco Maratea, Armando Tacchella:
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. CP 2003: 842-846 - 2002
- [c2]Enrico Giunchiglia, Marco Maratea, Armando Tacchella:
Dependent and Independent Variables in Propositional Satisfiability. JELIA 2002: 296-307 - 2001
- [c1]Enrico Giunchiglia, Marco Maratea, Armando Tacchella, Davide Zambonin:
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability. IJCAR 2001: 347-363
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
