dblp.uni-trier.dewww.uni-trier.de

Paolo Liberatore Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
69EEPaolo Liberatore: Redundancy in logic III: Non-monotonic reasoning. Artif. Intell. 172(11): 1317-1359 (2008)
68EEPaolo Liberatore: Redundancy in logic II: 2CNF and Horn propositional formulae. Artif. Intell. 172(2-3): 265-299 (2008)
2007
67EEAndrea Ferrara, Paolo Liberatore, Marco Schaerf: Model Checking and Preprocessing. AI*IA 2007: 48-59
66EEPaolo Liberatore, Marco Schaerf: Compilability of propositional abduction. ACM Trans. Comput. Log. 8(1): (2007)
65EEPaolo Liberatore: Where fail-safe default logics fail. ACM Trans. Comput. Log. 8(2): (2007)
64EEPaolo Liberatore: Bijective Faithful Translations among Default Logics CoRR abs/0707.3781: (2007)
63EEPaolo Liberatore: Raising a Hardness Result CoRR abs/0708.4170: (2007)
62EEPaolo Liberatore: Consistency Defaults. Studia Logica 86(1): 89-110 (2007)
2006
61EEPaolo Liberatore: Complexity results on DPLL and resolution. ACM Trans. Comput. Log. 7(1): 84-107 (2006)
60EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006)
59EEPaolo Liberatore: On the complexity of extension checking in default logic. Inf. Process. Lett. 98(2): 61-65 (2006)
2005
58EEAndrea Ferrara, Paolo Liberatore, Marco Schaerf: The Complexity of Action Redundancy. AI*IA 2005: 1-12
57EEPaolo Liberatore: Redundancy in logic I: CNF propositional formulae. Artif. Intell. 163(2): 203-232 (2005)
56EEPaolo Liberatore: Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems CoRR abs/cs/0503043: (2005)
55EEPaolo Liberatore: Redundancy in Logic II: 2CNF and Horn Propositional Formulae CoRR abs/cs/0506074: (2005)
54EEPaolo Liberatore: Redundancy in Logic III: Non-Mononotonic Reasoning CoRR abs/cs/0507048: (2005)
53EEPaolo Liberatore, Marco Schaerf: The complexity of model checking for propositional default logics. Data Knowl. Eng. 55(2): 189-202 (2005)
52EEPaolo Liberatore: Complexity and compilability of diagnosis and recovery of graph-based systems. Int. J. Intell. Syst. 20(10): 1053-1076 (2005)
51EEPaolo Liberatore: On the complexity of case-based planning. J. Exp. Theor. Artif. Intell. 17(3): 283-295 (2005)
50 Paolo Liberatore: Seminormalizing a default theory. Journal of Applied Non-Classical Logics 15(3): 321-340 (2005)
49EEPaolo Liberatore: Representability in Default Logic. Logic Journal of the IGPL 13(3): 335-351 (2005)
2004
48 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
47EEThierry Vidal, Paolo Liberatore: Guest editorial: STAIRS 2002 (http: //stairs2002.univ-lyon1.fr/). AI Commun. 17(1): 1-2 (2004)
46EEPaolo Liberatore: Where Fail-Safe Default Logics Fail CoRR cs.AI/0403032: (2004)
45EEPaolo Liberatore: On the Complexity of Case-Based Planning CoRR cs.AI/0407034: (2004)
44EEPaolo Liberatore: The Complexity of Modified Instances CoRR cs.CC/0402053: (2004)
43EEPaolo Liberatore, Marco Schaerf: The Compactness of Belief Revision and Update Operators. Fundam. Inform. 62(3-4): 377-393 (2004)
42EEPaolo Liberatore: On Polynomial Sized MDP Succinct Policies. J. Artif. Intell. Res. (JAIR) 21: 551-577 (2004)
41EEPaolo Liberatore: Uncontroversial Default Logic. J. Log. Comput. 14(5): 747-765 (2004)
2003
40EEJérôme Lang, Paolo Liberatore, Pierre Marquis: Propositional Independence: Formula-Variable Independence and Forgetting. J. Artif. Intell. Res. (JAIR) 18: 391-443 (2003)
2002
39 Paolo Liberatore: The Size of MDP Factored Policies. AAAI/IAAI 2002: 267-272
38 Paolo Liberatore: The Complexity of Checking Redundancy of CNF Propositional Formulae. ECAI 2002: 262-266
37 Paolo Liberatore: Uncontroversial Default Logic. ECAI 2002: 526-530
36 Francesco M. Donini, Paolo Liberatore, Fabio Massacci, Marco Schaerf: Solving QBF by SMV. KR 2002: 578-592
35EEJérôme Lang, Paolo Liberatore, Pierre Marquis: Conditional independence in propositional logic. Artif. Intell. 141(1/2): 79-121 (2002)
34EEPaolo Liberatore, Marco Schaerf: Compilability of Abduction CoRR cs.AI/0210007: (2002)
33EEPaolo Liberatore: Redundancy in Logic I: CNF Propositional Formulae CoRR cs.AI/0211031: (2002)
32EEPaolo Liberatore: Merging Locally Correct Knowledge Bases: A Preliminary Report CoRR cs.AI/0212053: (2002)
31EEPaolo Liberatore: Complexity Results on DPLL and Resolution CoRR cs.LO/0209032: (2002)
30EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits Electronic Colloquium on Computational Complexity (ECCC)(067): (2002)
29EEXishun Zhao, Paolo Liberatore: Complexity of the Unique Extension Problem in Default Logic. Fundam. Inform. 53(1): 79-104 (2002)
28EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002)
2001
27EEPaolo Liberatore: Monotonic reductions, representative equivalence, and compilation of intractable problems. J. ACM 48(6): 1091-1125 (2001)
26 Paolo Liberatore, Marco Schaerf: Belief Revision and Update: Complexity of Model Checking. J. Comput. Syst. Sci. 62(1): 43-72 (2001)
2000
25 Paolo Liberatore, Marco Schaerf: Compilability of Abduction. AAAI/IAAI 2000: 349-354
24 Paolo Liberatore, Francesco M. Donini: Verification Programs for Abduction. ECAI 2000: 166-170
23EEPaolo Liberatore: A Framework for Belief Update. JELIA 2000: 361-375
22 Paolo Liberatore, Marco Schaerf: BReLS: A System for the Integration of Knowledge Bases. KR 2000: 145-152
21EEPaolo Liberatore: Compilability and compact representations of revision of Horn knowledge bases. ACM Trans. Comput. Log. 1(1): 131-161 (2000)
20EEPaolo Liberatore: On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116(1-2): 315-326 (2000)
19EEPaolo Liberatore: The complexity of belief update. Artif. Intell. 119(1-2): 141-190 (2000)
18EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. (JAIR) 13: 1-31 (2000)
1999
17EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999)
16EEPeter Jonsson, Paolo Liberatore: On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction Electronic Colloquium on Computational Complexity (ECCC) 6(38): (1999)
1998
15 Paolo Liberatore, Marco Schaerf: The Complexity of Model Checking for Propositional Default Logics. ECAI 1998: 18-22
14 Paolo Liberatore: On Non-Conservative Plan Modification. ECAI 1998: 518-519
13 Paolo Liberatore: On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. KR 1998: 144-155
12EEPaolo Liberatore, Marco Schaerf: Arbitration (or How to Merge Knowledge Bases). IEEE Trans. Knowl. Data Eng. 10(1): 76-90 (1998)
1997
11EEPaolo Liberatore: The Complexity of Iterated Belief Revision. ICDT 1997: 276-290
10 Paolo Liberatore: The Complexity of Belief Update. IJCAI (1) 1997: 68-73
9EEPaolo Liberatore, Marco Schaerf: Reducing Belief Revision to Circumscription (and Vice Versa). Artif. Intell. 93: 261-296 (1997)
8EEPaolo Liberatore: Compilability of Domain Descriptions in the Language A. Electron. Trans. Artif. Intell. 1: 129-132 (1997)
7EEPaolo Liberatore: The Complexity of the Language A. Electron. Trans. Artif. Intell. 1: 13-38 (1997)
1996
6 Paolo Liberatore, Marco Schaerf: The Complexity of Model Checking for Belief Revision and Update. AAAI/IAAI, Vol. 1 1996: 556-561
5 Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109
4 Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373
1995
3 Paolo Liberatore, Marco Schaerf: Relating Belief Revision and Circumscription. IJCAI 1995: 1557-1566
2EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. PODS 1995: 151-162
1 Paolo Liberatore, Marco Schaerf: Arbitration: A Commutative Operator for Belief Revision. WOCFAI 1995: 217-228

Coauthor Index

1Marco Cadoli [2] [4] [5] [17] [18] [28] [30] [60]
2Sylvie Coste-Marquis [48]
3Francesco M. Donini [2] [4] [5] [17] [18] [24] [28] [30] [36] [60]
4Andrea Ferrara [58] [67]
5Peter Jonsson [16]
6Jérôme Lang [35] [40] [48]
7Pierre Marquis [35] [40] [48]
8Fabio Massacci [36]
9Marco Schaerf [1] [2] [3] [4] [5] [6] [9] [12] [15] [17] [18] [22] [25] [26] [28] [30] [34] [36] [43] [53] [58] [60] [66] [67]
10Thierry Vidal [47]
11Xishun Zhao [29]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)