83 search results - page 10 / 17 » A compact fixpoint semantics for term rewriting systems |
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
TACS
1994
Springer
14 years 19 days ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
FQAS
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...