4126 search results - page 183 / 826 » Set based logic programming |
111
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
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...
119
click to vote
FMCAD
2008
Springer
15 years 4 months ago
2008
Springer
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...
114
click to vote
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
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...
130
click to vote
EEE
2005
IEEE
15 years 8 months ago
2005
IEEE
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...
135
click to vote
TPHOL
1998
IEEE
15 years 6 months ago
1998
IEEE
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...