D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, pages 39--45, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....at supporting efficient reasoning, and in our work we follow that philosophy. Defeasible reasoning has recently attracted considerable interest. Its use in various application domains has been advocated, including the modelling of regulations and business rules [19, 12, 1] modelling of contracts [22], legal reasoning [21] and agent negotiations [10] In fact, defeasible reasoning (in the form of courteous logic programs [11] provides a foundation for IBM s Business Rules Markup Language and for current W3C activities on rules. Therefore defeasible reasoning is arguably the most successful ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

....for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way. 1 Introduction Defeasible logic is a practical nonmonotonic logic. This logic, and similar logics, have been proposed as the appropriate language for executable regulations [3] contracts [22], and business rules [13] Unlike other nonmonotonic approaches, defeasible logic was designed to be easily implementable. In fact, recently very powerful implementations of defeasible logic became available, capable of handling 100,000s of defeasible rules [4] Moreover, in [2] we have shown how ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

....occur, the inconsistent literals may be used individually or even together in further inferences, but no form of ex falso quodlibet reasoning is possible. DL, and similar logics, have been proposed as the appropriate language for executable regulations [4] negotiations [10] contracts [26], and business rules [14] The logics are considered to have satisfactory expressiveness and the efficiency of the implementations supports real time response in applications such as electronic commerce [14, 11] Indeed, propositional DL has been shown to have linear time complexity [19] On the ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proc. AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, AAAI Press / MIT Press, 1999.

....Lausanne, Switzerland, 17 20 September, 2002. The work reported in this paper has been funded in part by the Cooperative Research Centre for Enterprise Distributed Systems Technology (DSTC) through the Australian Federal Government s CRC Programme (Department of Industry, Science Resources) [16, 15, 1, 13, 9, 18, 4]) In general terms, e contracting covers a variety of services such as brokering to identify and match prospective business partners; negotiation between partners; lodging of signed electronic contract documents; contract performance monitoring; mediation, dispute resolution and other activities ....

D. Reeves et al. Towards a declarative language for negotiating executable contracts. In Proceedings of AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, 1999.

....since there are several features of defeasible logic that have not been addressed in the literature. 1 Introduction Defeasible logic (DL) is a practical non monotonic logic. This logic, and similar logics, have been proposed as the appropriate language for executable regulations [4] contracts [22], and business rules [13] There are several implementations of DL, each of which is capable of handling 100,000 s of rules [5] Although DL can be described informally in terms of arguments, the logic has been formalized in a proof theoretic setting in which arguments play no role. In this paper ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

....for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way. 1 Introduction Defeasible logic is a practical nonmonotonic logic. This logic, and similar logics, have been proposed as the appropriate language for executable regulations [3] contracts [22], and business rules [13] Unlike other nonmonotonic approaches, defeasible logic was designed to be easily implementable. In fact, recently very powerful implementations of defeasible logic became available, capable of handling 100,000s of defeasible rules [4] Moreover, in [2] we have shown how ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

....are therefore transmitted across the network; conversely, it is the constraint solver that is transmitted to the client s computer, to work with the constraints specified locally by the cus tomer. Finally, the Business Rule Markup Language is similar in concept to KRAFT s use of constraints [20]. The difference is that this work uses a rule based formal ism to specify business rules. Logic programming techniques are then used to reason with the rules. Our current research draws in part on work being done in the context of the Advanced Knowledge Technologies project (AKT) a ....

D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Artificial Intelligence for Electronic Uommerce: Papers from the AAAI-99 Workshop, Menlo Park, CA, 1999. AAAI Press.

....across the network; conversely, it is the constraint solver that is transmitted to the client s computer, to work with the constraints specified locally by the customer. Finally, ongoing work at IBM s T. J. Watson Research Center is similar in concept to KRAFT s use of small print constraints [23]. The difference is that this work uses a rule based formalism to specify contractual fine print in the form of business rules. Logic programming techniques are then used to reason with the rules. 7 Conclusion The KRAFT network architecture was originally conceived to tackle the problem of ....

