Code, Nr | Citation |
---|---|
1 | NIL |
2 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-doni-scha-95-b.ps.gz M. Cadoli, F. M. Donini, M. Schaerf , " Is Intractability of Nonmonotonic Reasoning a Real Drawback ? ", Artificial Intelligence Journal , Vol. 88 (1-2), 1996, 215-251. |
3 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-etal-95-b.ps.gz M. Cadoli, F. M. Donini, M. Schaerf , R. Silvestri, "On Compact Representations of Propositional Circumscription", to appear in Theoretical Computer Science . Download the Tech Rep. |
4 | NIL P. Liberatore, M. Schaerf , "Arbitration: (or how to merge knowledge bases)", to appear in IEEE Transactions on Knowledge and Data Engineering |
5 | ftp://www.dis.uniroma1.it/PUB/AI/papers/scha-cado-93.ps.gz M. Schaerf , M. Cadoli, " Tractable Reasoning via Approximation ", Artificial Intelligence Journal , Vol. 74, 1995, 249-310. |
6 | ftp://www.dis.uniroma1.it/PUB/AI/papers/scha-94.ps.gz M. Schaerf , " Negation and Minimality in Disjunctive Databases ", Journal of Logic Programming , Vol. 23 (1), 1995, 63-83. |
7 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-scha-94-b.ps.gz M. Cadoli, M. Schaerf , " Approximate Inference in Default Logic and Circumscription ", Fundamenta Informaticae , Vol. 23, 1995, 123-143. |
8 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-scha-94.ps.gz M. Cadoli, M. Schaerf , " The Complexity of Entailment in Propositional Multivalued Logics , Annals of Mathematics and Artificial Intelligence , Vol. 18 (1), 1996, 29-50. |
9 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-scha-93-b.ps.gz M. Cadoli, M. Schaerf , " A Survey on Complexity Results for Non-monotonic Logics , Journal of Logic Programming , Vol. 17, 1993, 127-160. Conference Proceedings and Paper Collections |
10 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-etal-96-b.ps.gz M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , " Comparing Space Efficiency of Propositional Knowledge Representation Formalisms ", Proc. of KR-96. |
11 | ftp://www.dis.uniroma1.it/PUB/AI/papers/libe-scha-96.ps.gz P. Liberatore, M. Schaerf , " The Complexity of Model Checking for Belief Revision and Update ", Proc. of AAAI-96.
|
12 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-etal-96.ps.gz M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , " Feasibility and Unfeasibility of Off-line Processing ", Proc. of ISTCS-96.
|
13 | ftp://www.dis.uniroma1.it/PUB/AI/papers/libe-scha-95-a.ps.gz P. Liberatore, M. Schaerf , " Relating Belief Revision and Circumscription " Proc. of IJCAI-95. |
14 | ftp://www.dis.uniroma1.it/PUB/AI/papers/libe-scha-95-b.ps.gz P. Liberatore, M. Schaerf , " Arbitration: A Commutative Operator for Belief Revision " Proc. of WOCFAI-95. |
15 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-etal-95.ps.gz M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , " The Size of a Revised Knowledge Base ", Proc. of PODS-95. |
16 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-doni-scha-95.ps.gz M. Cadoli, F. M. Donini, M. Schaerf , " On Compact Representations of Propositional Circumscription ", Proc. of STACS-95. |
17 | NIL L. Carlucci Aiello, M. Cialdea, D. Nardi, and M. Schaerf , "Modal and Meta Languages: Consistency and Expressiveness", In "Meta-Logics and Logic Programming (K. Apt, F. Turini eds)", MIT Press. Pages 243-265, 1995. |
18 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-doni-scha-94.ps.gz M. Cadoli, F. M. Donini, M. Schaerf , " Is Intractability of Nonmonotonic Reasoning a Real Drawback ? ", Proc. of AAAI-94. |
19 | ftp://www.dis.uniroma1.it/PUB/AI/papers/scha-93-b.ps.gz M. Schaerf , " Logic Programming and Autoepistemic Logics: New Relations and Complexity Results ",AI*IA-93. Technical Reports and Working Papers |
20 | ftp://www.dis.uniroma1.it/PUB/AI/papers/cado-etal-96-c.dvi.gz M. Cadoli, F. M. Donini, P. Liberatore, M. Schaerf , " The Size of a Revised Knowledge Base ", Tech Report 34-96, November 1996. Extended version of PODS-95. |