Nicola Olivetti

Orcid: 0000-0001-6254-3754

Affiliations:
  • Aix-Marseille University, LSIS, Marseille, France
  • University of Turin, Department of Computer Science, Italy


According to our database1, Nicola Olivetti authored at least 116 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Proof theory for the logics of bringing-it-about: Ability, coalitions and means-end relationship.
J. Log. Comput., 2024

A Proof Calculus for Ethical Reasoning.
Proceedings of the PRIMA 2024: Principles and Practice of Multi-Agent Systems, 2024

Local Intuitionistic Modal Logics and Their Calculi.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

A Natural Intuitionistic Modal Logic: Axiomatization and Bi-Nested Calculus.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations.
CoRR, 2023

Resolution Calculi for Non-normal Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Analytic Proof Theory for Åqvist's System F.
Proceedings of the Deontic Logic and Normative Systems - 16th International Conference, 2023

2022
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning.
J. Log. Comput., 2022

Towards an Intuitionistic Deontic Logic Tolerating Conflicting Obligations.
Proceedings of the Logic, Language, Information, and Computation, 2022

Dyadic Obligations: Proofs and Countermodels via Hypersequents.
Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

Labelled Sequent Calculi for Conditional Logics: Conditional Excluded Middle and Conditional Modus Ponens Finally Together.
Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022

2021
Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics.
J. Log. Comput., 2021

Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity.
J. Log. Comput., 2021

Terminating Calculi and Countermodels for Constructive Modal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

Proof Systems for the Logics of Bringing-It-About.
Proceedings of the Deontic Logic and Normative Systems - 15th International Conference, 2021

2020
Reasoning About Typicality and Probabilities in Preferential Description Logics.
Proceedings of the Applications and Practices in Ontology Design, 2020

Intuitionistic Non-normal Modal Logics: A General Framework.
J. Philos. Log., 2020

Proof-search and countermodel generation for non-normal modal logics: The theorem prover PRONOM.
Intelligenza Artificiale, 2020

Reasoning about Typicality and Probabilities in Preferential Description Logics.
CoRR, 2020

Theorem Proving for Non-normal Modal Logics.
Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, 2020

Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Theorem Proving for Lewis Logics of Counterfactual Reasoning.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

HYPNO: Theorem Proving with Hypersequent Calculi for Non-normal Modal Logics (System Description).
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

Automated Deduction.
Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume II: AI Algorithms, 2020

2019
Nested Sequents for the Logic of Conditional Belief.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

PRONOM: Proof-Search and Countermodel Generation for Non-normal Modal Logics.
Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

2018
Conditional Beliefs: from neighbourhood Semantics to Sequent Calculus.
Rev. Symb. Log., 2018

Towards a Rational Closure for Expressive Description Logics: the Case of 풮풽풾퓆.
Fundam. Informaticae, 2018

Counterfactual Logic: Labelled and Internal Calculi, Two Sides of the Same Coin?.
Proceedings of the Advances in Modal Logic 12, 2018

Non-Normal Modal Logics: Bi-Neighbourhood Semantics and Its Labelled Calculi.
Proceedings of the Advances in Modal Logic 12, 2018

2017
VINTE: An Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

2016
Nested sequent calculi for normal conditional logics.
J. Log. Comput., 2016

Standard Sequent Calculi for Lewis' Logics of Counterfactuals.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus.
Proceedings of the Advances in Modal Logic 11, 2016

2015
Nested sequent calculi and theorem proving for normal conditional logics: The theorem prover NESCOND.
Intelligenza Artificiale, 2015

Semantic characterization of rational closure: From propositional logic to description logics.
Artif. Intell., 2015

A Standard Internal Calculus for Lewis' Counterfactual Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

DysToPic: a Multi-Engine Theorem Prover for Preferential Description Logics.
Proceedings of the 28th International Workshop on Description Logics, 2015

A natural sequent calculus for Lewis' logic of counterfactuals.
Proceedings of the 30th Italian Conference on Computational Logic, 2015

A Multi-engine Theorem Prover for a Description Logic of Typicality.
Proceedings of the AI*IA 2015, Advances in Artificial Intelligence, 2015

2014
Minimal models for rational closure in SHIQ.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Rational Closure in SHIQ.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
On Rational Closure in Description Logics of Typicality
CoRR, 2013

A non-monotonic Description Logic for reasoning about typicality.
Artif. Intell., 2013

Minimal Model Semantics and Rational Closure in Description Logics.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

Nested Sequent Calculi and Theorem Proving for Normal Conditional Logics.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

A Semantics for Rational Closure: Preliminary Results.
Proceedings of the 28th Italian Conference on Computational Logic, 2013

PreDeLo 1.0: A Theorem Prover for Preferential Description Logics.
Proceedings of the AI*IA 2013: Advances in Artificial Intelligence, 2013

2012
A Minimal Model Semantics for Nonmonotonic Reasoning.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

Nested Sequent Calculi for Conditional Logics.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

Preferential Low Complexity Description Logics: Complexity Results and Proof Methods.
Proceedings of the 2012 International Workshop on Description Logics, 2012

A Modal Reconstruction of Rational Closure.
Proceedings of the 9th Italian Convention on Computational Logic, 2012

2011
Non-classical logics for knowledge representation and reasoning.
Intelligenza Artificiale, 2011

