What does Software Engineering Practice offer to Semantic Web Service Composition? (2009)
Bruce Spencer and Sandy Liu are the leader and a researcher in the Internet Logic group, which specializes in reasoning systems for Internet applications. The group’s activities on the Semantic Web...
New Brunswick. His interests involve the application of artificial intelligence and economics research to e-commerce related topics such as e-procurement, auctions, privacy and automated negotiation....
Negotiating Exchanges of Private Information for Web Service Eligibility (2008)
Abstract. Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future partners....
Abstract. We introduce the inference queue as a mechanism for communicating and transforming data in Web services choreography. The insert operation provides definite clauses to the inference queue,...
. A given binary resolution proof, represented as a binary tree, is said to be minimal if the resolutions cannot be reordered to generate an irregular proof. Minimality extends Tseitin's...
. A given binary resolution proof, represented as a binary tree, is said to be minimal if the resolutions cannot be reordered to generate an irregular proof. Minimality extends Tseitin's...
Support Ordered Resolution (2007)
Abstract. In a binary tree representation of a binary resolution proof, rotating some tree edge reorders two adjacent resolution steps. When rotation is not permitted to disturb factoring, and thus...
Using ACTs in Disjunctive Deductive Databases (2007)
Charlie F. Obimbo, Bruce Spencer
This paper describes research efforts to develop efficient implementation techniques for disjunctive deductive databases. The aim is to build a database engine that produces perfect model semantics...
MONOLOGUE: A Tool for Negotiating Exchanges (2005)
Of Private Information, Scott Buffett, Luc Comeau, Michael W. Fleming, Bruce Spencer
The MONOLOGUE system (Multi-Object Negotiator for On-Line Offers Guided by Utility Elicitation) for privacy negotiation is described. It integrates a number of innovative components. Negotiations are...
The OO jDREW Reference Implementation of RuleML (2005)
Council Canada, Marcel Ball, Harold Boley, David Hirtle, Jing Mei, Bruce Spencer
de l'information
Object-Oriented RuleML for RDF: Facts, Queries, and Inferences (2004)
Harold Boley, Bruce Spencer, Steve Ross-talbot, Mike Dean, Gerd Wagner
1
Negotiating exchanges of P3P-labeled information for compensation (2004)
Scott Buffett, Keping Jia, Y Liu, Bruce Spencer, Fang Wang
Abstract. We consider private information a commodity, of value to both the information holder and the information seeker. Hence, a customer can be enticed to trade his/her private information with a...
Inferring data transformation rules to integrate semantic web services (2004)
Abstract. OWL-S allows selecting, composing and invoking Web Services descriptions, invocation uses low level grounding ones, while composition needs to consider both high and low level descriptions....
Determining internet users’ values for private information (2004)
Scott Buffett, Nathan Scott, Bruce Spencer
Abstract — We examine the problem of determining a user’s value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website personalization...
Determining Internet Users ’ Values for Private (2004)
Council Canada, Scott Buffett, Nathan Scott, Bruce Spencer
de l'information
Realizing Weak Workflow with Declarative Flexible XML Routing in SOAP (2004)
Council Canada, Connie Adsett, Ansgar Bernardi, Y Liu, Bruce Spencer
de l'information
Labor Studies Journal - Volume 28, Number 3, Fall 2003
Object-Oriented RuleML for RDF: Facts, Queries, and Inferences (2003)
Harold Boley, Bruce Spencer, Steve Ross-talbot
� Increased mutual RuleML-RDF(S) integration: A. RDF(S) needs rules for query, inference, transformation B. RuleML rules need alternative syntactic encodings in RDF and OWL
Negotiating Exchanges of Private Information for Web (2003)
Council Canada, Keping Jia, Bruce Spencer
de l'information
Sufficiency, Minimal Sufficiency, and the Lack Thereof. (2002)
This paper presents at an elementary level a unified presentation of concepts related to sufficiency and minimal sufficiency. Extensively discussed are techniques for showing in a particular...
Agent design considerations within distributed information retrieval systems (2001)
Jonathan Carter, Ali Ghorbani, Bruce Spencer
Abstract. This paper presents the design and implementation of an agent society within the confines of IBM's Aglet advanced programming interface specification. The society exists with the sole...
Learning about labour in Canada (1999)
Gereluk, Winston, Briton, Derek, Spencer, Bruce
In this study, the questions of what and how working people learn about labor organization and activity in Canada were explored through a review of available literature and face-to-face interviews...
Learning about labour in Canada (1999)
Gereluk, Winston, Briton, Derek, Spencer, Bruce
In this study, the questions of what and how working people learn about labor organization and activity in Canada were explored through a review of available literature and face-to-face interviews...
Merge Path Improvements for Minimal Model Hyper Tableaux (1999)
Peter Baumgartner, J.D. Horton, Bruce Spencer
. We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper...
Merge Path Improvements for Minimal Model Hyper Tableaux (1999)
Peter Baumgartner, Peter Baumgartner, J.D. Horton, J. D. Horton, Bruce Spencer, Bruce Spencer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper...
Merge path improvements for minimal model hyper tableaux (1999)
Peter Baumgartner, Peter Baumgartner, J. D. Horton, J. D. Horton, Bruce Spencer, Bruce Spencer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper...
Merge path improvements for minimal model hyper tableaux (1999)
Peter Baumgartner, J. D. Horton, Bruce Spencer
Abstract. We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the...
Rank/activity: a canonical form for binary resolution (1998)
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence classes capture all...
Rank/activity: a canonical form for binary resolution (1998)
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence classes capture all...
Clause trees: a tool for understanding and implementing resolution in automated reasoning (1997)
A new methodology/data structure, the clause tree, is developed for automated reasoning based on resolution in first order logic. A clause tree T on a set S of clauses is a 4-tuple, where N is a set...
Extending the regular restriction of resolution to non-linear subdeductions (1997)
A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which...
Extending the Regular Restriction of Resolution to Non-Linear Subdeductions (1997)
A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which...
Clause trees: a tool for understanding and implementing resolution in automated reasoning (1997)
A new methodology/data structure, the clause tree, is developed for automated reasoning based on resolution in first order logic. A clause tree T on a set S of clauses is a 4-tuple <N,E,L,M>,...
A Top Down Algorithm to Find Only Minimal Clause Trees (1995)
Horton And, J. D. Horton, Bruce Spencer
> ? where v i 2 N and e j 2 E is a merge path if L(e 1 )L(v 0 ) = L(en )L(vn ): Path ! v 0 : : : vn ? precedes (OE) path ! w 0 : : : wm ? if for some i = 1 : : : m \Gamma 1; v n = w i . (f) M is...
Avoiding duplicate proofs with the foothold refinement (1994)
Wos has identified the problem of recomputing redundant information in the general setting of automated reasoning. We consider this problem in the setting of logic programming where we are given a...
Assimilation in plan recognition via truth maintenance with reduced redundancy--[microform]. (1992)
University Microfilms order no. UMI00295409.
The role of hydrogen bonding in polyurethane and polyamide polymers /--by Bruce Spencer. (1978)
Thesis (M.S.)--Wisconsin.
Clause Trees: a Tool for Understanding and Implementing Resolution in Automated Reasoning
A new methodology/data structure, the clause tree, is developed for automated reasoning based on resolution in first order logic. A clause tree T on a set S of clauses is a 4-tuple <N,E,L,M>,...