default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Liberatore
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j44]Paolo Liberatore:
Representing states in iterated belief revision. Artif. Intell. 336: 104200 (2024)- [j43]Paolo Liberatore:
The ghosts of forgotten things: A study on size after forgetting. Ann. Pure Appl. Log. 175(8): 103456 (2024) - 2023
- [j42]Paolo Liberatore:
Reconstructing a single-head formula to facilitate logical forgetting. J. Log. Comput. 33(7): 1596-1624 (2023) - [j41]Paolo Liberatore
:
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity. ACM Trans. Comput. Log. 24(3): 27:1-27:49 (2023) - 2018
- [j40]Paolo Liberatore:
Belief Integration and Source Reliability Assessment. J. Artif. Intell. Res. 63: 87-143 (2018) - 2016
- [j39]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking. IEEE Trans. Computers 65(10): 3148-3156 (2016) - [j38]Paolo Liberatore:
Belief Merging by Examples. ACM Trans. Comput. Log. 17(2): 9 (2016) - 2015
- [j37]Paolo Liberatore, Marco Schaerf:
On the complexity of second-best abductive explanations. Int. J. Approx. Reason. 63: 22-31 (2015) - [j36]Paolo Liberatore:
Revision by History. J. Artif. Intell. Res. 52: 287-329 (2015) - 2014
- [j35]Paolo Liberatore:
Bijective faithful translations among default logics. J. Log. Comput. 24(4): 763-807 (2014) - 2013
- [j34]Paolo Liberatore, Marco Schaerf:
The compilability framework. Intelligenza Artificiale 7(1): 31-35 (2013) - 2008
- [j33]Paolo Liberatore:
Redundancy in logic II: 2CNF and Horn propositional formulae. Artif. Intell. 172(2-3): 265-299 (2008) - [j32]Paolo Liberatore:
Redundancy in logic III: Non-monotonic reasoning. Artif. Intell. 172(11): 1317-1359 (2008) - 2007
- [j31]Paolo Liberatore:
Consistency Defaults. Stud Logica 86(1): 89-110 (2007) - [j30]Paolo Liberatore, Marco Schaerf:
Compilability of propositional abduction. ACM Trans. Comput. Log. 8(1): 2 (2007) - [j29]Paolo Liberatore:
Where fail-safe default logics fail. ACM Trans. Comput. Log. 8(2): 10 (2007) - 2006
- [j28]Paolo Liberatore:
On the complexity of extension checking in default logic. Inf. Process. Lett. 98(2): 61-65 (2006) - [j27]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006) - [j26]Paolo Liberatore:
Complexity results on DPLL and resolution. ACM Trans. Comput. Log. 7(1): 84-107 (2006) - 2005
- [j25]Paolo Liberatore:
Redundancy in logic I: CNF propositional formulae. Artif. Intell. 163(2): 203-232 (2005) - [j24]Paolo Liberatore, Marco Schaerf:
The complexity of model checking for propositional default logics. Data Knowl. Eng. 55(2): 189-202 (2005) - [j23]Paolo Liberatore:
Representability in Default Logic. Log. J. IGPL 13(3): 335-351 (2005) - [j22]Paolo Liberatore:
Complexity and compilability of diagnosis and recovery of graph-based systems. Int. J. Intell. Syst. 20(10): 1053-1076 (2005) - [j21]Paolo Liberatore:
Seminormalizing a default theory. J. Appl. Non Class. Logics 15(3): 321-340 (2005) - [j20]Paolo Liberatore:
On the complexity of case-based planning. J. Exp. Theor. Artif. Intell. 17(3): 283-295 (2005) - 2004
- [j19]Thierry Vidal, Paolo Liberatore:
Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/). AI Commun. 17(1): 1-2 (2004) - [j18]Paolo Liberatore, Marco Schaerf:
The Compactness of Belief Revision and Update Operators. Fundam. Informaticae 62(3-4): 377-393 (2004) - [j17]Paolo Liberatore:
On Polynomial Sized MDP Succinct Policies. J. Artif. Intell. Res. 21: 551-577 (2004) - [j16]Paolo Liberatore:
Uncontroversial Default Logic. J. Log. Comput. 14(5): 747-765 (2004) - 2003
- [j15]Jérôme Lang, Paolo Liberatore, Pierre Marquis:
Propositional Independence: Formula-Variable Independence and Forgetting. J. Artif. Intell. Res. 18: 391-443 (2003) - 2002
- [j14]Jérôme Lang, Paolo Liberatore, Pierre Marquis:
Conditional independence in propositional logic. Artif. Intell. 141(1/2): 79-121 (2002) - [j13]Xishun Zhao, Paolo Liberatore:
Complexity of the Unique Extension Problem in Default Logic. Fundam. Informaticae 53(1): 79-104 (2002) - [j12]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002) - 2001
- [j11]Paolo Liberatore:
Monotonic reductions, representative equivalence, and compilation of intractable problems. J. ACM 48(6): 1091-1125 (2001) - [j10]Paolo Liberatore, Marco Schaerf:
Belief Revision and Update: Complexity of Model Checking. J. Comput. Syst. Sci. 62(1): 43-72 (2001) - 2000
- [j9]Paolo Liberatore:
On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116(1-2): 315-326 (2000) - [j8]Paolo Liberatore:
The complexity of belief update. Artif. Intell. 119(1-2): 141-190 (2000) - [j7]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. 13: 1-31 (2000) - [j6]Paolo Liberatore:
Compilability and compact representations of revision of Horn knowledge bases. ACM Trans. Comput. Log. 1(1): 131-161 (2000) - 1999
- [j5]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999) - 1998
- [j4]Paolo Liberatore, Marco Schaerf:
Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10(1): 76-90 (1998) - 1997
- [j3]Paolo Liberatore, Marco Schaerf:
Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93: 261-296 (1997) - [j2]Paolo Liberatore:
The Complexity of the Language A. Electron. Trans. Artif. Intell. 1: 13-38 (1997) - [j1]Paolo Liberatore:
Compilability of Domain Descriptions in the Language A. Electron. Trans. Artif. Intell. 1: 129-132 (1997)
Conference and Workshop Papers
- 2007
- [c22]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
Model Checking and Preprocessing. AI*IA 2007: 48-59 - 2005
- [c21]Andrea Ferrara, Paolo Liberatore, Marco Schaerf:
The Complexity of Action Redundancy. AI*IA 2005: 1-12 - 2004
- [c20]Sylvie Coste-Marquis, Jérôme Lang, Paolo Liberatore, Pierre Marquis:
Expressive Power and Succinctness of Propositional Languages for Preference Representation. KR 2004: 203-212 - 2002
- [c19]Paolo Liberatore:
The Size of MDP Factored Policies. AAAI/IAAI 2002: 267-272 - [c18]Paolo Liberatore:
The Complexity of Checking Redundancy of CNF Propositional Formulae. ECAI 2002: 262-266 - [c17]Paolo Liberatore:
Uncontroversial Default Logic. ECAI 2002: 526-530 - [c16]Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf:
Solving QBF by SMV. KR 2002: 578-592 - 2000
- [c15]Paolo Liberatore, Marco Schaerf:
Compilability of Abduction. AAAI/IAAI 2000: 349-354 - [c14]Paolo Liberatore, Francesco M. Donini:
Verification Programs for Abduction. ECAI 2000: 166-170 - [c13]Paolo Liberatore:
A Framework for Belief Update. JELIA 2000: 361-375 - [c12]Paolo Liberatore, Marco Schaerf:
BReLS: A System for the Integration of Knowledge Bases. KR 2000: 145-152 - 1998
- [c11]Paolo Liberatore, Marco Schaerf:
The Complexity of Model Checking for Propositional Default Logics. ECAI 1998: 18-22 - [c10]Paolo Liberatore:
On Non-Conservative Plan Modification. ECAI 1998: 518-519 - [c9]Paolo Liberatore:
On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. KR 1998: 144-155 - 1997
- [c8]Paolo Liberatore:
The Complexity of Iterated Belief Revision. ICDT 1997: 276-290 - [c7]Paolo Liberatore:
The Complexity of Belief Update. IJCAI (1) 1997: 68-73 - 1996
- [c6]Paolo Liberatore, Marco Schaerf:
The Complexity of Model Checking for Belief Revision and Update. AAAI/IAAI, Vol. 1 1996: 556-561 - [c5]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109 - [c4]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373 - 1995
- [c3]Paolo Liberatore, Marco Schaerf:
Relating Belief Revision and Circumscription. IJCAI 1995: 1557-1566 - [c2]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
The Size of a Revised Knowledge Base. PODS 1995: 151-162 - [c1]Paolo Liberatore, Marco Schaerf:
Arbitration: A Commutative Operator for Belief Revision. WOCFAI 1995: 217-228
Editorship
- 2012
- [e1]Paolo Liberatore, Michele Lombardi, Floriano Scioscia:
Proceedings of the Doctoral Consortium of the 12th Symposium of the Italian Association for Artificial Intelligence, Rome, Italy, June 15, 2012. CEUR Workshop Proceedings 926, CEUR-WS.org 2012 [contents]
Informal and Other Publications
- 2024
- [i34]Paolo Liberatore:
Can we forget how we learned? Doxastic redundancy in iterated belief revision. CoRR abs/2402.15445 (2024) - 2023
- [i33]Paolo Liberatore:
Can we forget how we learned? Representing states in iterated belief revision}. CoRR abs/2305.09200 (2023) - [i32]Paolo Liberatore:
Natural revision is contingently-conditionalized revision. CoRR abs/2309.12655 (2023) - 2022
- [i31]Paolo Liberatore:
Four algorithms for propositional forgetting. CoRR abs/2204.06528 (2022) - [i30]Paolo Liberatore:
Superredundancy: A tool for Boolean formula minimization complexity analysis. CoRR abs/2205.00762 (2022) - [i29]Paolo Liberatore:
Abductive forgetting. CoRR abs/2209.12825 (2022) - [i28]Paolo Liberatore:
Superredundancy: A tool for Boolean formula minimization complexity analysis. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i27]Paolo Liberatore:
Merging with unknown reliability. CoRR abs/2101.02516 (2021) - [i26]Paolo Liberatore:
On Mixed Iterated Revisions. CoRR abs/2104.03571 (2021) - 2020
- [i25]Paolo Liberatore:
The ghosts of forgotten things: A study on size after forgetting. CoRR abs/2005.04123 (2020) - [i24]Paolo Liberatore:
Common equivalence and size after forgetting. CoRR abs/2006.11152 (2020) - [i23]Paolo Liberatore:
One head is better than two: a polynomial restriction for propositional definite Horn forgetting. CoRR abs/2009.07497 (2020) - [i22]Paolo Liberatore:
Reconstructing a single-head formula to facilitate logical forgetting. CoRR abs/2012.10191 (2020) - 2016
- [i21]Paolo Liberatore:
Belief Merging by Source Reliability Assessment. CoRR abs/1605.02160 (2016) - 2014
- [i20]Paolo Liberatore:
Belief revision by examples. CoRR abs/1409.5340 (2014) - 2012
- [i19]Paolo Liberatore, Marco Schaerf:
On the Complexity of Finding Second-Best Abductive Explanations. CoRR abs/1204.5859 (2012) - 2011
- [i18]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Space Efficiency of Propositional Knowledge Representation Formalisms. CoRR abs/1106.0233 (2011) - [i17]Jérôme Lang, Paolo Liberatore, Pierre Marquis:
Propositional Independence - Formula-Variable Independence and Forgetting. CoRR abs/1106.4578 (2011) - [i16]Paolo Liberatore:
On Polynomial Sized MDP Succinct Policies. CoRR abs/1106.4866 (2011) - 2010
- [i15]Paolo Liberatore, Marco Schaerf:
On the size of data structures used in symbolic model checking. CoRR abs/1012.3018 (2010) - 2007
- [i14]Paolo Liberatore:
Bijective Faithful Translations among Default Logics. CoRR abs/0707.3781 (2007) - [i13]Paolo Liberatore:
Raising a Hardness Result. CoRR abs/0708.4170 (2007) - 2005
- [i12]Paolo Liberatore:
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems. CoRR abs/cs/0503043 (2005) - [i11]Paolo Liberatore:
Redundancy in Logic II: 2CNF and Horn Propositional Formulae. CoRR abs/cs/0506074 (2005) - [i10]Paolo Liberatore:
Redundancy in Logic III: Non-Mononotonic Reasoning. CoRR abs/cs/0507048 (2005) - 2004
- [i9]Paolo Liberatore:
Where Fail-Safe Default Logics Fail. CoRR cs.AI/0403032 (2004) - [i8]Paolo Liberatore:
On the Complexity of Case-Based Planning. CoRR cs.AI/0407034 (2004) - [i7]Paolo Liberatore:
The Complexity of Modified Instances. CoRR cs.CC/0402053 (2004) - 2002
- [i6]Paolo Liberatore, Marco Schaerf:
Compilability of Abduction. CoRR cs.AI/0210007 (2002) - [i5]Paolo Liberatore:
Redundancy in Logic I: CNF Propositional Formulae. CoRR cs.AI/0211031 (2002) - [i4]Paolo Liberatore:
Merging Locally Correct Knowledge Bases: A Preliminary Report. CoRR cs.AI/0212053 (2002) - [i3]Paolo Liberatore:
Complexity Results on DPLL and Resolution. CoRR cs.LO/0209032 (2002) - [i2]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
k-Approximating Circuits. Electron. Colloquium Comput. Complex. TR02 (2002) - 1999
- [i1]Peter Jonsson, Paolo Liberatore:
On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction. Electron. Colloquium Comput. Complex. TR99 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
