Paolo Liberatore

106 papers A* 7A 6B 1Journal 83Unranked 8

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