Paolo Liberatore

Available identifiers

zbMath Open liberatore.paoloMaRDI QIDQ202172

List of research outcomes

Publication	Date of Publication	Type
Common equivalence and size of forgetting from Horn formulae	2025-01-10	Paper
The ghosts of forgotten things: a study on size after forgetting	2024-06-24	Paper
Reconstructing a single-head formula to facilitate logical forgetting	2024-02-08	Paper
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity	2023-07-18	Paper
Belief Integration and Source Reliability Assessment	2018-11-01	Paper
Compilability of propositional abduction	2017-07-12	Paper
Complexity results on DPLL and resolution	2017-07-12	Paper
Belief Merging by Examples	2017-07-12	Paper
Where fail-safe default logics fail	2017-07-12	Paper
Compilability and compact representations of revision of Horn knowledge bases	2017-06-13	Paper
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking	2017-05-16	Paper
On the complexity of second-best abductive explanations	2015-12-21	Paper
Monotonic reductions, representative equivalence, and compilation of intractable problems	2015-10-30	Paper
Revision by History	2015-03-04	Paper
Bijective faithful translations among default logics	2015-01-12	Paper
On the complexity of extension checking in default logic	2010-01-18	Paper
Seminormalizing a default theory	2009-11-30	Paper
Redundancy in logic. II: 2CNF and Horn propositional formulae	2009-07-17	Paper
Redundancy in logic. III: Non-monotonic reasoning	2009-07-17	Paper
Redundancy in logic. I: CNF propositional formulae	2007-10-23	Paper
Consistency defaults	2007-10-16	Paper
AI*IA 2005: Advances in Artificial Intelligence	2006-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q5715663	2006-01-04	Paper
On the complexity of case-based planning	2005-11-15	Paper
Complexity and compilability of diagnosis and recovery of graph-based systems	2005-11-07	Paper
Representability in Default Logic	2005-10-18	Paper
Uncontroversial Default Logic	2005-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4654271	2005-03-03	Paper
Reducing belief revision to circumscription (and vice versa)	2003-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q4411161	2003-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q4796540	2003-06-02	Paper
Conditional independence in propositional logic.	2003-01-21	Paper
Preprocessing of intractable problems	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4536337	2002-11-25	Paper
Belief revision and update: Complexity of model checking	2001-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q4506459	2000-09-19	Paper
The complexity of belief update	2000-08-21	Paper
The size of a revised knowledge base	2000-06-04	Paper
On the complexity of choosing the branching literal in DPLL	2000-06-04	Paper

Research outcomes over time

This page was built for person: Paolo Liberatore