Sciweavers

1410 search results - page 255 / 282
» Proving theorems by reuse
Sort
View
CSL
2006
Springer
14 years 1 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
ECOOP
2008
Springer
13 years 11 months ago
Integrating Nominal and Structural Subtyping
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
Donna Malayeri, Jonathan Aldrich
ESWS
2008
Springer
13 years 11 months ago
Forgetting Concepts in DL-Lite
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, ...
Zhe Wang, Kewen Wang, Rodney W. Topor, Jeff Z. Pan
EWCBR
2008
Springer
13 years 11 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...
CII
2008
100views more  CII 2008»
13 years 10 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...