Paolo Liberatore's Publications
Belief Revision
Semantics of Belief Revisions
-
Contrazione e clausole complete
-
Paolo Liberatore
In Giornata di lavoro su ragionamento non
monotono, 1994.
-
Arbitraggio
-
Paolo Liberatore
AI*IA notizie, 7(1):9-12, 1995.
-
Arbitration: A commutative operator for belief revision
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the Second
World Conference on the Fundamentals of Artificial Intelligence
(WOCFAI'95), pages 217-228. Angkor Press, 1995.
FTP download
HTTP download
-
Arbitration (or how to merge knowledge bases)
-
Paolo Liberatore and Marco Schaerf
IEEE Transactions on
Knowledge and Data Engineering, 10(1):76-90, 1998.
HTTP download
-
BReLS: A system for the integration of knowledge bases
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the
Seventh International Conference on Principles of Knowledge Representation
and Reasoning (KR 2000), pages 145-152, 2000.
FTP download
HTTP download
-
A framework for belief update
-
Paolo Liberatore
In Proceedings of the Seventh European Workshop
on Logics in Artificial Intelligence (JELIA 2000), pages 361-375, 2000.
HTTP download
HTTP download
-
Merging locally correct knowledge bases: A preliminary report
-
Paolo Liberatore
Technical Report cs.AI/0212053, Computing
Research Repository (CoRR), 2002.
HTTP
download
-
Revision by history
-
Paolo Liberatore
Journal of Artificial Intelligence Research,
52:287-329, 2015.
Complexity of Belief Revision
-
The complexity of model checking for belief revision and update
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the
Thirteenth National Conference on Artificial Intelligence (AAAI'96), pages
556-561. AAAI Press/The MIT Press, 1996.
FTP download
HTTP download
-
The complexity of iterated belief revision
-
Paolo Liberatore
In Proceedings of the Sixth International
Conference on Database Theory (ICDT'97), pages 276-290, 1997.
FTP download
HTTP download
-
The complexity of belief update
-
Paolo Liberatore
In Proceedings of the Fifteenth International Joint
Conference
on Artificial Intelligence (IJCAI'97), pages 68-73, 1997.
FTP download
HTTP download
-
Belief revision and update: Complexity of model checking
-
Paolo Liberatore and Marco Schaerf
Journal of Computer and
System Sciences, 62(1):43-72, 2001.
HTTP download
-
The complexity of belief update
-
Paolo Liberatore
Artificial Intelligence, 119(1-2):141-190,
2000.
Compact Representations and Belief Revision
-
The size of a revised knowledge base
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
In Proceedings of the Fourteenth ACM SIGACT
SIGMOD SIGART Symposium on Principles of Database Systems
(PODS'95), pages 151-162. ACM Press and Addison Wesley, 1995.
FTP download
HTTP download
-
Compact representations of revision of Horn clauses
-
Paolo Liberatore
In Proceedings of the Eighth Australian Joint
Artificial Intelligence Conference (AI'95), pages 347-354, 1995.
FTP download
HTTP download
-
The size of a revised knowledge base
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
Artificial Intelligence, 115(1):25-64, 1999.
HTTP download
-
Compilability and compact representations of revision of Horn
knowledge bases
-
Paolo Liberatore
ACM Transactions on Computational Logic,
1(1):131-161, 2000.
HTTP download
-
The compactness of belief revision and update operators
-
Paolo Liberatore and Marco Schaerf
Fundamenta Informaticae,
62(3-4):377-393, 2004.
Non-Monotonic Reasoning
-
Relating belief revision and circumscription
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the
Fourteenth International Joint Conference on Artificial Intelligence
(IJCAI'95), pages 1557-1563. Morgan Kaufmann, Los Altos, 1995.
FTP download
HTTP download
-
Reducing belief revision to circumscription (and vice versa)
-
Paolo Liberatore and Marco Schaerf
Artificial Intelligence,
93(1-2):261-296, 1997.
HTTP download
-
The complexity of model checking for propositional default logics
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the
Thirteenth European Conference on Artificial Intelligence (ECAI'98), pages
18-22. John Wiley Press, 1998.
FTP download
HTTP download
-
Uncontroversial default logic
-
Paolo Liberatore
In Proceedings of the Fifteenth European
Conference on Artificial Intelligence (ECAI 2002), pages 526-530, 2002.
HTTP download
-
Uncontroversial default logic
-
Paolo Liberatore
Journal of Logic and Computation,
14(5):747-765, 2004.
-
Seminormalizing a default theory
-
Paolo Liberatore
Journal of Applied Non-Classical Logics,
15(3):321-340, 2005.
-
Representability in default logic
-
Paolo Liberatore
Journal of the Interest Group in Pure and Applied
Logic, 13(3):335-351, 2005.
HTTP download
-
The complexity of model checking for propositional default logics
-
Paolo Liberatore and Marco Schaerf
Data and Knowledge
Engineering, 55(2):189-202, 2005.
-
Complexity of the unique extension problem in default logic
-
Xishun Zhao and Paolo Liberatore
Fundamenta Informaticae,
53(1):79-104, 2002.
HTTP download
-
On the complexity of extension checking in default logic
-
Paolo Liberatore
Information Processing Letters, 98(2):61-65,
2006.
-
Consistency defaults
-
Paolo Liberatore
Studia Logica, 86(1):89-110, 2007.
-
Bijective faithful translations among default logics
-
Paolo Liberatore
Journal of Logic and Computation,
24(4):763-807, 2014.
Abduction and Diagnosis
-
Complexity and compilability of diagnosis in system graphs
-
Paolo Liberatore
In DX-96 Workshop on Theory of Diagnosis,
1996.
-
Compilability of abduction
-
Paolo Liberatore and Marco Schaerf
In Proceedings of the
Seventeenth National Conference on Artificial Intelligence (AAAI 2000),
2000.
FTP download
HTTP download
-
Verification programs for abduction
-
Francesco M. Donini and Paolo Liberatore
In Proceedings of the
Fourteenth European Conference on Artificial Intelligence (ECAI 2000),
pages 166-170, 2000.
FTP download
HTTP download
-
Compilability of propositional abduction
-
Paolo Liberatore and Marco Schaerf
ACM Transactions on
Computational Logic, 8(1):2, 2007.
HTTP download
-
On the complexity of second-best abductive explanations
-
Paolo Liberatore and Marco Schaerf
International Journal of
Approximate Reasoning, 63:22-31, 2015.
Reasoning about Actions and Planning
-
The complexity of the language A
-
Paolo Liberatore
Electronic Transactions on Artificial Intelligence,
1(1-3):13-38, 1997. Available at
http://www.ep.liu.se/ej/etai/1997/002/.
HTTP
download
-
On non-conservative plan modification
-
Paolo Liberatore
In Proceedings of the Thirteenth European
Conference on Artificial Intelligence (ECAI'98), pages 518-519, 1998.
FTP download
HTTP download
-
The size of MDP factored policies
-
Paolo Liberatore
In Proceedings of the Eighteenth National
Conference on Artificial Intelligence (AAAI 2002), pages 267-272, 2002.
-
On polynomial sized MDP succinct policies
-
Paolo Liberatore
Journal of Artificial Intelligence Research,
21:551-577, 2004.
HTTP
download
-
On the complexity of case-based planning
-
Paolo Liberatore
Journal of Experimental and Theoretical Computer
Science, 17(3):283-295, 2005.
Satisfiability
-
Algorithms and experiments on finding minimal models
-
Paolo Liberatore
Technical Report 09-99, Dipartimento di
Informatica e Sistemistica, Università di Roma ''La
Sapienza'', 1999.
FTP download
HTTP download
-
On the complexity of finding satisfiable subinstances in
constraint satisfaction
-
Peter Jonsson and Paolo Liberatore
Technical Report
TR99-038, Electronic Colloquium on Computational Complexity,
1999.
FTP download
-
On the complexity of choosing the branching literal in DPLL
-
Paolo Liberatore
Artificial Intelligence, 116(1-2):315-326,
2000.
HTTP download
-
Solving QBF with SMV
-
Francesco M. Donini,
Paolo Liberatore,
Fabio Massacci,
and Marco Schaerf
In Proceedings of the Eighth International
Conference on Principles of Knowledge Representation and Reasoning
(KR 2002), pages 578-589, 2002.
HTTP download
-
Complexity results on DPLL and resolution
-
Paolo Liberatore
ACM Transactions on Computational Logic,
7(1):84-107, 2006.
HTTP download
Propositional Logic
-
The complexity of checking redundancy of CNF propositional
formulae
-
Paolo Liberatore
In Proceedings of the Fifteenth European
Conference on Artificial Intelligence (ECAI 2002), pages 262-266, 2002.
HTTP download
-
Conditional independence in propositional logic
-
Jérôme Lang,
Paolo Liberatore,
and Pierre Marquis
Artificial Intelligence, 141(1-2):79-121,
2002.
HTTP download
-
k-approximating circuits
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
Technical Report TR02-067, Electronic
Colloquium on Computational Complexity, 2002.
FTP download
-
Propositional independence - formula-variable independence and
forgetting
-
Jérôme Lang,
Paolo Liberatore,
and Pierre Marquis
Journal of Artificial Intelligence Research,
18:391-443, 2003.
HTTP
download
-
Redundancy in logic I: CNF propositional formulae
-
Paolo Liberatore
Artificial Intelligence, 163(2):203-232, 2005.
-
Redundancy in logic II: 2CNF and Horn propositional formulae
-
Paolo Liberatore
Artificial Intelligence, 172(2-3):265-299,
2008.
-
Redundancy in logic III: Non-mononotonic reasoning
-
Paolo Liberatore
Artificial Intelligence, 172(11):1317-1359,
2008.
Preprocessing and Compact Representations
-
Feasibility and unfeasibility of off-line processing
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
In Proceedings of the Fourth Israeli Symposium
on Theory of Computing and Systems (ISTCS'96), pages 100-109. IEEE
Computer Society, 1996.
FTP download
HTTP download
-
Comparing space efficiency of propositional knowledge
representation formalisms
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
In Proceedings of the Fifth International
Conference on the Principles of Knowledge Representation and Reasoning
(KR'96), pages 364-373. Morgan Kaufmann, Los Altos, 1996.
FTP download
HTTP download
-
On the compilability of diagnosis, planning, reasoning about
actions, belief revision, etc.
-
Paolo Liberatore
In Proceedings of the Sixth International
Conference on Principles of Knowledge Representation and Reasoning
(KR'98), pages 144-155, 1998.
FTP download
HTTP download
-
Compilation of intractable problems and its application to
artificial intelligence
-
Paolo Liberatore
PhD thesis, Dipartimento di Informatica e
Sistemistica, Università di Roma ''La Sapienza'', 1998.
FTP download
HTTP download
-
Space efficiency of propositional knowledge representation
formalisms
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
Journal of Artificial Intelligence Research,
13:1-31, 2000.
HTTP download
-
Preprocessing of intractable problems
-
Marco Cadoli,
Francesco M. Donini,
Paolo Liberatore,
and Marco Schaerf
Information and Computation,
176(2):89-120, 2002.
FTP download
HTTP download
-
Monotonic reductions, representative equivalence, and compilation
of intractable problems
-
Paolo Liberatore
Journal of the ACM, 48(6):1091-1125, 2001.
HTTP download
-
Redundancy in logic I: CNF propositional formulae
-
Paolo Liberatore
Artificial Intelligence, 163(2):203-232, 2005.
-
The size of BDDs and other data structures in temporal logics
modelchecking
-
Andrea Ferrara,
Paolo Liberatore,
and Marco Schaerf
IEEE Transactions on Computers,
65:3148-3156, 2016.
Teaching
-
Complementi ed esercizi di programmazione in PASCAL
-
Diego Calvanese,
Paolo Liberatore,
Fabio Massacci,
and Riccardo Rosati
Progetto Leonardo. Esculapio Editore,
Bologna, 1 edition, 1998. In Italian. Programs available on the
web at http://www.dis.uniroma1.it/%7epascal.
Last update: Tuesday, 06-Jun-2023 15:02:16 CEST