2702 search results - page 189 / 541 » Practically Applicable Formal Methods |
89
Voted
CPM
2005
Springer
15 years 4 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
83
Voted
KCAP
2003
ACM
15 years 4 months ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
97
Voted
INLG
2010
Springer
14 years 8 months ago
2010
Springer
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
104
click to vote
CAV
2009
Springer
15 years 11 months ago
2009
Springer
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
106
click to vote
ENTCS
2010
14 years 11 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...