Sciweavers

934 search results - page 93 / 187
» Elementary Sets of Logic Programs
Sort
View
ICTAI
2007
IEEE
15 years 4 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
ICLP
2004
Springer
15 years 3 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ICFP
2003
ACM
15 years 10 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
BMCBI
2008
80views more  BMCBI 2008»
14 years 10 months ago
Computational evaluation of TIS annotation for prokaryotic genomes
Background: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotat...
Gang-Qing Hu, Xiaobin Zheng, Li-Ning Ju, Huaiqiu Z...
CPAIOR
2010
Springer
15 years 1 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin