Paolo Liberatore

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 23

Top Venues

CoRR

J. Log. Comput.

ACM Trans. Comput. Log.

J. Artif. Intell. Res.

Publications

Paolo Liberatore
Representing states in iterated belief revision. Artif. Intell. 336 (2024)
Paolo Liberatore
Can we forget how we learned? Doxastic redundancy in iterated belief revision. CoRR (2024)
Paolo Liberatore
The ghosts of forgotten things: A study on size after forgetting. Ann. Pure Appl. Log. 175 (8) (2024)
Paolo Liberatore
Natural revision is contingently-conditionalized revision. CoRR (2023)
Paolo Liberatore
Can we forget how we learned? Representing states in iterated belief revision}. CoRR (2023)
Paolo Liberatore
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity. ACM Trans. Comput. Log. 24 (3) (2023)
Paolo Liberatore
Reconstructing a single-head formula to facilitate logical forgetting. J. Log. Comput. 33 (7) (2023)
Paolo Liberatore
Superredundancy: A tool for Boolean formula minimization complexity analysis. CoRR (2022)
Paolo Liberatore
Four algorithms for propositional forgetting. CoRR (2022)
Paolo Liberatore
Abductive forgetting. CoRR (2022)
Paolo Liberatore
Superredundancy: A tool for Boolean formula minimization complexity analysis. Electron. Colloquium Comput. Complex. (2022)
Paolo Liberatore
On Mixed Iterated Revisions. CoRR (2021)
Paolo Liberatore
Merging with unknown reliability. CoRR (2021)
Paolo Liberatore
Reconstructing a single-head formula to facilitate logical forgetting. CoRR (2020)
Paolo Liberatore
One head is better than two: a polynomial restriction for propositional definite Horn forgetting. CoRR (2020)
Paolo Liberatore
The ghosts of forgotten things: A study on size after forgetting. CoRR (2020)
Paolo Liberatore
Common equivalence and size after forgetting. CoRR (2020)
Paolo Liberatore
Belief Integration and Source Reliability Assessment. J. Artif. Intell. Res. 63 (2018)
Andrea Ferrara, Paolo Liberatore, Marco Schaerf
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking. IEEE Trans. Computers 65 (10) (2016)
Paolo Liberatore
Belief Merging by Examples. ACM Trans. Comput. Log. 17 (2) (2016)
Paolo Liberatore
Belief Merging by Source Reliability Assessment. CoRR (2016)
Paolo Liberatore, Marco Schaerf
On the complexity of second-best abductive explanations. Int. J. Approx. Reason. 63 (2015)
Paolo Liberatore
Revision by History. J. Artif. Intell. Res. 52 (2015)
Paolo Liberatore
Belief revision by examples. CoRR (2014)
Paolo Liberatore
Bijective faithful translations among default logics. J. Log. Comput. 24 (4) (2014)
Paolo Liberatore, Marco Schaerf
The compilability framework. Intelligenza Artificiale 7 (1) (2013)
Paolo Liberatore, Marco Schaerf
On the Complexity of Finding Second-Best Abductive Explanations CoRR (2012)
Jérôme Lang, Paolo Liberatore, Pierre Marquis
Propositional Independence - Formula-Variable Independence and Forgetting CoRR (2011)
Paolo Liberatore
On Polynomial Sized MDP Succinct Policies CoRR (2011)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Space Efficiency of Propositional Knowledge Representation Formalisms CoRR (2011)
Paolo Liberatore, Marco Schaerf
On the size of data structures used in symbolic model checking CoRR (2010)
Paolo Liberatore
Redundancy in logic II: 2CNF and Horn propositional formulae. Artif. Intell. 172 (2-3) (2008)
Paolo Liberatore
Redundancy in logic III: Non-monotonic reasoning. Artif. Intell. 172 (11) (2008)
Paolo Liberatore
Where fail-safe default logics fail. ACM Trans. Comput. Log. 8 (2) (2007)
Andrea Ferrara, Paolo Liberatore, Marco Schaerf
Model Checking and Preprocessing. AI*IA (2007)
Paolo Liberatore
Bijective Faithful Translations among Default Logics CoRR (2007)
Paolo Liberatore, Marco Schaerf
Compilability of propositional abduction. ACM Trans. Comput. Log. 8 (1) (2007)
Paolo Liberatore
Consistency Defaults. Stud Logica 86 (1) (2007)
Paolo Liberatore
Raising a Hardness Result CoRR (2007)
Paolo Liberatore
Complexity results on DPLL and resolution. ACM Trans. Comput. Log. 7 (1) (2006)
Paolo Liberatore
On the complexity of extension checking in default logic. Inf. Process. Lett. 98 (2) (2006)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
k-Approximating Circuits. IEEE Trans. Computers 55 (7) (2006)
Paolo Liberatore
Redundancy in logic I: CNF propositional formulae. Artif. Intell. 163 (2) (2005)
Paolo Liberatore
Redundancy in Logic III: Non-Mononotonic Reasoning CoRR (2005)
Paolo Liberatore
Complexity and compilability of diagnosis and recovery of graph-based systems. Int. J. Intell. Syst. 20 (10) (2005)
Andrea Ferrara, Paolo Liberatore, Marco Schaerf
The Complexity of Action Redundancy. AI*IA (2005)
Paolo Liberatore
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems CoRR (2005)
Paolo Liberatore, Marco Schaerf
The complexity of model checking for propositional default logics. Data Knowl. Eng. 55 (2) (2005)
Paolo Liberatore
Representability in Default Logic. Log. J. IGPL 13 (3) (2005)
Paolo Liberatore
On the complexity of case-based planning. J. Exp. Theor. Artif. Intell. 17 (3) (2005)
Paolo Liberatore
Redundancy in Logic II: 2CNF and Horn Propositional Formulae CoRR (2005)
Paolo Liberatore
Seminormalizing a default theory. J. Appl. Non Class. Logics 15 (3) (2005)
Sylvie Coste-Marquis, Jérôme Lang, Paolo Liberatore, Pierre Marquis
Expressive Power and Succinctness of Propositional Languages for Preference Representation. KR (2004)
Paolo Liberatore
The Complexity of Modified Instances CoRR (2004)
Paolo Liberatore
On Polynomial Sized MDP Succinct Policies. J. Artif. Intell. Res. 21 (2004)
Paolo Liberatore, Marco Schaerf
The Compactness of Belief Revision and Update Operators. Fundam. Informaticae 62 (3-4) (2004)
Paolo Liberatore
On the Complexity of Case-Based Planning CoRR (2004)
Thierry Vidal, Paolo Liberatore
Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/). AI Commun. 17 (1) (2004)
Paolo Liberatore
Where Fail-Safe Default Logics Fail CoRR (2004)
Paolo Liberatore
Uncontroversial Default Logic. J. Log. Comput. 14 (5) (2004)
Jérôme Lang, Paolo Liberatore, Pierre Marquis
Propositional Independence: Formula-Variable Independence and Forgetting. J. Artif. Intell. Res. 18 (2003)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Preprocessing of Intractable Problems. Inf. Comput. 176 (2) (2002)
Paolo Liberatore
Uncontroversial Default Logic. ECAI (2002)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
k-Approximating Circuits Electron. Colloquium Comput. Complex. (067) (2002)
Paolo Liberatore
Merging Locally Correct Knowledge Bases: A Preliminary Report CoRR (2002)
Paolo Liberatore
Redundancy in Logic I: CNF Propositional Formulae CoRR (2002)
Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf
Solving QBF by SMV. KR (2002)
Xishun Zhao, Paolo Liberatore
Complexity of the Unique Extension Problem in Default Logic. Fundam. Informaticae 53 (1) (2002)
Jérôme Lang, Paolo Liberatore, Pierre Marquis
Conditional independence in propositional logic. Artif. Intell. 141 (1/2) (2002)
Paolo Liberatore
The Complexity of Checking Redundancy of CNF Propositional Formulae. ECAI (2002)
Paolo Liberatore
Complexity Results on DPLL and Resolution CoRR (2002)
Paolo Liberatore
The Size of MDP Factored Policies. AAAI/IAAI (2002)
Paolo Liberatore, Marco Schaerf
Compilability of Abduction CoRR (2002)
Paolo Liberatore, Marco Schaerf
Belief Revision and Update: Complexity of Model Checking. J. Comput. Syst. Sci. 62 (1) (2001)
Paolo Liberatore
Monotonic reductions, representative equivalence, and compilation of intractable problems. J. ACM 48 (6) (2001)
Paolo Liberatore, Francesco M. Donini
Verification Programs for Abduction. ECAI (2000)
Paolo Liberatore
Compilability and compact representations of revision of Horn knowledge bases. ACM Trans. Comput. Log. 1 (1) (2000)
Paolo Liberatore
A Framework for Belief Update. JELIA (2000)
Paolo Liberatore, Marco Schaerf
Compilability of Abduction. AAAI/IAAI (2000)
Paolo Liberatore
The complexity of belief update. Artif. Intell. 119 (1-2) (2000)
Paolo Liberatore, Marco Schaerf
BReLS: A System for the Integration of Knowledge Bases. KR (2000)
Paolo Liberatore
On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116 (1-2) (2000)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. 13 (2000)
Peter Jonsson, Paolo Liberatore
On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction Electron. Colloquium Comput. Complex. 6 (38) (1999)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
The Size of a Revised Knowledge Base. Artif. Intell. 115 (1) (1999)
Paolo Liberatore, Marco Schaerf
Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10 (1) (1998)
Paolo Liberatore
On Non-Conservative Plan Modification. ECAI (1998)
Paolo Liberatore
On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. KR (1998)
Paolo Liberatore, Marco Schaerf
The Complexity of Model Checking for Propositional Default Logics. ECAI (1998)
Paolo Liberatore
The Complexity of Belief Update. IJCAI (1) (1997)
Paolo Liberatore
The Complexity of the Language A. Electron. Trans. Artif. Intell. 1 (1997)
Paolo Liberatore, Marco Schaerf
Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93 (1997)
Paolo Liberatore
The Complexity of Iterated Belief Revision. ICDT (1997)
Paolo Liberatore
Compilability of Domain Descriptions in the Language A. Electron. Trans. Artif. Intell. 1 (1997)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Feasibility and Unfeasibility of Off-Line Processing. ISTCS (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR (1996)
Paolo Liberatore, Marco Schaerf
The Complexity of Model Checking for Belief Revision and Update. AAAI/IAAI, Vol. 1 (1996)
Paolo Liberatore, Marco Schaerf
Arbitration: A Commutative Operator for Belief Revision. WOCFAI (1995)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
The Size of a Revised Knowledge Base. PODS (1995)
Paolo Liberatore, Marco Schaerf
Relating Belief Revision and Circumscription. IJCAI (1995)

Paolo Liberatore.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paolo Liberatore