D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Artificial Intelligence for Electronic Commerce: Papers from the AAAI-99 Workshop, Menlo Park, CA, 1999. AAAI Press.

....across the network; conversely, it is the constraint solver that is transmitted to the client s computer, to work with the constraints specified locally by the customer. Finally, ongoing work at IBM s T. J. Watson Research Center is similar in concept to KRAFT s use of small print constraints [11]. The difference is that this work uses a rule based formalism to specify contractual fine print in the form of business rules. Logic programming techniques are then used to reason with the rules. 5. CONCLUSION This paper has described the KRAFT agent based architecture for supporting virtual ....

D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Artificial Intelligence for Electronic Commerce: Papers from the AAAI-99 Workshop, Menlo Park, CA, 1999. AAAI Press.

....for the semantic web. Berners Lee s vision for these reasoning services is that they are built on top of the data schema representations. Early work in this direction included inference engines for large scale ontologies [4, 8] mechanisms for representing and reasoning with business rules [11], and mobile constraint languages and constraint solving frameworks [13, 7] In this paper, we present a Constraint Interchange Format (CIF) aimed specifically at business to business e commerce applications on the semantic web. The constraint language is well established, having been used ....

D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Artificial Intelligence for Electronic Commerce: Papers from the AAAL99 Workshop, Menlo Park, CA, 1999. AAAI Press.

....have led to growing interest in the development of complex trading models. An example of a two issue double auction is OptiMark [1] an electronic stock exchange developed for institutional tradersthe issues are price and quantity. Multidimensional auctions in which bidding involves many issues [2 4] as well as double auctions [5] that permit bidding by many buyers and sellers have been proposed. The presence of two and more issues begins to blur the difference between auctions and negotiations. This raises the possibility of using utility as a measure of offers and other mechanisms that ....

Reeves, D.M., et al., "Toward a Declarative Language for Negotiating Executable Contracts." 1999, IBM T.J. Watson Center: Yorktown Heights.

....execution, trust based reasoning, theory of evidence 1. INTRODUCTION A considerable volume of recent research and industrial application efforts has concentrated on the provision of automated support for the establishment and subsequent implementation of electronic contracts (cf. 7] 1] 6] [13], 11] amongst many others) In general terms, e contracting is viewed by many researchers as conducted within an electronic market place (a so called e market) which offers a variety of services, such as: brokering to identify and match prospective business partners; negotiation facilitation; ....

Reeves D. M. et al. Towards a declarative language for negotiating executable contracts. Proceedings of AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, 1999.

....al. 2000] This family of approaches has recently attracted considerable interest. Apart from implementability, its use in various application domains has been advocated, including the modelling of regulations and business rules [Grosof et al. 1999; Antoniou et al. 1999] modelling of contracts [Reeves et al. 1999], and the integration of information from various sources [Antoniou et al. 1999] There are five kinds of features in Defeasible Logic: facts, strict rules, defeasible rules, defeaters, and a superiority relation among rules. Essentially the superiority relation provides information about the ....

.... for Defeasible Logic 31 many of the standard examples used to motivate other nonmonotonic logics [Nute 1994] Moreover recent work in several application domains has demonstrated that defeasible reasoning shows great promise to be useful in practice [Grosof et al. 1999; Antoniou et al. 1999; Reeves et al. 1999]. This paper studied transformations of defeasible theories. The main results showed how facts, defeaters and the superiority relation can be simulated by the other ingredients of the logic. In doing so our focus was on transformations that satisfy modularity and incrementality conditions. The ....

Reeves, D.M., Grosof, B.N., Wellman, M.P., , and Chan, H.Y. 1999. Towards a declarative language for negotiating executable contracts. In Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99). AAAI Press / MIT Press.

....since there are several features of defeasible logic that have not been addressed in the literature. 1 Introduction Defeasible logic is a practical non monotonic logic. This logic, and similar logics, have been proposed as the appropriate language for executable regulations [3] contracts [20], and business rules [11] There are several implementations of defeasible logic, each of which is capable of handling 100,000 s of rules [4] Although defeasible logic can be described informally in terms of arguments, the logic has been formalized in a proof theoretic setting in which arguments ....

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

