default search action
Giovanni Amendola
Person information
- affiliation: University of Calabria, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Giovanni Amendola
, Marco Manna
A logic-based framework for characterizing nexus of similarity within knowledge bases. Inf. Sci. 664: 120331 (2024) - [i9]Giovanni Amendola, Tobias Berei, Giuseppe Mazzotta
Unit Testing in ASP Revisited: Language and Test-Driven Development Environment. CoRR abs/2401.02153 (2024) - 2023
- [j10]Giovanni Amendola
Special Issue on Logic-Based Artificial Intelligence. Algorithms 16(2): 106 (2023) - [c27]Giuseppe Agresta, Giovanni Amendola, Pietro Cofone, Marco Manna, Aldo Ricioppo:
Characterizing Nexus of Similarity between Entities. IPS-RCRA-SPIRIT@AI*IA 2023 - [i8]Giovanni Amendola, Marco Manna, Aldo Ricioppo:
Characterizing Nexus of Similarity within Knowledge Bases: A Logic-based Framework and its Computational Complexity Aspects. CoRR abs/2303.10714 (2023) - 2022
- [j9]Giovanni Amendola, Gianluigi Greco
Answers set programs for non-transferable utility games: Expressiveness, complexity and applications. Artif. Intell. 302: 103606 (2022) - [c26]Giovanni Amendola, Bernardo Cuteri, Francesco Ricca, Mirek Truszczynski:
Solving Problems in the Polynomial Hierarchy with ASP(Q). LPNMR 2022: 373-386 - 2021
- [j8]Giovanni Amendola, Carmine Dodaro
Paracoherent answer set computation. Artif. Intell. 299: 103519 (2021) - [c25]Giovanni Amendola, Giovanni Rotondaro:
Modeling Clique Coloring via ASP(Q). ICLP Workshops 2021 - [c24]Giovanni Amendola
Testing in ASP: Revisited Language and Programming Environment. JELIA 2021: 362-376 - 2020
- [j7]Giovanni Amendola
New models for generating hard random boolean formulas and disjunctive logic programs. Artif. Intell. 279 (2020) - [c23]Giovanni Amendola, Carmine Dodaro, Marco Maratea:
A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract). IJCAI 2020: 4716-4720
2010 – 2019
- 2019
- [j6]Giovanni Amendola
Paracoherent Answer Set Semantics meets Argumentation Frameworks. Theory Pract. Log. Program. 19(5-6): 688-704 (2019) - [j5]Giovanni Amendola
Beyond NP: Quantifying over Answer Sets. Theory Pract. Log. Program. 19(5-6): 705-721 (2019) - [j4]Giovanni Amendola
Abstract Solvers for Computing Cautious Consequences of ASP programs. Theory Pract. Log. Program. 19(5-6): 740-756 (2019) - [j3]Giovanni Amendola
Better Paracoherent Answer Sets with Less Resources. Theory Pract. Log. Program. 19(5-6): 757-772 (2019) - [c22]Giovanni Amendola
Algorithm Selection for Paracoherent Answer Set Computation. JELIA 2019: 479-489 - [c21]Giovanni Amendola
Extending Bell Numbers for Parsimonious Chase Estimation. JELIA 2019: 490-497 - [c20]Mario Alviano
Evaluation of Disjunctive Programs in WASP. LPNMR 2019: 241-255 - [d1]Mario Alviano
Evaluation of disjunctive programs in WASP. Zenodo, 2019 - [i7]Giovanni Amendola, Carmine Dodaro, Marco Maratea:
Abstract Solvers for Computing Cautious Consequences of ASP programs. CoRR abs/1907.09402 (2019) - [i6]Giovanni Amendola, Francesco Ricca:
Paracoherent Answer Set Semantics meets Argumentation Frameworks. CoRR abs/1907.09426 (2019) - [i5]Giovanni Amendola, Francesco Ricca, Mirek Truszczynski:
Beyond NP: Quantifying over Answer Sets. CoRR abs/1907.09559 (2019) - [i4]Giovanni Amendola, Carmine Dodaro, Francesco Ricca:
Better Paracoherent Answer Sets with Less Resources. CoRR abs/1907.09560 (2019) - 2018
- [c19]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Francesco Ricca:
Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. AAAI 2018: 1720-1727 - [c18]Giovanni Amendola:
Solving the Stable Roommates Problem using Incoherent Answer Set Programs. RiCeRcA@AI*IA 2018 - [c17]Giovanni Amendola:
Preliminary Results on Modeling Interdependent Scheduling Games via Answer Set Programming. RiCeRcA@AI*IA 2018 - [c16]Giovanni Amendola, Nicola Leone, Marco Manna, Pierfrancesco Veltri:
Enhancing Existential Rules by Closed-World Variables. IJCAI 2018: 1676-1682 - [c15]Giovanni Amendola, Leonid Libkin
Explainable Certain Answers. IJCAI 2018: 1683-1690 - [c14]Giovanni Amendola, Nicola Leone, Marco Manna:
Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward. IJCAI 2018: 5189-5193 - [c13]Giovanni Amendola, Francesco Ricca, Mirek Truszczynski:
A Generator of Hard 2QBF Formulas and ASP Programs. KR 2018: 52-56 - [c12]Giovanni Amendola:
Towards Quantified Answer Set Programming. RCRA@FLoC 2018 - [i3]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. CoRR abs/1802.03828 (2018) - 2017
- [j2]Giovanni Amendola
Finite model reasoning over existential rules. Theory Pract. Log. Program. 17(5-6): 726-743 (2017) - [c11]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
On the Computation of Paracoherent Answer Sets. AAAI 2017: 1034-1040 - [c10]Mario Alviano, Giovanni Amendola, Rafael Peñaloza:
Minimal Undefinedness for Fuzzy Answer Sets. AAAI 2017: 3694-3700 - [c9]Weronika T. Adrian
Entity set expansion from the Web via ASP. ICLP (Technical Communications) 2017: 1:1-1:5 - [c8]Giovanni Amendola
Reasoning on anonymity in Datalog+/-. ICLP (Technical Communications) 2017: 3:1-3:5 - [c7]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. IJCAI 2017: 532-538 - [c6]Giovanni Amendola, Nicola Leone, Marco Manna:
Querying finite or arbitrary models? No matter! Existential rules may rely on both once again (discussion paper). SEBD 2017: 218 - [i2]Giovanni Amendola, Nicola Leone, Marco Manna:
Finite model reasoning over existential rules. CoRR abs/1707.01870 (2017) - [i1]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
On the Computation of Paracoherent Answer Sets. CoRR abs/1707.06813 (2017) - 2016
- [j1]Giovanni Amendola
Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234: 219-271 (2016) - [c5]Giovanni Amendola
On the Application of Answer Set Programming to the Conference Paper Assignment Problem. AI*IA 2016: 164-178 - [c4]Giovanni Amendola, Gianluigi Greco, Nicola Leone, Pierfrancesco Veltri:
Modeling and Reasoning about NTU Games via Answer Set Programming. IJCAI 2016: 38-45 - [c3]Giovanni Amendola, Carmine Dodaro, Francesco Ricca:
ASPQ: An ASP-Based 2QBF Solver. QBF@SAT 2016: 49-54 - 2014
- [c2]Giovanni Amendola:
Dealing with Incoherence in ASP: Split Semi-Equilibrium Semantics. DWAI@AI*IA 2014: 23-32 - [c1]Giovanni Amendola, Thomas Eiter, Nicola Leone:
Modular Paracoherent Answer Sets. JELIA 2014: 457-471
Coauthor Index
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-10-07 21:13 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: