Foundations of logic programming
Foundations of logic programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
An algebra for composing access control policies
ACM Transactions on Information and System Security (TISSEC)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
A Temporal Access Control Mechanism for Database Systems
IEEE Transactions on Knowledge and Data Engineering
Resolution for Skeptical Stable Semantics
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A Terminological Interpretation of (Abductive) Logic Programming
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A Logical Language for Expressing Authorizations
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
| Hi-index | 0.00 |
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.