AIC Seminar Series
Two Possible Solutions for the Compliance Checking Problem
| Son Cao Tran | New Mexico State University | |
Notice: Hosted by Vinay Chaudhri.
Date: Tuesday July 10, 2012 at 16:00
Location: EJ228 (SRI E building) (Directions)
|
|
In this talk, I will discuss two possible solutions for the compliance checking problem. The first approach views the set of business rules as a policy. The second approach views the set of business rules as a commitment between various parties. Compliance checking can then be solved by monitoring the policy or the commitment. I will present possible implementation of each approach via answer set programming. I will also discuss the advantages and/or disadvantages of each approach when compared with the other.
| |
|
Son Cao Tran received his doctoral degree from the University of Texas at El Paso in 2000. He is currently a Computer Science professor at the New Mexico State University in Las Cruces. Before joining NMSU, he was a post-doc at the Knowledge System Laboratory at Stanford University. His main research interests are in planning, argumentation, knowledge representation and reasoning with focus on reasoning about action and change, logic programming, answer set programming and its applications in commonsense reasoning, negotiation, and multi-agent systems. His research in reasoning about action and change in the presence of incomplete information has led to the development of several award-winning conformant planners.
| |
|
Please arrive at least 10 minutes early in order to sign in and be escorted to the conference room. SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors may park in the visitors lot in front of Building E, and should follow the instructions by the lobby phone to be escorted to the meeting room. Detailed directions to SRI, as well as maps, are available from the Visiting AIC web page.
©2013 SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025-3493
SRI International is an independent, nonprofit corporation. Privacy policy
|