Sciweavers

1023 search results - page 197 / 205
» A Formal Method for Program Slicing
Sort
View
WWW
2008
ACM
15 years 10 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
DIS
2010
Springer
14 years 8 months ago
Discovery of Conservation Laws via Matrix Search
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
Oliver Schulte, Mark S. Drew
WWW
2003
ACM
15 years 10 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon
CAV
2009
Springer
136views Hardware» more  CAV 2009»
15 years 10 months ago
Intra-module Inference
Abstract. Contract-based property checkers hold the potential for precise, scalable, and incremental reasoning. However, it is difficult to apply such checkers to large program mod...
Shuvendu K. Lahiri, Shaz Qadeer, Juan P. Galeotti,...