Giovanni Amendola

Miroslaw Truszczynski

Artif. Intell., 2020

A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract).

[BibT_eX]

[DOI]

Marco Maratea

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Beyond NP: Quantifying over Answer Sets.

[BibT_eX]

[DOI]

Miroslaw Truszczynski

Theory Pract. Log. Program., 2019

Paracoherent Answer Set Semantics meets Argumentation Frameworks.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2019

Better Paracoherent Answer Sets with Less Resources.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2019

Abstract Solvers for Computing Cautious Consequences of ASP programs.

[BibT_eX]

[DOI]

Marco Maratea

Theory Pract. Log. Program., 2019

Evaluation of Disjunctive Programs in WASP.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

Extending Bell Numbers for Parsimonious Chase Estimation.

[BibT_eX]

[DOI]

Cinzia Marte

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Algorithm Selection for Paracoherent Answer Set Computation.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018

Towards Quantified Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion co-located with the Federated Logic Conference, 2018

A Generator of Hard 2QBF Formulas and ASP Programs.

[BibT_eX]

[DOI]

Mirek Truszczynski

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Enhancing Existential Rules by Closed-World Variables.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward.

[BibT_eX]

[DOI]

Marco Manna

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Explainable Certain Answers.

[BibT_eX]

[DOI]

Leonid Libkin

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Preliminary Results on Modeling Interdependent Scheduling Games via Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the RiCeRcA Workshop co-located with the 17th International Conference of the Italian Association for Artificial Intelligence, 2018

Solving the Stable Roommates Problem using Incoherent Answer Set Programs.

[BibT_eX]

[DOI]

Proceedings of the RiCeRcA Workshop co-located with the 17th International Conference of the Italian Association for Artificial Intelligence, 2018

Externally Supported Models for Efficient Computation of Paracoherent Answer Sets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Finite model reasoning over existential rules.

[BibT_eX]

[DOI]

Marco Manna

Theory Pract. Log. Program., 2017

Querying finite or arbitrary models? No matter! Existential rules may rely on both once again (discussion paper).

[BibT_eX]

[DOI]

Marco Manna

Proceedings of the 25th Italian Symposium on Advanced Database Systems, 2017

Generating Hard Random Boolean Formulas and Disjunctive Logic Programs.

[BibT_eX]

[DOI]

Miroslaw Truszczynski

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Reasoning on anonymity in Datalog+/-.

[BibT_eX]

[DOI]

Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017

Entity set expansion from the Web via ASP.

[BibT_eX]

[DOI]

Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017

On the Computation of Paracoherent Answer Sets.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Minimal Undefinedness for Fuzzy Answer Sets.

[BibT_eX]

[DOI]

Mario Alviano

Rafael Peñaloza

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Semi-equilibrium models for paracoherent answer set programs.

[BibT_eX]

[DOI]

Artif. Intell., 2016

ASPQ: An ASP-Based 2QBF Solver.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), 2016

Modeling and Reasoning about NTU Games via Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On the Application of Answer Set Programming to the Conference Paper Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2016: Advances in Artificial Intelligence - XVth International Conference of the Italian Association for Artificial Intelligence, Genova, Italy, November 29, 2016

2014

Modular Paracoherent Answer Sets.

[BibT_eX]

[DOI]

Thomas Eiter

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Dealing with Incoherence in ASP: Split Semi-Equilibrium Semantics.

[BibT_eX]

[DOI]