The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
: Workflow systems often present the user with rich interfaces that express all the capabilities and complexities of the application programs and the computing environments that th...
Philip Maechling, Hans Chalupsky, Maureen Doughert...
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
One of the fundamental ideas of services and service oriented architecture is the possibility to develop new applications by composing existing services into business processes. Ho...