Relating Belief Revision and Circumscription. - Paolo Liberatore; Marco Schaerf (IJCAI, 1995)

Arbitration: A Commutative Operator for Belief Revision. - Paolo Liberatore; Marco Schaerf (WOCFAI, 1995)

The Complexity of Model Checking for Belief Revision and Update. - Paolo Liberatore; Marco Schaerf (AAAI/IAAI, Vol. 1, 1996)

Feasibility and Unfeasibility of Off-Line Processing. - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (ISTCS, 1996)

Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (KR, 1996)

The Complexity of Iterated Belief Revision. - Paolo Liberatore (ICDT, 1997)

Reducing Belief Revision to Circumscription (and Vice Versa). - Paolo Liberatore; Marco Schaerf (Artif. Intell., 1997)

The Complexity of the Language A. - Paolo Liberatore (Electron. Trans. Artif. Intell., 1997)

Compilability of Domain Descriptions in the Language A. - Paolo Liberatore (Electron. Trans. Artif. Intell., 1997)

On Non-Conservative Plan Modification. - Paolo Liberatore (ECAI, 1998)

On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. - Paolo Liberatore (KR, 1998)

Arbitration (or How to Merge Knowledge Bases). - Paolo Liberatore; Marco Schaerf (IEEE Trans. Knowl. Data Eng., 1998)

The Size of a Revised Knowledge Base. - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (Artif. Intell., 1999)

On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction - Peter Jonsson; Paolo Liberatore (Electron. Colloquium Comput. Complex., 1999)

Compilability of Abduction. - Paolo Liberatore; Marco Schaerf (AAAI/IAAI, 2000)

Verification Programs for Abduction. - Paolo Liberatore; Francesco M. Donini (ECAI, 2000)

A Framework for Belief Update. - Paolo Liberatore (JELIA, 2000)

BReLS: A System for the Integration of Knowledge Bases. - Paolo Liberatore; Marco Schaerf (KR, 2000)

On the complexity of choosing the branching literal in DPLL. - Paolo Liberatore (Artif. Intell., 2000)

The complexity of belief update. - Paolo Liberatore (Artif. Intell., 2000)

Space Efficiency of Propositional Knowledge Representation Formalisms. - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (J. Artif. Intell. Res., 2000)

Compilability and compact representations of revision of Horn knowledge bases. - Paolo Liberatore (ACM Trans. Comput. Log., 2000)

Monotonic reductions, representative equivalence, and compilation of intractable problems. - Paolo Liberatore (J. ACM, 2001)

Belief Revision and Update: Complexity of Model Checking. - Paolo Liberatore; Marco Schaerf (J. Comput. Syst. Sci., 2001)

The Size of MDP Factored Policies. - Paolo Liberatore (AAAI/IAAI, 2002)

The Complexity of Checking Redundancy of CNF Propositional Formulae. - Paolo Liberatore (ECAI, 2002)

Solving QBF by SMV. - Francesco M. Donini; Paolo Liberatore; Fabio Massacci; Marco Schaerf (KR, 2002)

Conditional independence in propositional logic. - Jérôme Lang; Paolo Liberatore; Pierre Marquis (Artif. Intell., 2002)

Merging Locally Correct Knowledge Bases: A Preliminary Report - Paolo Liberatore (CoRR, 2002)

k-Approximating Circuits - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (Electron. Colloquium Comput. Complex., 2002)

Complexity of the Unique Extension Problem in Default Logic. - Xishun Zhao; Paolo Liberatore (Fundam. Informaticae, 2002)

Preprocessing of Intractable Problems. - Marco Cadoli; Francesco M. Donini; Paolo Liberatore; Marco Schaerf (Inf. Comput., 2002)

Propositional Independence: Formula-Variable Independence and Forgetting. - Jérôme Lang; Paolo Liberatore; Pierre Marquis (J. Artif. Intell. Res., 2003)

Expressive Power and Succinctness of Propositional Languages for Preference Representation. - Sylvie Coste-Marquis; Jérôme Lang; Paolo Liberatore; Pierre Marquis (KR, 2004)

Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/). - Thierry Vidal; Paolo Liberatore (AI Commun., 2004)

The Complexity of Modified Instances - Paolo Liberatore (CoRR, 2004)

The Compactness of Belief Revision and Update Operators. - Paolo Liberatore; Marco Schaerf (Fundam. Informaticae, 2004)

On Polynomial Sized MDP Succinct Policies. - Paolo Liberatore (J. Artif. Intell. Res., 2004)

Uncontroversial Default Logic. - Paolo Liberatore (J. Log. Comput., 2004)

The Complexity of Action Redundancy. - Andrea Ferrara; Paolo Liberatore; Marco Schaerf (AI*IA, 2005)