....a traditional database system is required. For example, fund managers could use reactive programs for balancing portfolios against rapidly changing stock prices [13] In business to business systems, rules and contracts could use forms of logic realized by having logical rules in the database (e.g. [25]) A traffic control system which manages lights could react to traffic information according to some mathematical model about flows. A e commerce system could use constraints in order to reason about combinations of products and about optimal pricing, etc. We present an abstract framework, in the ....

M. Reeves, Benjamin N. Grosof, Michael P. Wellman, and Hoi Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts. Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Technical Report, AAAI Press / MIT Press, Menlo Park. See also http://www.research.ibm.com/rules.

No context found.

Reeves,D.M.;Grosof,B.N.;Wellman,M.P.; and Chan, H. Y. 1999. Toward a declarative language for negotiating executable contracts. In AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99).

....to how auctions are actually created based on our current parameterization of auction design space [11] It expresses defaults for all auction parameters and enforces constraints between them. It also 2 The work presented here is based on a project being conducted in collaboration with IBM [8]. 3 implements a cleaner parameterization of auction design space (discussed in Section 6.1) AuctionGuide is somewhat higher level and expresses various heuristics about how to set auction parameters based on higher level knowledge about a negotiation. It also clusters sets of parameters based ....

....handling. Our work on representing contracts via Courteous LPs builds on prior work at IBM representing business rules. The implementation we are using is a Java library called CommonRules available from IBM [1] 5 Contracting Framework In our prior work on automated contract negotiation [8] we describe the process of automatically turning a partially specified contract into a fully specified, executable one. The partial contract, or contract template, is a declarative description of the space of possible negotiation outcomes with additional rules for influencing how the negotiation ....

[Article contains additional citation context not shown here]

Daniel M. Reeves, Benjamin N. Grosof, Michael P. Wellman, and Hoi Y. Chan. Toward a declarative language for negotiating executable contracts. In AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), Menlo Park, CA, USA, 1999.

....imposes computationally intractable overhead [6] It appears fairly straightforward to extend our BRML DTD in stages so as to express full first order logic and then full KIF. A direction for future work is to create a DTD, maximally compatibly with BRML, that expresses full KIF. In other work [21] , we have extended our contract rule representation approach with negotiation features oriented towards automatic configuration of auctions, including to specify which attributes of a contract are to be the subject of negotiation or bidding. Of course, there is yet more to do to fulfill our ....

Daniel M. Reeves, Benjamin N. Grosof, Michael Wellman, and Hoi Y. Chan. Toward a Declarative Language for Negotiating Executable Contracts. In Proc. AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99).

....imposes computationally intractable overhead [6] It appears fairly straightforward to extend our BRML DTD in stages so as to express full first order logic and then full KIF. A direction for future work is to create a DTD, maximally compatibly with BRML, that expresses full KIF. In other work [21] , we have extended our contract rule representation approach with negotiation features oriented towards automatic configuration of auctions, including to specify which attributes of a contract are to be the subject of negotiation or bidding. Of course, there is yet more to do to fulfill our ....

Daniel M. Reeves, Benjamin N. Grosof, Michael Wellman, and Hoi Y. Chan. Toward a Declarative Language for Negotiating Executable Contracts. In Proc. AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99).

No context found.

D. Reeves, B. Grosof, M. Wellman, and H. Chan. Toward a declarative language for negotiating executable contracts. In Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, pages 39--45, 1999.

No context found.

Reeves, D.; Grosof, B.; Wellman, M.; and Chan, H. 1999. Toward a declarative language for negotiating executable contracts. In Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, 39--45.

No context found.

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.

No context found.

D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan, Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce, AAAI Press / MIT Press (1999).

No context found.

Reeves D. M. et al. (1999). Towards a declarative language for negotiating executable contracts. Proceedings of AAAI99 Workshop on Artificial Intelligence in Electronic Commerce.

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