01: /******************************************************************
02: * File: AssertDisjointPairs.java
03: * Created by: Dave Reynolds
04: * Created on: 15-Apr-03
05: *
06: * (c) Copyright 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP
07: * [See end of file]
08: * $Id: AssertDisjointPairs.java,v 1.12 2008/01/02 12:06:21 andy_seaborne Exp $
09: *****************************************************************/package com.hp.hpl.jena.reasoner.rulesys.builtins;
10:
11: import com.hp.hpl.jena.reasoner.rulesys.*;
12: import com.hp.hpl.jena.vocabulary.OWL;
13: import com.hp.hpl.jena.graph.*;
14: import java.util.*;
15:
16: /**
17: * Assert the n^2 differtFrom pairs from a distinctMembers list
18: *
19: * @author <a href="mailto:der@hplb.hpl.hp.com">Dave Reynolds</a>
20: * @version $Revision: 1.12 $ on $Date: 2008/01/02 12:06:21 $
21: */
22: public class AssertDisjointPairs extends BaseBuiltin {
23:
24: /**
25: * Return a name for this builtin, normally this will be the name of the
26: * functor that will be used to invoke it.
27: */
28: public String getName() {
29: return "assertDisjointPairs";
30: }
31:
32: /**
33: * Return the expected number of arguments for this functor or 0 if the number is flexible.
34: */
35: public int getArgLength() {
36: return 1;
37: }
38:
39: /**
40: * This method is invoked when the builtin is called in a rule head.
41: * Such a use is only valid in a forward rule.
42: * @param args the array of argument values for the builtin, this is an array
43: * of Nodes.
44: * @param length the length of the argument list, may be less than the length of the args array
45: * for some rule engines
46: * @param context an execution context giving access to other relevant data
47: */
48: public void headAction(Node[] args, int length, RuleContext context) {
49: checkArgs(length, context);
50: List l = Util.convertList(args[0], context);
51: for (Iterator i = l.iterator(); i.hasNext();) {
52: Node x = (Node) i.next();
53: for (Iterator j = l.iterator(); j.hasNext();) {
54: Node y = (Node) j.next();
55: if (!x.sameValueAs(y)) {
56: context.add(new Triple(x, OWL.differentFrom
57: .asNode(), y));
58: }
59: }
60: }
61: }
62:
63: }
64:
65: /*
66: (c) Copyright 2003, 2004, 2005, 2006, 2007, 2008 Hewlett-Packard Development Company, LP
67: All rights reserved.
68:
69: Redistribution and use in source and binary forms, with or without
70: modification, are permitted provided that the following conditions
71: are met:
72:
73: 1. Redistributions of source code must retain the above copyright
74: notice, this list of conditions and the following disclaimer.
75:
76: 2. Redistributions in binary form must reproduce the above copyright
77: notice, this list of conditions and the following disclaimer in the
78: documentation and/or other materials provided with the distribution.
79:
80: 3. The name of the author may not be used to endorse or promote products
81: derived from this software without specific prior written permission.
82:
83: THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
84: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
85: OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
86: IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
87: INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
88: NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
89: DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
90: THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
91: (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
92: THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
93: */
|