Redundancy in logic I: CNF propositional formulae. - Paolo Liberatore (Artif. Intell., 2005)

Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems - Paolo Liberatore (CoRR, 2005)

Redundancy in Logic III: Non-Mononotonic Reasoning - Paolo Liberatore (CoRR, 2005)

The complexity of model checking for propositional default logics. - Paolo Liberatore; Marco Schaerf (Data Knowl. Eng., 2005)

Representability in Default Logic. - Paolo Liberatore (Log. J. IGPL, 2005)

Complexity and compilability of diagnosis and recovery of graph-based systems. - Paolo Liberatore (Int. J. Intell. Syst., 2005)

Seminormalizing a default theory. - Paolo Liberatore (J. Appl. Non Class. Logics, 2005)

On the complexity of case-based planning. - Paolo Liberatore (J. Exp. Theor. Artif. Intell., 2005)

On the complexity of extension checking in default logic. - Paolo Liberatore (Inf. Process. Lett., 2006)

Complexity results on DPLL and resolution. - Paolo Liberatore (ACM Trans. Comput. Log., 2006)

Model Checking and Preprocessing. - Andrea Ferrara; Paolo Liberatore; Marco Schaerf (AI*IA, 2007)

Raising a Hardness Result - Paolo Liberatore (CoRR, 2007)

Consistency Defaults. - Paolo Liberatore (Stud Logica, 2007)

Where fail-safe default logics fail. - Paolo Liberatore (ACM Trans. Comput. Log., 2007)

Compilability of propositional abduction. - Paolo Liberatore; Marco Schaerf (ACM Trans. Comput. Log., 2007)

Redundancy in logic II: 2CNF and Horn propositional formulae. - Paolo Liberatore (Artif. Intell., 2008)

Redundancy in logic III: Non-monotonic reasoning. - Paolo Liberatore (Artif. Intell., 2008)

On the size of data structures used in symbolic model checking - Paolo Liberatore; Marco Schaerf (CoRR, 2010)

On the Complexity of Finding Second-Best Abductive Explanations - Paolo Liberatore; Marco Schaerf (CoRR, 2012)

The compilability framework. - Paolo Liberatore; Marco Schaerf (Intelligenza Artificiale, 2013)

Belief revision by examples. - Paolo Liberatore (CoRR, 2014)

Bijective faithful translations among default logics. - Paolo Liberatore (J. Log. Comput., 2014)

On the complexity of second-best abductive explanations. - Paolo Liberatore; Marco Schaerf (Int. J. Approx. Reason., 2015)

Revision by History. - Paolo Liberatore (J. Artif. Intell. Res., 2015)

Belief Merging by Source Reliability Assessment. - Paolo Liberatore (CoRR, 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 Examples. - Paolo Liberatore (ACM Trans. Comput. Log., 2016)

Belief Integration and Source Reliability Assessment. - Paolo Liberatore (J. Artif. Intell. Res., 2018)

Common equivalence and size after forgetting. - Paolo Liberatore (CoRR, 2020)

Merging with unknown reliability. - Paolo Liberatore (CoRR, 2021)

On Mixed Iterated Revisions. - Paolo Liberatore (CoRR, 2021)

Four algorithms for propositional forgetting. - Paolo Liberatore (CoRR, 2022)

Abductive forgetting. - Paolo Liberatore (CoRR, 2022)

Superredundancy: A tool for Boolean formula minimization complexity analysis. - Paolo Liberatore (Electron. Colloquium Comput. Complex., 2022)

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

Mixed Iterated Revisions: Rationale, Algorithms, and Complexity. - Paolo Liberatore (ACM Trans. Comput. Log., 2023)

Reconstructing a single-head formula to facilitate logical forgetting. - Paolo Liberatore (J. Log. Comput., 2023)

Representing states in iterated belief revision. - Paolo Liberatore (Artif. Intell., 2024)

The ghosts of forgotten things: A study on size after forgetting. - Paolo Liberatore (Ann. Pure Appl. Log., 2024)

Can we forget how we learned? Doxastic redundancy in iterated belief revision. - Paolo Liberatore (CoRR, 2024)

Common equivalence and size of forgetting from Horn formulae. - Paolo Liberatore (Ann. Math. Artif. Intell., 2024)

Natural revision is contingently-conditionalized revision. - Paolo Liberatore (Int. J. Approx. Reason., 2025)

On the redundancy of short and heterogeneous sequences of belief revisions. - Paolo Liberatore (CoRR, 2025)

One Head is Better than Two: A Polynomial Restriction for Propositional Definite Horn Forgetting. - Paolo Liberatore (J. Log. Lang. Inf., 2025)

Iterated belief revision: from postulates to abilities. - Paolo Liberatore (CoRR, 2025)