7 citations found. Retrieving documents...
R.A. Kowalski. The treatment of negation in logic programs for representing legislation. In Proceedings of the Second International Conference on Arti cial Intelligence and Law, pages 11-15, New York, 1989. ACM Press.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Role of Logic in Computational Models of Legal Argument - .. - Prakken, Sartor (2001)   (3 citations)  (Correct)

.... The best known application is the formalisation of the British Nationality Act [ Sergot et al. 1986 ] but see also [ Bench Capon et al. 1987 ] For present purposes the main relevance of the work of Sergot et al. is its treatment of exceptions by using negation by failure (further explored by Kowalski, 1989, 1995) To our knowledge, this was the rst logical treatment of exceptions in a legal context. In this approach, which implements the explicit exceptions approach of Section 2.2, negation by failure is considered to be an appropriate translation for such locutions as unless the contrary is ....

R.A. Kowalski. The treatment of negation in logic programs for representing legislation. In Proceedings of the Second International Conference on Arti cial Intelligence and Law, pages 11-15, New York, 1989. ACM Press.


A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio, Pereira (1995)   (27 citations)  (Correct)

....to rules [35] The first statement above can be seen as an exception to the general rule that normally birds fly. In this case we really want to establish the connection between flying and not flying. Exceptions expressed by sentences with negative conclusions are also common in legislation [34, 36]. For example, consider the provisions for depriving British citizens of their citizenship: 40 (1) Subject to the provisions of this section, the Secretary of State may by order deprive any British citizen to whom this subsection applies of his British citizenship if [ 5) The Secretary ....

R. Kowalski. The treatment of negation in logic programs for representing legislation. In 2nd Int. Conf. on AI and Law, pages 11--15, 1989.


Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz (1991)   (315 citations)  (Correct)

....to the answer set. If the available employment information is complete for Stanford, but not for SRI, a more restricted rule should be used instead: Employed(x; Stanford) not; Employed(x; Stanford) The following example of the use of negation in the 1981 British Nationality Act is quoted in [Kowalski1989] After commencement no person shall have the status of a Commonwealth citizen or the status of a British subject otherwise than under this Act. This statement, in essense, postulates the closed world assumption for some predicates. Kowalski remarks that there is no need to represent statements ....

....between strong and weak negation in [Wagner1989] 2. Notice for comparison that when Poole and Goebel [poo86] add classical negation to Prolog, they immediately get full first order logic and full resolution. This is because they interpret as classical implication. 3. According to [Kowalski1989] and [Kowalski and Sadri1990] many provisions in legislation have a negative form ( A declaration: shall not be registered unless: In a preliminary version of [Kowalski and Sadri1990] such statements were treated as integrity constraints with one of the conditions identified as ....

Robert Kowalski. The treatment of negation in logic programs for representing legislation. In Proc. of the Second Int'l Conf. on Artificial Intelligence and Law, pages 11--15, 1989.


Prolegomena to Logic Programming for Non-Monotonic.. - Jürgen Dix.. (1997)   (3 citations)  (Correct)

....to rules [Kow90] The first statement above can be seen as an exception to the general rule that normally birds fly. In this case we really want to establish the connection between flying and not flying. Exceptions expressed by sentences with negative conclusions are also common in legislation [Kow89,Kow92]. For example, consider the provisions for depriving British citizens of their citizenship: 40 (1) Subject to the provisions of this section, the Secretary of State may by order deprive any British citizen to whom this subsection applies of his British citizenship if [ 5) The Secretary ....

R. Kowalski. The treatment of negation in logic programs for representing legislation. In 2nd Int. Conf. on AI and Law, pages 11--15, 1989.


A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio.. (1995)   (27 citations)  (Correct)

....to rules [38] The first statement above can be seen as an exception to the general rule that normally birds fly. In this case we really want to establish the connection between flying and not flying. Exceptions expressed by sentences with negative conclusions are also common in legislation [37, 39]. For example, consider the provisions for depriving British citizens of their citizenship: 40 (1) Subject to the provisions of this section, the Secretary of State may by order deprive any British citizen to whom this subsection applies of his British citizenship if [ 5) The Secretary ....

R. Kowalski. The treatment of negation in logic programs for representing legislation. In 2nd Int. Conf. on AI and Law, pages 11--15, 1989.


Ontologies in Legal Information Systems; The Need for.. - Bench-Capon, Visser   (Correct)

....This has the consequence that while the reading of a definite clause suggests that a sufficient condition for its head is provided, the set of clauses for a given head taken together must be interpreted as supplying a necessary condition for the truth of that head. Attempts have been made (e.g. Kowalski, 1989) to enable discrimination between the case where this is desirable and where it is not, but in the British Nationality Act program, the onlyif parts were taken as supplied. The above suggests that legal knowledge is conceived within this approach as being a set of definitions, and that the ....

Kowalski, R.A., (1989) The Treatment of Negation in Logic Programs for Representing Legislation, Proceedings of the Second International Conference on AI and Law, ACM Press, New York, USA.


Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz (1991)   (315 citations)  (Correct)

....to the answer set. If the available employment information is complete for Stanford, but not for SRI, a more restricted rule should be used instead: Employed(x; Stanford) not; Employed(x; Stanford) The following example of the use of negation in the 1981 British Nationality Act is quoted in [ Kowalski, 1989 ] After commencement no person shall have the status of a Commonwealth citizen or the status of a British subject otherwise than under this Act. This statement, in essense, postulates the closed world assumption for some predicates. Kowalski remarks that there is no need to represent ....

....between strong and weak negation in [ Wagner, 1989 ] 2. Notice for comparison that when Poole and Goebel [1986] add classical negation to Prolog, they immediately get full first order logic and full resolution. This is because they interpret as classical implication. 3. According to [ Kowalski, 1989 ] and [ Kowalski and Sadri, 1990 ] many provisions in legislation have a negative form ( A declaration: shall not be registered unless: In a preliminary version of [ Kowalski and Sadri, 1990 ] such statements were treated as integrity constraints with one of the conditions ....

Robert Kowalski. The treatment of negation in logic programs for representing legislation. In Proc. of the Second Int'l Conf. on Artificial Intelligence and Law, pages 11--15, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC