Paolo Liberatore

According to our database, Paolo Liberatore authored at least 81 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Can we forget how we learned? Doxastic redundancy in iterated belief revision.

Paolo Liberatore

CoRR, 2024

2023

Reconstructing a single-head formula to facilitate logical forgetting.

Paolo Liberatore

J. Log. Comput., October, 2023

Mixed Iterated Revisions: Rationale, Algorithms, and Complexity.

Paolo Liberatore

ACM Trans. Comput. Log., 2023

Natural revision is contingently-conditionalized revision.

Paolo Liberatore

CoRR, 2023

Can we forget how we learned? Representing states in iterated belief revision}.

Paolo Liberatore

CoRR, 2023

2022

Superredundancy: A tool for Boolean formula minimization complexity analysis.

Paolo Liberatore

Electron. Colloquium Comput. Complex., 2022

Abductive forgetting.

Paolo Liberatore

CoRR, 2022

Four algorithms for propositional forgetting.

Paolo Liberatore

CoRR, 2022

2021

On Mixed Iterated Revisions.

Paolo Liberatore

CoRR, 2021

Merging with unknown reliability.

Paolo Liberatore

CoRR, 2021

2020

One head is better than two: a polynomial restriction for propositional definite Horn forgetting.

Paolo Liberatore

CoRR, 2020

Common equivalence and size after forgetting.

Paolo Liberatore

CoRR, 2020

The ghosts of forgotten things: A study on size after forgetting.

Paolo Liberatore

CoRR, 2020

2018

Belief Integration and Source Reliability Assessment.

Paolo Liberatore

J. Artif. Intell. Res., 2018

2016

Belief Merging by Examples.

Paolo Liberatore

ACM Trans. Comput. Log., 2016

The Size of BDDs and Other Data Structures in Temporal Logics Model Checking.

Andrea Ferrara, Paolo Liberatore, Marco Schaerf

IEEE Trans. Computers, 2016

Belief Merging by Source Reliability Assessment.

Paolo Liberatore

CoRR, 2016

2015

Revision by History.

Paolo Liberatore

J. Artif. Intell. Res., 2015

On the complexity of second-best abductive explanations.

Paolo Liberatore, Marco Schaerf

Int. J. Approx. Reason., 2015

2014

Bijective faithful translations among default logics.

Paolo Liberatore

J. Log. Comput., 2014

Belief revision by examples.

Paolo Liberatore

CoRR, 2014

2013

The compilability framework.

Paolo Liberatore, Marco Schaerf

Intelligenza Artificiale, 2013

2012

On the Complexity of Finding Second-Best Abductive Explanations

Paolo Liberatore, Marco Schaerf

CoRR, 2012

2010

On the size of data structures used in symbolic model checking

Paolo Liberatore, Marco Schaerf

CoRR, 2010

2008

Redundancy in logic III: Non-monotonic reasoning.

Paolo Liberatore

Artif. Intell., 2008

Redundancy in logic II: 2CNF and Horn propositional formulae.

Paolo Liberatore

Artif. Intell., 2008

2007

Compilability of propositional abduction.

Paolo Liberatore, Marco Schaerf

ACM Trans. Comput. Log., 2007

Where fail-safe default logics fail.

Paolo Liberatore

ACM Trans. Comput. Log., 2007

Consistency Defaults.

Paolo Liberatore

Stud Logica, 2007

Raising a Hardness Result

Paolo Liberatore

CoRR, 2007

Model Checking and Preprocessing.

Andrea Ferrara, Paolo Liberatore, Marco Schaerf

Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

2006

Complexity results on DPLL and resolution.

Paolo Liberatore

ACM Trans. Comput. Log., 2006

k-Approximating Circuits.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

IEEE Trans. Computers, 2006

On the complexity of extension checking in default logic.

Paolo Liberatore

Inf. Process. Lett., 2006

2005

On the complexity of case-based planning.

Paolo Liberatore

J. Exp. Theor. Artif. Intell., 2005

Seminormalizing a default theory.

Paolo Liberatore

J. Appl. Non Class. Logics, 2005

Complexity and compilability of diagnosis and recovery of graph-based systems.

Paolo Liberatore

Int. J. Intell. Syst., 2005

Representability in Default Logic.

Paolo Liberatore

Log. J. IGPL, 2005

The complexity of model checking for propositional default logics.

Paolo Liberatore, Marco Schaerf

Data Knowl. Eng., 2005

Redundancy in Logic III: Non-Mononotonic Reasoning

Paolo Liberatore

CoRR, 2005

Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems

