The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
Virtual agents designed to establish relationships with more than one user must be able to identify and distinguish among those users with high reliability. We descr...
Daniel Schulman, Mayur Sharma, Timothy W. Bickmore
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Abstract. In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the "justified" ECA rules to captu...
Zongwei Luo, Amit P. Sheth, Krys Kochut, John A. M...