- CSB - MetaPress - Google - Bing - Yahoo
 | 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 | | |
| 2010 | ||
| i15 | | Paolo Liberatore, Marco Schaerf: On the size of data structures used in symbolic model checking. CoRR abs/1012.3018 (2010) |
| 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 | | |
| j30 | | Paolo Liberatore, Marco Schaerf: Compilability of propositional abduction. ACM Trans. Comput. Log. 8(1) (2007) |
| j29 | | |
| c22 | | Andrea Ferrara, Paolo Liberatore, Marco Schaerf: Model Checking and Preprocessing. AI*IA 2007: 48-59 |
| i14 | | |
| i13 | | |
| 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. Logic Journal of the 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. Journal of Applied Non-Classical 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) |
| c21 | | Andrea Ferrara, Paolo Liberatore, Marco Schaerf: The Complexity of Action Redundancy. AI*IA 2005: 1-12 |
| 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 | | |
| 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. Inform. 62(3-4): 377-393 (2004) |
| j17 | | Paolo Liberatore: On Polynomial Sized MDP Succinct Policies. J. Artif. Intell. Res. (JAIR) 21: 551-577 (2004) |
| j16 | | |
| 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 |
| i9 | | |
| i8 | | |
| i7 | | |
| 2003 | ||
| j15 | | Jérôme Lang, Paolo Liberatore, Pierre Marquis: Propositional Independence: Formula-Variable Independence and Forgetting. J. Artif. Intell. Res. (JAIR) 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. Inform. 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) |
| c19 | | |
| c18 |  | Paolo Liberatore: The Complexity of Checking Redundancy of CNF Propositional Formulae. ECAI 2002: 262-266 |
| c17 | | |
| c16 | | Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf: Solving QBF by SMV. KR 2002: 578-592 |
| i6 | | |
| i5 | | |
| i4 | | Paolo Liberatore: Merging Locally Correct Knowledge Bases: A Preliminary Report. CoRR cs.AI/0212053 (2002) |
| i3 | | |
| i2 | | Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. Electronic Colloquium on Computational Complexity (ECCC)(067) (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 | | |
| j7 | | Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. (JAIR) 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) |
| c15 | | |
| c14 | | |
| c13 | | |
| c12 | | Paolo Liberatore, Marco Schaerf: BReLS: A System for the Integration of Knowledge Bases. KR 2000: 145-152 |
| 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) |
| i1 | | Peter Jonsson, Paolo Liberatore: On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction. Electronic Colloquium on Computational Complexity (ECCC) 6(38) (1999) |
| 1998 | ||
| j4 | | Paolo Liberatore, Marco Schaerf: Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10(1): 76-90 (1998) |
| c11 | | Paolo Liberatore, Marco Schaerf: The Complexity of Model Checking for Propositional Default Logics. ECAI 1998: 18-22 |
| c10 | | |
| c9 | | Paolo Liberatore: On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. KR 1998: 144-155 |
| 1997 | ||
| j3 | | Paolo Liberatore, Marco Schaerf: Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93: 261-296 (1997) |
| j2 | | |
| j1 | | Paolo Liberatore: Compilability of Domain Descriptions in the Language A. Electron. Trans. Artif. Intell. 1: 129-132 (1997) |
| c8 | | |
| c7 | | |
| 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 |
| 1 | Marco Cadoli | |
| 2 | Sylvie Coste-Marquis | |
| 3 | Francesco M. Donini | |
| 4 | Andrea Ferrara | |
| 5 | Peter Jonsson | |
| 6 | Jérôme Lang | |
| 7 | Pierre Marquis | |
| 8 | Fabio Massacci | |
| 9 | Marco Schaerf | |
| 10 | Thierry Vidal | |
| 11 | Xishun Zhao |
Colors in the list of coauthors
Last update Sat May 25 21:48:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page