Paolo Liberatore

CoRR, 2005

Redundancy in logic I: CNF propositional formulae.

Paolo Liberatore

Artif. Intell., 2005

The Complexity of Action Redundancy.

Andrea Ferrara, Paolo Liberatore, Marco Schaerf

Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004

Uncontroversial Default Logic.

Paolo Liberatore

J. Log. Comput., 2004

On Polynomial Sized MDP Succinct Policies.

Paolo Liberatore

J. Artif. Intell. Res., 2004

The Compactness of Belief Revision and Update Operators.

Paolo Liberatore, Marco Schaerf

Fundam. Informaticae, 2004

The Complexity of Modified Instances

Paolo Liberatore

CoRR, 2004

Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/).

Thierry Vidal, Paolo Liberatore

AI Commun., 2004

Expressive Power and Succinctness of Propositional Languages for Preference Representation.

Sylvie Coste-Marquis, Jérôme Lang, Paolo Liberatore, Pierre Marquis

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

2003

Propositional Independence: Formula-Variable Independence and Forgetting.

Jérôme Lang, Paolo Liberatore, Pierre Marquis

J. Artif. Intell. Res., 2003

2002

Preprocessing of Intractable Problems.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Inf. Comput., 2002

Complexity of the Unique Extension Problem in Default Logic.

Xishun Zhao, Paolo Liberatore

Fundam. Informaticae, 2002

Merging Locally Correct Knowledge Bases: A Preliminary Report

Paolo Liberatore

CoRR, 2002

Conditional independence in propositional logic.

Jérôme Lang, Paolo Liberatore, Pierre Marquis

Artif. Intell., 2002

Solving QBF by SMV.

Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf

Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

The Complexity of Checking Redundancy of CNF Propositional Formulae.

Paolo Liberatore

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

The Size of MDP Factored Policies.

Paolo Liberatore

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

Belief Revision and Update: Complexity of Model Checking.

Paolo Liberatore, Marco Schaerf

J. Comput. Syst. Sci., 2001

Monotonic reductions, representative equivalence, and compilation of intractable problems.

Paolo Liberatore

J. ACM, 2001

2000

Compilability and compact representations of revision of Horn knowledge bases.

Paolo Liberatore

ACM Trans. Comput. Log., 2000

Space Efficiency of Propositional Knowledge Representation Formalisms.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

J. Artif. Intell. Res., 2000

The complexity of belief update.

Paolo Liberatore

Artif. Intell., 2000

On the complexity of choosing the branching literal in DPLL.

Paolo Liberatore

Artif. Intell., 2000

BReLS: A System for the Integration of Knowledge Bases.

Paolo Liberatore, Marco Schaerf

Proceedings of the KR 2000, 2000

A Framework for Belief Update.

Paolo Liberatore

Proceedings of the Logics in Artificial Intelligence, European Workshop, 2000

Verification Programs for Abduction.

Paolo Liberatore, Francesco M. Donini

Proceedings of the ECAI 2000, 2000

Compilability of Abduction.

Paolo Liberatore, Marco Schaerf

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction

Peter Jonsson, Paolo Liberatore

Electron. Colloquium Comput. Complex., 1999

The Size of a Revised Knowledge Base.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Artif. Intell., 1999

1998

Arbitration (or How to Merge Knowledge Bases).

Paolo Liberatore, Marco Schaerf

IEEE Trans. Knowl. Data Eng., 1998

On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc.

Paolo Liberatore

Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

On Non-Conservative Plan Modification.

Paolo Liberatore

Proceedings of the 13th European Conference on Artificial Intelligence, 1998

1997

Compilability of Domain Descriptions in the Language A.

Paolo Liberatore

Electron. Trans. Artif. Intell., 1997

The Complexity of the Language A.

Paolo Liberatore

Electron. Trans. Artif. Intell., 1997

Reducing Belief Revision to Circumscription (and Vice Versa).

Paolo Liberatore, Marco Schaerf

Artif. Intell., 1997

The Complexity of Iterated Belief Revision.

Paolo Liberatore

Proceedings of the Database Theory, 1997

1996

Comparing Space Efficiency of Propositional Knowledge Representation Formalisms.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Feasibility and Unfeasibility of Off-Line Processing.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

The Complexity of Model Checking for Belief Revision and Update.

Paolo Liberatore, Marco Schaerf

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Arbitration: A Commutative Operator for Belief Revision.

Paolo Liberatore, Marco Schaerf

Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, 1995

Relating Belief Revision and Circumscription.

Paolo Liberatore, Marco Schaerf

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995