Integrity constraints in logic databases
Journal of Logic Programming
The British Nationality Act as a logic program
Communications of the ACM
Integrity constraint checking in stratified databases
Journal of Logic Programming
Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Hierarchically organised formalisations
ICAIL '89 Proceedings of the 2nd international conference on Artificial intelligence and law
ICAIL '91 Proceedings of the 3rd international conference on Artificial intelligence and law
On the role of prototypes in appellate legal argument (abstract)
ICAIL '91 Proceedings of the 3rd international conference on Artificial intelligence and law
Proceedings of the 6th international conference on Artificial intelligence and law
The Role of Logic in Computational Models of Legal Argument: A Critical Survey
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Logic programming in artificial intelligence
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.01 |
Logic programs represent knowledge in the form of implications A if B1 and … Bn, n ≥ 0 where the conclusion A is an atomic formula and each condition Bi is either an atomic formula or the negation of an atomic formula. Any variables are assumed to be universally quantified, with a scope which is the entire sentence. A negated condition “not Ai” is deemed to hold if the corresponding positive condition Ai can be shown to fail to hold. This interpretation of negative conditions is called negation by failure (NBF) [Cl 78]. It has the characteristic that only the positive “if-half” of a definition needs to be given explicity. The negative “only-if” half is given implicitly by NBF.The obvious problem with NBF is that it supplies the only-if halves of implications, whether or not they are intended. I shall discuss a possible solution to this problem in the context of discussing the more general problem of representing negative conclusions. I shall focus on examples taken from our formalisation of the 1981 British Nationality Act (BNA) [SSKKHC 86]. I shall argue that many negative sentences can be regarded as integrity constraints and consequently can be eliminated by transformations such as those developed by Asirelli et al [ASM 85] and Kowalski and Sadri [KS 88]. Among such sentences are ones expressing prohibitions. The interpretation of prohibitions as integrity constraints suggests a possible approach to the treatment of deontic modalities.