Search the dblp DataBase
Paolo Liberatore :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Paolo Liberatore , Marco Schaerf The Complexity of Model Checking for Belief Revision and Update. [Citation Graph (1, 0)][DBLP ] AAAI/IAAI, Vol. 1, 1996, pp:556-561 [Conf ] Paolo Liberatore , Marco Schaerf Relating Belief Revision and Circumscription. [Citation Graph (1, 0)][DBLP ] IJCAI, 1995, pp:1557-1566 [Conf ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf The Size of a Revised Knowledge Base. [Citation Graph (1, 10)][DBLP ] PODS, 1995, pp:151-162 [Conf ] Paolo Liberatore The Size of MDP Factored Policies. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2002, pp:267-272 [Conf ] Paolo Liberatore , Marco Schaerf Compilability of Abduction. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2000, pp:349-354 [Conf ] Andrea Ferrara , Paolo Liberatore , Marco Schaerf The Complexity of Action Redundancy. [Citation Graph (0, 0)][DBLP ] AI*IA, 2005, pp:1-12 [Conf ] Paolo Liberatore The Complexity of Checking Redundancy of CNF Propositional Formulae. [Citation Graph (0, 0)][DBLP ] ECAI, 2002, pp:262-266 [Conf ] Paolo Liberatore Uncontroversial Default Logic. [Citation Graph (0, 0)][DBLP ] ECAI, 2002, pp:526-530 [Conf ] Paolo Liberatore On Non-Conservative Plan Modification. [Citation Graph (0, 0)][DBLP ] ECAI, 1998, pp:518-519 [Conf ] Paolo Liberatore , Francesco M. Donini Verification Programs for Abduction. [Citation Graph (0, 0)][DBLP ] ECAI, 2000, pp:166-170 [Conf ] Paolo Liberatore , Marco Schaerf The Complexity of Model Checking for Propositional Default Logics. [Citation Graph (0, 0)][DBLP ] ECAI, 1998, pp:18-22 [Conf ] Paolo Liberatore The Complexity of Iterated Belief Revision. [Citation Graph (0, 14)][DBLP ] ICDT, 1997, pp:276-290 [Conf ] Paolo Liberatore The Complexity of Belief Update. [Citation Graph (0, 0)][DBLP ] IJCAI (1), 1997, pp:68-73 [Conf ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf Feasibility and Unfeasibility of Off-Line Processing. [Citation Graph (0, 0)][DBLP ] ISTCS, 1996, pp:100-109 [Conf ] Paolo Liberatore A Framework for Belief Update. [Citation Graph (0, 0)][DBLP ] JELIA, 2000, pp:361-375 [Conf ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. [Citation Graph (0, 0)][DBLP ] KR, 1996, pp:364-373 [Conf ] Sylvie Coste-Marquis , Jérôme Lang , Paolo Liberatore , Pierre Marquis Expressive Power and Succinctness of Propositional Languages for Preference Representation. [Citation Graph (0, 0)][DBLP ] KR, 2004, pp:203-212 [Conf ] Francesco M. Donini , Paolo Liberatore , Fabio Massacci , Marco Schaerf Solving QBF by SMV. [Citation Graph (0, 0)][DBLP ] KR, 2002, pp:578-592 [Conf ] Paolo Liberatore On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. [Citation Graph (0, 0)][DBLP ] KR, 1998, pp:144-155 [Conf ] Paolo Liberatore , Marco Schaerf BReLS: A System for the Integration of Knowledge Bases. [Citation Graph (0, 0)][DBLP ] KR, 2000, pp:145-152 [Conf ] Paolo Liberatore , Marco Schaerf Arbitration: A Commutative Operator for Belief Revision. [Citation Graph (0, 0)][DBLP ] WOCFAI, 1995, pp:217-228 [Conf ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf The Size of a Revised Knowledge Base. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1999, v:115, n:1, pp:25-64 [Journal ] Jérôme Lang , Paolo Liberatore , Pierre Marquis Conditional independence in propositional logic. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2002, v:141, n:1/2, pp:79-121 [Journal ] Paolo Liberatore On the complexity of choosing the branching literal in DPLL. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2000, v:116, n:1-2, pp:315-326 [Journal ] Paolo Liberatore The complexity of belief update. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2000, v:119, n:1-2, pp:141-190 [Journal ] Paolo Liberatore Redundancy in logic I: CNF propositional formulae. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2005, v:163, n:2, pp:203-232 [Journal ] Paolo Liberatore , Marco Schaerf Reducing Belief Revision to Circumscription (and Vice Versa). [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1997, v:93, n:, pp:261-296 [Journal ] Thierry Vidal , Paolo Liberatore Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/). [Citation Graph (0, 0)][DBLP ] AI Commun., 2004, v:17, n:1, pp:1-2 [Journal ] Paolo Liberatore , Marco Schaerf Compilability of Abduction [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Paolo Liberatore Redundancy in Logic I: CNF Propositional Formulae [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Paolo Liberatore Merging Locally Correct Knowledge Bases: A Preliminary Report [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Paolo Liberatore Where Fail-Safe Default Logics Fail [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Paolo Liberatore On the Complexity of Case-Based Planning [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Paolo Liberatore The Complexity of Modified Instances [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Paolo Liberatore Complexity Results on DPLL and Resolution [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Paolo Liberatore , Marco Schaerf The complexity of model checking for propositional default logics. [Citation Graph (0, 0)][DBLP ] Data Knowl. Eng., 2005, v:55, n:2, pp:189-202 [Journal ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf k-Approximating Circuits [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:067, pp:- [Journal ] Paolo Liberatore The Complexity of the Language A. [Citation Graph (0, 0)][DBLP ] Electron. Trans. Artif. Intell., 1997, v:1, n:, pp:13-38 [Journal ] Paolo Liberatore Compilability of Domain Descriptions in the Language A. [Citation Graph (0, 0)][DBLP ] Electron. Trans. Artif. Intell., 1997, v:1, n:, pp:129-132 [Journal ] Paolo Liberatore , Marco Schaerf The Compactness of Belief Revision and Update Operators. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2004, v:62, n:3-4, pp:377-393 [Journal ] Xishun Zhao , Paolo Liberatore Complexity of the Unique Extension Problem in Default Logic. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2002, v:53, n:1, pp:79-104 [Journal ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf Preprocessing of Intractable Problems. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:176, n:2, pp:89-120 [Journal ] Paolo Liberatore Representability in Default Logic. [Citation Graph (0, 0)][DBLP ] Logic Journal of the IGPL, 2005, v:13, n:3, pp:335-351 [Journal ] Paolo Liberatore Complexity and compilability of diagnosis and recovery of graph-based systems. [Citation Graph (0, 0)][DBLP ] Int. J. Intell. Syst., 2005, v:20, n:10, pp:1053-1076 [Journal ] Paolo Liberatore On the complexity of extension checking in default logic. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:98, n:2, pp:61-65 [Journal ] Paolo Liberatore Monotonic reductions, representative equivalence, and compilation of intractable problems. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:6, pp:1091-1125 [Journal ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf Space Efficiency of Propositional Knowledge Representation Formalisms. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2000, v:13, n:, pp:1-31 [Journal ] Jérôme Lang , Paolo Liberatore , Pierre Marquis Propositional Independence: Formula-Variable Independence and Forgetting. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2003, v:18, n:, pp:391-443 [Journal ] Paolo Liberatore On Polynomial Sized MDP Succinct Policies. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:551-577 [Journal ] Paolo Liberatore Seminormalizing a default theory. [Citation Graph (0, 0)][DBLP ] Journal of Applied Non-Classical Logics, 2005, v:15, n:3, pp:321-340 [Journal ] Paolo Liberatore , Marco Schaerf Belief Revision and Update: Complexity of Model Checking. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2001, v:62, n:1, pp:43-72 [Journal ] Paolo Liberatore On the complexity of case-based planning. [Citation Graph (0, 0)][DBLP ] J. Exp. Theor. Artif. Intell., 2005, v:17, n:3, pp:283-295 [Journal ] Paolo Liberatore Uncontroversial Default Logic. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 2004, v:14, n:5, pp:747-765 [Journal ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf k-Approximating Circuits. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2006, v:55, n:7, pp:913-917 [Journal ] Paolo Liberatore , Marco Schaerf Arbitration (or How to Merge Knowledge Bases). [Citation Graph (0, 12)][DBLP ] IEEE Trans. Knowl. Data Eng., 1998, v:10, n:1, pp:76-90 [Journal ] Paolo Liberatore Compilability and compact representations of revision of Horn knowledge bases. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2000, v:1, n:1, pp:131-161 [Journal ] Paolo Liberatore Complexity results on DPLL and resolution. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2006, v:7, n:1, pp:84-107 [Journal ] Paolo Liberatore , Marco Schaerf Compilability of propositional abduction. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:1, pp:- [Journal ] Andrea Ferrara , Paolo Liberatore , Marco Schaerf Model Checking and Preprocessing. [Citation Graph (0, 0)][DBLP ] AI*IA, 2007, pp:48-59 [Conf ] Paolo Liberatore Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems [Citation Graph (0, 0)][DBLP ] CoRR, 2005, v:0, n:, pp:- [Journal ] Paolo Liberatore Bijective Faithful Translations among Default Logics [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Paolo Liberatore Raising a Hardness Result [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Paolo Liberatore Where fail-safe default logics fail. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:2, pp:- [Journal ] Redundancy in logic II: 2CNF and Horn propositional formulae. [Citation Graph (, )][DBLP ] Redundancy in logic III: Non-monotonic reasoning. [Citation Graph (, )][DBLP ] Redundancy in Logic II: 2CNF and Horn Propositional Formulae [Citation Graph (, )][DBLP ] Redundancy in Logic III: Non-Mononotonic Reasoning [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.490secs