The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paolo Liberatore: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Paolo Liberatore, Marco Schaerf
    Relating Belief Revision and Circumscription. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1995, pp:1557-1566 [Conf]
  3. 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]
  4. Paolo Liberatore
    The Size of MDP Factored Policies. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:267-272 [Conf]
  5. Paolo Liberatore, Marco Schaerf
    Compilability of Abduction. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:349-354 [Conf]
  6. Andrea Ferrara, Paolo Liberatore, Marco Schaerf
    The Complexity of Action Redundancy. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2005, pp:1-12 [Conf]
  7. Paolo Liberatore
    The Complexity of Checking Redundancy of CNF Propositional Formulae. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:262-266 [Conf]
  8. Paolo Liberatore
    Uncontroversial Default Logic. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:526-530 [Conf]
  9. Paolo Liberatore
    On Non-Conservative Plan Modification. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:518-519 [Conf]
  10. Paolo Liberatore, Francesco M. Donini
    Verification Programs for Abduction. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:166-170 [Conf]
  11. Paolo Liberatore, Marco Schaerf
    The Complexity of Model Checking for Propositional Default Logics. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:18-22 [Conf]
  12. Paolo Liberatore
    The Complexity of Iterated Belief Revision. [Citation Graph (0, 14)][DBLP]
    ICDT, 1997, pp:276-290 [Conf]
  13. Paolo Liberatore
    The Complexity of Belief Update. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:68-73 [Conf]
  14. 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]
  15. Paolo Liberatore
    A Framework for Belief Update. [Citation Graph (0, 0)][DBLP]
    JELIA, 2000, pp:361-375 [Conf]
  16. 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]
  17. 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]
  18. Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf
    Solving QBF by SMV. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:578-592 [Conf]
  19. 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]
  20. Paolo Liberatore, Marco Schaerf
    BReLS: A System for the Integration of Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:145-152 [Conf]
  21. Paolo Liberatore, Marco Schaerf
    Arbitration: A Commutative Operator for Belief Revision. [Citation Graph (0, 0)][DBLP]
    WOCFAI, 1995, pp:217-228 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. Paolo Liberatore
    The complexity of belief update. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:119, n:1-2, pp:141-190 [Journal]
  26. 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]
  27. 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]
  28. 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]
  29. Paolo Liberatore, Marco Schaerf
    Compilability of Abduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  30. Paolo Liberatore
    Redundancy in Logic I: CNF Propositional Formulae [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  31. Paolo Liberatore
    Merging Locally Correct Knowledge Bases: A Preliminary Report [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  32. Paolo Liberatore
    Where Fail-Safe Default Logics Fail [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  33. Paolo Liberatore
    On the Complexity of Case-Based Planning [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  34. Paolo Liberatore
    The Complexity of Modified Instances [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  35. Paolo Liberatore
    Complexity Results on DPLL and Resolution [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. Paolo Liberatore
    Uncontroversial Default Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2004, v:14, n:5, pp:747-765 [Journal]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. Paolo Liberatore, Marco Schaerf
    Compilability of propositional abduction. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:1, pp:- [Journal]
  59. Andrea Ferrara, Paolo Liberatore, Marco Schaerf
    Model Checking and Preprocessing. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2007, pp:48-59 [Conf]
  60. Paolo Liberatore
    Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  61. Paolo Liberatore
    Bijective Faithful Translations among Default Logics [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  62. Paolo Liberatore
    Raising a Hardness Result [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  63. Paolo Liberatore
    Where fail-safe default logics fail. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:2, pp:- [Journal]

  64. Redundancy in logic II: 2CNF and Horn propositional formulae. [Citation Graph (, )][DBLP]


  65. Redundancy in logic III: Non-monotonic reasoning. [Citation Graph (, )][DBLP]


  66. Redundancy in Logic II: 2CNF and Horn Propositional Formulae [Citation Graph (, )][DBLP]


  67. Redundancy in Logic III: Non-Mononotonic Reasoning [Citation Graph (, )][DBLP]


Search in 0.206secs, Finished in 0.209secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002