2599 search results - page 210 / 520 » An Operational Semantics for Knowledge Bases |
221
click to vote
ATVA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
169
click to vote
ITNG
2010
IEEE
15 years 11 months ago
2010
IEEE
—In reservoir engineering domain experts deal with many tasks and operations, ranging from reservoir simulation to well maintenance scheduling, with the goal of maximizing oil pr...
169
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
150
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
150
click to vote
SEMWEB
2007
Springer
16 years 17 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...