Abstract
This paper motivates and introduces entailment problems over nonmonotonic theories some of whose predicates—called open predicates— are not (completely) specified. More precisely, we are interested in those inferences that hold for some or all possible axiomatizations of the open predicates. Since a complete specification of an open predicate may model incomplete knowledge about the world, this kind of inference should distinguish missing object-level knowledge from missing parts of the specification, and restrict nonmonotonic inference accordingly. We formalize some interesting forms of such open entailment problems, and provide formal proof techniques for some of them in a logic programming framework.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Amati, L. Carlucci Aiello, D. Gabbay, and F. Pirri. A proof theoretical approach to default reasoning I: tableaux for default logic. J. Logic and Comput. 6, 2, 205–231. 158
E. Bertino, C. Bettini, E. Ferrari and P. Samarati. A temporal access control mechanism for database systems. IEEE Trans. on Knowledge and Data Engineering, 8(1):67–80, 1996. 147
P. A. Bonatti. Resolution for skeptical stable semantics. Journal of Automated Reasoning. To appear. Preliminary version in Proc. of LPNMR’97, LNAI 1265, Springer Verlag, 1997. 148, 150, 154
P. A. Bonatti, S. De Capitani Di Vimercate, P. Samarati. An algebra for composing access control policies. ACM Transactions on Information and System Security, 5(1), 2002, to appear. Preliminary version in Proc. of the 7th ACM Conference on Computer and Communication Security, CCS’2000, Atene, 2000. 147, 153, 154, 155
P. A. Bonatti, N. Olivetti. Sequent calculi for propositional nonmonotonic logics. ACM Transactions on Computational Logic, to appear. Electronic version available at http://www.acm.org/tocl/accepted.html 158
A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. Contributions to the Semantics of Open Logic Programs. In Proc. of the International Conference on Fifth Generation Computer Systems 1992, 570–580, 1992. 148, 158
M. Denecker. A Terminological Interpretation of (Abductive) Logic Programming, Proc. of LPNMR95, Springer, 1995. 158
M. Gelfond, V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pp.1070–1080, MIT Press, 1988. 148
M. Gelfond, H. Przymusinska, “Reasoning in Open Domains”, In Logic Programming and Nonmonotonic Reasoning, 397–413, MIT press, 1993. 158
J. Lloyd. Foundations of logic programming. Springer-Verlag, 1984. 148, 150
R. Rosati. Towards first-order nonmonotonic reasoning. In Proc. of LPNMR‘99, LNAI 1730, 332–346, Springer Verlag, Berlin, 1999. 158
P. Samarati S. Jajodia and V. S. Subrahmanian. A logical language for expressing authorizations. In Proc. IEEE Symp. on Security and Privacy, pages 94–107, Oakland, CA, 1997. 147
V. S. Subrahmanian, P. A. Bonatti, J. Dix, T. Eiter, S. Kraus, F. Ozcan, R. Ross. Heterogeneous Active Agents. MIT Press, 2000. 147
T. Y. C. Woo and S. S. Lam. Authorizations in distributed systems: A new approach. Journal of Computer Security, 2(2,3), 1993. 147
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonatti, 1.A. (2001). Reasoning with Open Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive