We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
This paper describes a set of tools that allows a developer to instrument an autonomous control system to log data at run-time and then analyze that data to verify correct program...
David Kortenkamp, Reid G. Simmons, Tod Milam, Joaq...
Electronic Brokering, is a good candidate for taking up Semantic Web technology. In this paper we study the brokering and matchmaking problem that is, how a requester’s requirem...
Grigoris Antoniou, Thomas Skylogiannis, Antonis Bi...
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...