Towards a Proof Theory of Gödel Modal Logics
Log. Methods Comput. Sci., 2011

A Tableau Calculus for a Nonmonotonic Extension of <i>EL</i><sup>^</sup>\mathcal{EL}^\bot.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Reasoning about Typicality in Low Complexity DLs: The Logics EL<sup>⊥</sup>T<sub>min</sub> and DL-Lite<sub>c</sub> T<sub>min</sub>.
Proceedings of the IJCAI 2011, 2011

Nonmonotonic extensions of low-complexity DLs: complexity results and proof methods.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

A Tableau Calculus for a Nonmonotonic Extension of the Description Logic $\mbox{\em DL-Lite}_{\mathit{core}}$.
Proceedings of the AI*IA 2011: Artificial Intelligence Around Man and Beyond, 2011

2010
Preface.
J. Log. Comput., 2010

A Nonmonotonic Extension of KLM Preferential Logic P.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Preferential vs Rational Description Logics: which one for Reasoning About Typicality?.
Proceedings of the ECAI 2010, 2010

Tableau Calculi for <i>CSL</i>\mathcal{CSL} over minspaces.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Reasoning About Typicality in Preferential Description Logics: Preferential vs Rational Entailment.
Proceedings of the 25th Italian Conference on Computational Logic, 2010

2009
Tableau calculus for preference-based conditional logics: PCL and its extensions.
ACM Trans. Comput. Log., 2009

Analytic tableaux calculi for KLM logics of nonmonotonic reasoning.
ACM Trans. Comput. Log., 2009

ALC + T: a Preferential Extension of Description Logics.
Fundam. Informaticae, 2009

CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity.
Proceedings of the 6th Workshop on Methods for Modalities, 2009

Proof Systems for a Gödel Modal Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Reasoning About Typicality in ALC and EL.
Proceedings of the 22nd International Workshop on Description Logics (DL 2009), 2009

Reasoning about Typicality with Low Complexity Description Logics: The Logic <i>EL</i><sup>+<sup>^</sup></sup>T.
Proceedings of the AI*IA 2009: Emergent Perspectives in Artificial Intelligence, 2009

2008
Reasoning about Typicality in Preferential Description Logics.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

2007
A sequent calculus and a theorem prover for standard conditional logics.
ACM Trans. Comput. Log., 2007

Preferential Description Logics.
Proceedings of the Logic for Programming, 2007

An Implementation of a Free-Variable Tableaux for KLM Preferential Logic P of Nonmonotonic Reasoning: The Theorem Prover FreeP 1.0.
Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

2006
Analytic Tableau Calculi for KLM Rational Logic R.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Automated Deduction for Logics of Default Reasoning.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
Sequent and hypersequent calculi for abelian and Łukasiewicz logics.
ACM Trans. Comput. Log., 2005

Lukasiewicz Logic: From Proof Systems To Logic Programming.
Log. J. IGPL, 2005

Weak AGM postulates and strong Ramsey Test: A logical formalization.
Artif. Intell., 2005

CondLean 3.0: Improving CondLean for Stronger Conditional Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

Analytic Tableaux for KLM Preferential and Cumulative Logics.
Proceedings of the Logic for Programming, 2005

Goal-Directed Methods for Fuzzy Logics.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

2004
Analytic Calculi for Product Logics.
Arch. Math. Log., 2004

Goal-Directed Methods for Lukasiewicz Logic.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Tableaux for Lukasiewicz Infinite-valued Logic.
Stud Logica, 2003

CondLean: A Theorem Prover for Conditional Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

Tableau Calculi for Preference-Based Conditional Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

Goal-Directed Calculli for Gödel-Dummett Logics.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Sequent calculi for propositional nonmonotonic logics.
ACM Trans. Comput. Log., 2002

Iterated Belief Revision and Conditional Logic.
Stud Logica, 2002

Analytic Sequent Calculi for Abelian and ukasiewicz Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

2001
A Calculus and Complexity Bound for Minimal Conditional Logic.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Belief Revision and the Ramsey Test: A Solution.
Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001

2000
Conditional reasoning in logic programming.
J. Log. Program., 2000

A Conditional Logic for Iterated Belief Revision.
Proceedings of the ECAI 2000, 2000

1998
Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz.
Theor. Comput. Sci., 1998

Cut-free proof systems for logics of weak excluded middle.
Soft Comput., 1998

Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication.
Stud Logica, 1998

Combining Negation as Failure and Embedded Implications in Logic Programs.
J. Log. Program., 1998

A Conditional Logic for Belief Revision.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

1997
A Sequent Calculus for Skeptical Default Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

A Sequent Calculus for Circumscription.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
A Language for Handling Hypothetical Updates and Inconsistency.
Log. J. IGPL, 1996

1995
Hypothetical Updates, Priority and Inconsistency in a Logic Programming Language.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1994
Conditonal Logic Programming.
Proceedings of the Logic Programming, 1994

1992
N-Prolog and equivalence of logic programs.
J. Log. Lang. Inf., 1992

Tableaux and Sequent Calculus for Minimal Entailment.
J. Autom. Reason., 1992

Negation as Failure in Intuitionistic Logic Programming.
Proceedings of the Logic Programming, 1992


  Loading...